Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

Chun Yu Ren

doi:10.4028/www.scientific.net/AMM.253-255.1459

Paper Titles

The Analysis of Behavioral Responses to Transit Information
p.1431

On Hybrid Control System Methods for Traffic and Transportation System
p.1438

A High Performance Algorithm of Vehicle Plate Location and Recognition in Intelligent Transportation
p.1443

A System Analysis Tool for Airline Gate Assignments
p.1453

Improved Genetic Algorithm for Capacitated Vehicle Routing Problem
p.1459

Milk-Run Vehicle Routing Optimization Model and Algorithm of Automobile Parts
p.1463

Urban and Rural Logistics and Distribution System Based on Supply and Marketing Cooperatives
p.1468

The Planning of the Dynamic Path of the 3rd Party Logistics Center, which Based on the Ant Colony Optimization
p.1472

Application of Composite Ant Colony Optimization in Logistics Distribution Center Location
p.1476

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 253-255Improved Genetic Algorithm for Capacitated Vehicle...

Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

Abstract:

This paper studies capacitated vehicle routing problem. Since the standard genetic algorithm is short of convergent speed and partial searching ability as well as easily premature, improved genetic algorithm is then adopted as an optimized solution. Firstly, sequence of real numbers coding is used to simplify the problem; it may construct the initial solution pertinently in order to improve the feasibility. The individual amount control choice strategy can guard the diversity of group. The combined hill-climbing algorithm can strengthen the partial searching ability of chromosome. Finally, comparing to a set of standard test problems, simulation results demonstrate the effectiveness and good quality.

You might also be interested in these eBooks

Sustainable Development of Urban Infrastructure

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 253-255)

Pages:

1459-1462

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.253-255.1459

Citation:

Cite this paper

Online since:

December 2012

Authors:

Chun Yu Ren

Keywords:

Arithmetic Crossover Operator, Capacitated Vehicle Routing Problem, Hill-Climbing Algorithm, Improved Genetic Algorithm (IGA), Individual Amount Control

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] BRAMEL J, SIMCHI-LEVID. A location based heuristic for general routing problem. Operation Research, Vol. 43(1995), P. 649- 660.

DOI: 10.1287/opre.43.4.649

Google Scholar

[2] D. Pisinger, S. Ropke. A general heuristic for vehicle routing problems. Computer and Operations Research, Vol. 34(2007), P. 2403-2435.

DOI: 10.1016/j.cor.2005.09.012

Google Scholar

[3] BAKER B M. AYECHEW M A. A genetic algorithm for the vehicle routing problem. Computers & Operations Research, Vol. 30(2003), P. 787-800.

DOI: 10.1016/s0305-0548(02)00051-5

Google Scholar

[4] ZHAO Yan-wei, WU Bin, JIANG Li, DONG Hong-zhao, WANG Wan-liang. Double populations genetic algorithm for vehicle routing problem. Computer Integrated Manufacturing Systems, Vol. 10(2004), pp.303-306.

Google Scholar

[5] OSMAN I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, Vol. 41(1993), P. 421-451.

DOI: 10.1007/bf02023004

Google Scholar

[6] Chen Ch H, Ting Ch J. An improved ant colony system algorithm for the vehicle routing problem. Journal of the Chinese Institute of Industrial Engineer, Vol. 23(2006), P. 115-126.

DOI: 10.1080/10170660609509001

Google Scholar

[7] C. H. Chen, C. J. Ting, P. C. Chang, Applying a hybrid ant colony system to the vehicle routing problem, in: Computational Science And Its Applications - ICCSA 2005, Proceedings, IV, Lecture Notes in Computer Science, Vol. 34(2005), pp.417-426.

DOI: 10.1007/11424925_45

Google Scholar