Parallelization of a two-phase metaheuristic for routing problems with time windows

DOI10.1023/A:1015053600842zbMATH Open1012.68793OpenAlexW1597183383MaRDI QIDQ1850981FDOQ1850981

Authors: Hermann Gehring, Jörg Homberger 

Publication date: 15 December 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015053600842

Recommendations

• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A parallel algorithm for the vehicle routing problem with time window constraints
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• scientific article; zbMATH DE number 1488069
• An asynchronous parallel metaheuristic for the period vehicle routing problem
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Combining meta-heuristics to effectively solve the vehicle routing problems with time windows

zbMATH Keywords

hybridizationtime windowsmetaheuristictabu searchvehicle routingparallelizationevolution strategy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Cited In (20)

• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• Scatter search for the vehicle routing problem with time windows
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• An integrated approach to the vehicle routing and container loading problems
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• A generic exact solver for vehicle routing and related problems
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Parallel solution methods for vehicle routing problems
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
• Tabu search heuristics for the vehicle routing problem with time windows.
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
• A memetic algorithm for the vehicle routing problem with time windows
• A new mixed integer linear model for a rich vehicle routing problem with docking constraints
• Vehicle routing problem with time windows and a limited number of vehicles.
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

This page was built for publication: Parallelization of a two-phase metaheuristic for routing problems with time windows

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