scientific article; zbMATH DE number 1488069

MaRDI QIDQ4495169zbMATH OpenFDO

Authors José Brandão

Publication date 23 September 2001

zbMATH Keywords

tabu search metaheuristicvehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Tabu search heuristics for the vehicle routing problem with time windows.
• A metaheuristic for the vehicle-routeing problem with soft time windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• A unified tabu search heuristic for vehicle routing problems with time windows

Cited in

(18)

• A threshold accepting metaheuristic for the vehicle routing problem with time windows.
• A metaheuristic for the time-dependent pollution-routing problem
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Parallelization of a two-phase metaheuristic for routing problems with time windows
• Tabu search heuristics for the vehicle routing problem with time windows.
• A comparison of three metaheuristics for the workover rig routing problem
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
• A metaheuristic for the delivery man problem with time windows
• Scatter search for the vehicle routing problem with time windows
• scientific article; zbMATH DE number 5308350 (Why is no real title available?)
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• A metaheuristic for the vehicle-routeing problem with soft time windows
• scientific article; zbMATH DE number 938657 (Why is no real title available?)
• Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• Combining meta-heuristics to effectively solve the vehicle routing problems with time windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows

This page was built for publication:

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