Extensions to the generalised assignment heuristic for vehicle routing

DOI10.1016/S0377-2217(98)00348-8zbMath0934.90006MaRDI QIDQ1806768

Janice Sheasby, Barrie M. Baker

Publication date: 27 April 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicvehicle routing problemgeneralised assignment problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Use of the BATA algorithm and MIS to solve the mail carrier problem, A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, Delivery pattern and transportation planning in grocery retailing, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, A Survey of the Generalized Assignment Problem and Its Applications, Accelerating the convergence of subgradient optimisation, A visual interactive approach to vehicle routing, A genetic algorithm for the vehicle routing problem

Uses Software

• OR-Library
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem: An overview of exact and approximate algorithms
• The vehicle routing problem: An overview of exact and approximate algorithms
• Routing problems: A bibliography
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Further Inprovements to Vehicle Routeing Heuristics
• Parallel iterative search methods for vehicle routing problems
• Cross decomposition for mixed integer programming
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem