Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Computers and Operations Research
Genetic algorithms and tabu search: hybrids for optimization
Computers and Operations Research - Special issue on genetic algorithms
MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows
MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
Discrete Applied Mathematics
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
Localized genetic algorithm for vehicle routing problem with time windows
Applied Soft Computing
A parallel iterated tabu search heuristic for vehicle routing problems
Computers and Operations Research
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.