Edge assembly crossover for the capacitated vehicle routing problem

Authors:
Yuichi Nagata
Affiliations:
Graduate School of Information Sciences, Japan Advanced Institute of Science and Technology
Venue:
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Year:
2007

Citing 4
Cited 9

The Granular Tabu Search and Its Application to the Vehicle-Routing Problem

INFORMS Journal on Computing
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
New EAX crossover for large TSP instances

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Fast EAX algorithm considering population diversity for traveling salesman problems

EvoCOP'06 Proceedings of the 6th 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
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem

Expert Systems with Applications: An International Journal
Fifty Years of Vehicle Routing

Transportation Science
Efficient local search limitation strategies for vehicle routing problems

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem

Computers and Operations Research
A study on the effect of the asymmetry on real capacitated vehicle routing problems

Computers and Operations Research
A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints

Computers and Operations Research
Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem

Annals of Mathematics and Artificial Intelligence
Packing first, routing second-a heuristic for the vehicle routing and loading problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an evolutionary algorithm (EA) that applies to the capacitated vehicle routing problem (CVRP). The EA uses edge assembly crossover (EAX) which was originally designed for the traveling salesman problem (TSP). EAX can be straightforwardly extended to the CVRP if the constraint of the vehicle capacity is not considered. To address the constraint violation, the penalty function method with 2-opt and Interchange neighborhoods is incorporated into the EA. Moreover, a local search is also incorporated into the EA. The experimental results demonstrate that the proposed EA can effectively find the best-known solutions on Christofides benchmark. Moreover, our EA found ten new best solutions for Golden instances in a reasonable computation time.