Solving capacitated vehicle routing problems by modified differential evolution

Authors:
Jian-jun Lei;Jian Li
Affiliations:
Department of Computer Engineering, Hubei University of Education, Wuhan, China;Department of Computer Engineering, Hubei University of Education, Wuhan, China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2
Year:
2010

Citing 5
Cited 1

Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem

Operations Research
Solving Traveling Salesman Problems by Genetic Differential Evolution with Local Search

PEITS '08 Proceedings of the 2008 Workshop on Power Electronics and Intelligent Transportation System
A hybrid genetic algorithm that optimizes capacitated vehicle routing problems

Expert Systems with Applications: An International Journal
Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem

Computers and Industrial Engineering
Solving capacitated vehicle routing problems via genetic particle swarm optimization

IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application

A statistical study of discrete differential evolution approaches for the capacitated vehicle routing problem.

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To solve capacitated vehicle routing problems (CVRP), a modified differential evolution (MOE) was employed, which was derived from the differential evolution (DE) and incorporated with the genetic reproduction mechanisms, namely crossover and mutation. The Greedy Subtour Crossover (GSX) was employed to generate an offspring to denote the difference of the parents. A modified ordered crossover (MOX) was employed to perform mutation to generate trial vector with user defined parameters, the parameters were used to control the rates of the target vector components and the mutated vector components in the trial vector. Moreover, the 2-opt local search was implemented to optimize the sub routings. MOE was implemented to the well-known CVRP benchmarks. The simulation results have shown the feasibility and the effectiveness of the approach.