The Improved Route Optimization Based on Hybrid Optimization Algorithm Based on GA and TS

Jun Ma; Li Ying Zhang

doi:10.4028/www.scientific.net/AMM.170-173.3695

Paper Titles

Study on Highway Safety Simulation Evaluation Model and Method
p.3677

Numerical Simulation Study on Quasi-Static Fracture Problem of Implicit Methods
p.3683

3D Dynamic Numerical Simulation of Water-Air Two-Phase Flow of Flaring Gate Pier and Stilling Pool
p.3687

Research on Grid Generation
p.3691

The Improved Route Optimization Based on Hybrid Optimization Algorithm Based on GA and TS
p.3695

A Study of the General Method Used in Geotechnical Engineering Numerical Calculating Grid of CAD Graph Cutting
p.3699

Simulation Study on the Stability of Mining Thin Flat-Grade Iron Ore Body with Hydraulic Support Longwall Method
p.3706

Groundwater Seepage Rule Simulation of Horse River Based on MIDAS/GTS
p.3715

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 170-173The Improved Route Optimization Based on Hybrid...

The Improved Route Optimization Based on Hybrid Optimization Algorithm Based on GA and TS

Abstract:

The vehicle routing planning in the process of logistics is a hot issue. There is a lack of traditional genetic algorithm used to solve this issue, so the taboos is introduced to improve it. The improved genetic algorithm based on taboos get high-search speed compared to the traditional genetic algorithm, and this improvement is verified by the example.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 170-173)

Pages:

3695-3698

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.170-173.3695

Citation:

Cite this paper

Online since:

May 2012

Authors:

Jun Ma, Li Ying Zhang

Keywords:

Genetic Algorithm (GA), Logistic, Routing Planning, Taboos Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Brian Kallehauge, Jesper Larsen, Oli B.G. Madsen. Lagrangian duality applied to the vehicle routing problem with time windows[J]. Computers&Operations Research. 2006,33: 1464-1487.

DOI: 10.1016/j.cor.2004.11.002

Google Scholar

[2] David Pisinger, Stefan Ropke. A general heuristic for vehicle routing problems. Computers&Operations Research.2005:24-26.

DOI: 10.1016/j.cor.2005.09.012

Google Scholar

[3] Homberger, Gehring. A two-phase hybrid meta-heuristic for the vehicle routing problem with time windows. European Journal of Operational Research, 2005, 220-238.

DOI: 10.1016/j.ejor.2004.01.027

Google Scholar

[4] Ferland J A. The vehicle scheduling problem with multiple vehicle types [J].Journal of the Operational Research Society,1988,38:213-238.

Google Scholar

[5] Christofides N, Mingozzi A, Toth P. Exact algorithms for the vehicle routing problem, based on spanning the shortest path relaxation [J]. Mathematical programming.1981,(20):255-282.

DOI: 10.1007/bf01589353

Google Scholar