Models and algorithms for multiagent hierarchical routing with time windows

DOI10.1134/S106423072305009XMaRDI QIDQ6546368zbMATH OpenFDO

Authors M. G. Kozlova, D. V. Lemtyuzhnikova, V. A. Luk'yanenko, O. O. Makarov

Publication date 29 May 2024

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S106423072305009X

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
• The traveling-salesman problem
• Two-echelon vehicle routing problem with satellite bi-synchronization
• Vehicle Routing Problem with Time Windows
• Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO

Cited in

(1)

• The choice of algorithms for solving a multi-agent routing problem based on solving related problems

This page was built for publication: Models and algorithms for multiagent hierarchical routing with time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546368)