Extensions to the generalised assignment heuristic for vehicle routing

DOI10.1016/S0377-2217(98)00348-8MaRDI QIDQ1806768zbMATH OpenFDO

Authors Barrie Baker, Janice Sheasby

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)

Recommendations

• A Tabu Search Heuristic for the Vehicle Routing Problem
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• A unified tabu search heuristic for vehicle routing problems with time windows
• scientific article; zbMATH DE number 1082107

Cites work

• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• Cross decomposition for mixed integer programming
• Further Inprovements to Vehicle Routeing Heuristics
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Parallel iterative search methods for vehicle routing problems
• Routing problems: A bibliography
• The traveling salesman problem: An overview of exact and approximate algorithms
• The vehicle routing problem: An overview of exact and approximate algorithms

Cited in

(13)

• A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
• Use of the BATA algorithm and MIS to solve the mail carrier problem
• Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
• A genetic algorithm for the vehicle routing problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• A Survey of the Generalized Assignment Problem and Its Applications
• Accelerating the convergence of subgradient optimisation
• Delivery pattern and transportation planning in grocery retailing
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• An efficient transformation of the generalized vehicle routing problem
• Tuning a parametric Clarke–Wright heuristic via a genetic algorithm
• Extensions of the Petal Method for Vehicle Routeing
• A visual interactive approach to vehicle routing

Describes a project that uses

Uses Software

• VRP
• OR-Library

This page was built for publication: Extensions to the generalised assignment heuristic for vehicle routing

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