Models and algorithms for multiagent hierarchical routing with time windows
From MaRDI portal
Publication:6546368
DOI10.1134/s106423072305009xzbMATH Open1542.90032MaRDI QIDQ6546368
O. O. Makarov, V. A. Luk'yanenko, D. V. Lemtyuzhnikova, M. G. Kozlova
Publication date: 29 May 2024
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO
- Two-echelon vehicle routing problem with satellite bi-synchronization
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- The Traveling-Salesman Problem
- Vehicle Routing Problem with Time Windows
Related Items (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
