AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
From MaRDI portal
Publication:4675892
DOI10.1142/S0217595905000479zbMath1139.90333MaRDI QIDQ4675892
No author found.
Publication date: 6 May 2005
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The multi-trip vehicle routing problem
- Accelerated branch exchange heuristics for symmetric traveling salesman problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem