An Improving Genetic Algorithm for Vehicle Routing Problem with Time Windows

Author

Chunhua, Tang

Author_Institution

Bus. Coll., Hunan Int. Econ. Univ., Changsha, China

Volume

1

fYear

2010

fDate

11-12 May 2010

Firstpage

603

Lastpage

606

Abstract

In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved genetic algorithm (IGA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional genetic algorithm (GA). The novel crossover-operator, swapping operator and inversion operator as the core of IGA were constructed to solve VRPTW. The experiment results showed that the IGA can solve VRPTW effectively.

Keywords

genetic algorithms; integer programming; transportation; crossover-operator; improved genetic algorithm; inversion operator; mixed integer programming mathematic model; swapping operator; time windows; vehicle routing problem; Automation; Convergence; Costs; Educational institutions; Genetic algorithms; Intelligent vehicles; Linear programming; Mathematical model; Mathematics; Routing; improved genetic algorithm (IGA); integer programming; logistics; optimization; vehicle routing problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4244-7279-6

Electronic_ISBN

978-1-4244-7280-2

Type

conf

DOI

10.1109/ICICTA.2010.646

Filename

5523021