Study on Hybrid Genetic Algorithm for Capacitated Vehicle Routing Problem

Chun Yu Ren

doi:10.4028/www.scientific.net/AMM.178-181.1769

Paper Titles

Research on Transportation Structure Model of Dispersed Multi-Center Urban Based on Urban Rail Transit
p.1753

The Study on Transport Organization Process Design of Self-Supporting Railway Company
p.1757

Study on Equalization of Urban-Rural Public Transportation
p.1761

Application of Multiple-Factor Prediction Model on the DALIAN New Airport`s Freight Traffic Volume
p.1765

Study on Hybrid Genetic Algorithm for Capacitated Vehicle Routing Problem
p.1769

Study on Freight Traffic Flow of Port
p.1773

Study of Traffic Accessibility in Poyang Lake Economic Zone Oriented by High-Speed Railway
p.1778

Effects of the Visibility on Traffic Flow
p.1782

Simulation and Experiment for Highway Toll Station
p.1786

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 178-181Study on Hybrid Genetic Algorithm for Capacitated...

Study on Hybrid Genetic Algorithm for Capacitated Vehicle Routing Problem

Abstract:

Capacitated vehicle routing problem is logistics optimization indispensable part. The hybrid genetic algorithm is used to optimize the solution. Firstly, use sequence of real numbers coding so as to simplify the problem; Construct the initial solution to improve the feasibility; adopt some arithmetic crossover operator to enhance whole search ability of the chromosome. Secondly, use Boltzmann simulated annealing mechanism to improve the convergence speed and search efficiency. Finally, comparing to other algorithms, the results demonstrate the effectiveness and good quality.

You might also be interested in these eBooks

Sustainable Environment and Transportation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 178-181)

Pages:

1769-1772

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.178-181.1769

Citation:

Cite this paper

Online since:

May 2012

Authors:

Chun Yu Ren

Keywords:

Arithmetic Crossover Operator, Boltzmann Mechanism, Capacitated Vehicle Routing Problem, Hybrid Genetic Algorithm

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. Mester, O. Brays. Active-guided evolution strategies for large scale capacitated vehicle routing problems. Computers and Operations Research, Vol. 34(2007), P. 2964-2975

DOI: 10.1016/j.cor.2005.11.006

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] 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

[5] R.Tavakkoli-Moghaddam, N. Safaei, YGholipour. A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation, Vol. 176(2006), P. 445-454

DOI: 10.1016/j.amc.2005.09.040

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] XIAOJian-mei, LIJun-jun, WANG Xi-huai. Modified particle swarm optimization algorithm for vehicle routing problem. Computer Integrated Manufacturing Systems, Vol. 11(2005), P. 577-581

Google Scholar