Efficient local search limitation strategies for vehicle routing problems

Authors:
Yuichi Nagata;Olli Bräysy
Affiliations:
Graduate School of Information Sciences, Japan Advanced Institute of Science and Technology, Japan;Agora Innoroad Laboratory, Agora Center, University of Jyväskylä, Finland
Venue:
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Year:
2008

Citing 10
Cited 5

Experiments on traveling salesman heuristics

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Classical heuristics for the capacitated VRP

The vehicle routing problem
Metaheuristics for the capacitated VRP

The vehicle routing problem
Solving the vehicle routing problem with adaptive memory programming methodology

Computers and Operations Research
Computing nine new best-so-far solutions for capacitated VRP with a cellular Genetic algorithm

Information Processing Letters
A general heuristic for vehicle routing problems

Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems

Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
Accelerating local search in a memetic algorithm for the capacitated vehicle routing problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Edge assembly crossover for the capacitated vehicle routing problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization

A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

Computers and Operations Research
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research
A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A Parallel Algorithm for the Vehicle Routing Problem

INFORMS Journal on Computing
A Parallel Algorithm for the Vehicle Routing Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful memetic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.