Задачі побудови кільцевих маршрутів транспортних засобів у багатопродуктовій ієрархічній мережі

• Datum: 2023
• Hauptverfasser: Vasyanin, Volodymyr, Trofymchuk, Oleksandr, Ushakova, Lyudmila
• Format: Artikel
• Sprache: Ukrainian
• Veröffentlicht: V.M. Glushkov Institute of Cybernetics of NAS of Ukraine 2023
• Schlagworte: багатопродуктові ієрархічні мережі; задачі комбінаторної оптимізації; математичні моделі кільцевих маршрутів транспортних засобів
• Online Zugang: https://jais.net.ua/index.php/files/article/view/58
• Назва журналу: Problems of Control and Informatics

The paper formulates mathematical models for the problems of constructingring routes of vehicles in a multicommodity hierarchical network. As a rule,such networks consist of a decentralized backbone network and networks inthe internal service areas of the backbone nodes (internal networks). In amulticommodity network, each node can exchange products (goods, cargo)with all other nodes. In foreign literature, the design problems of such networks are called Multi-Echelon Location-Routing Problem (ME LRP). InMulti-Echelon LRPs, there are multiple intermediaries between the backbone nodes (central primary nodes) and nodes in the inner zones of thebackbone nodes (end customers, clients), and the distributed product fromthe backbone nodes passes through two or more secondary of intermediaries(called satellites) before reaching the end consumer. In classical LRP twoproblems are combined for a joint solution — the problem of determiningthe location of secondary objects (satellites or depots) and main backboneroutes of vehicles and the problem of constructing ring routes of internal vehicles to serve customers with a known demand for a homogeneous interchangeable product. Unlike distribution problems for a homogeneous interchangeable product, in multicommodity LRP (MC LRP), product flows arenot interchangeable — the flow of each product must be delivered from aspecific primary object to a specific client. In this paper, it is assumed thatthe multi-level structure of the transport network has already been determined and the geographic location of the backbone nodes and their internalservice areas with the set of pickup and delivery cargo nodes (clients) areknown. Therefore, the problems of determining the main backbone routes ofvehicles and constructing ring routes of internal vehicles are considered independently of each other. The types of costs of real transport processes arediscussed, which should be taken into account when forming the objectivefunction of routing problems, and mathematical models are proposed for theproblems of constructing combined (Vehicle Routing Problem with Simultaneous Pickup and Delivery) and split (The Split Delivery Vehicle RoutingProblem) ring routes with a heterogeneous fleet of vehicles. The possibilityof solving the formulated problems with the help of well-known packages ofmixed and integer linear programming is noted.