AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
From MaRDI portal
Publication:4675892
DOI10.1142/S0217595905000479zbMATH Open1139.90333OpenAlexW2090954564MaRDI QIDQ4675892FDOQ4675892
Authors:
Publication date: 6 May 2005
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595905000479
Recommendations
- An improved ant colony optimization for vehicle routing problem
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Local search with annealing-like restarts to solve the VRPTW
- A tabu search heuristic for the multi-depot vehicle routing problem
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- The multi-trip vehicle routing problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Computer Solutions of the Traveling Salesman Problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Accelerated branch exchange heuristics for symmetric traveling salesman problems
Cited In (3)
This page was built for publication: AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675892)