A lower bound based meta-heuristic for the vehicle routing problem

MaRDI QIDQ2776554zbMATH OpenFDO

Authors José Brandão

Publication date 28 February 2002

zbMATH Keywords

tabu searchvehicle routing problemheuristic method

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Traffic problems in operations research (90B20)

Recommendations

• A Tabu Search Heuristic for the Vehicle Routing Problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• scientific article; zbMATH DE number 2209651
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search

Cited in

(4)

• A tabu search algorithm for the open vehicle routing problem
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• A new variant of a vehicle routing problem: Lower and upper bounds
• A new tabu search algorithm for the vehicle routing problem with backhauls

This page was built for publication: A lower bound based meta-heuristic for the vehicle routing problem

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