An Improved Ant Colony Optimization for VRP with Time Windows

Su Ping Yu; Ya Ping Li

doi:10.4028/www.scientific.net/AMM.263-266.1609

Paper Titles

An Analysis Method of Semantic Relevancy on Controlled Tag
p.1588

An Approach to Detect Similar Script Functions in Web Applications Based on Calling Information
p.1593

An Audit-Integrated ARBAC Model
p.1600

An Efficient Approach of Convex Hull Triangulation Based on Monotonic Chain
p.1605

An Improved Ant Colony Optimization for VRP with Time Windows
p.1609

An Improved Three-Dimensional Target Octonion Representation
p.1614

Construction and Application of WD-GA-SVR Model - CSI 300 Index Forecast
p.1619

Design and Implementation of ARM-Based Mobile Handheld Terminal for Community Medical
p.1623

Design of Virtual Machine Monitor for Embedded Systems
p.1629

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 263-266An Improved Ant Colony Optimization for VRP with...

An Improved Ant Colony Optimization for VRP with Time Windows

Abstract:

The Vehicle Routing Problem (VRP) is an important problem occurring in many distribution systems, which is also defined as a family of different versions such as the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). The Ant Colony Optimization (ACO) is a metaheuristic for combinatorial optimization problems. Given the ACO inadequacy, the vehicle routing optimization model is improved and the transfer of the algorithm in corresponding rules and the trajectory updated regulations is reset in this paper, which is called the Improved Ant Colony Optimization (I-ACO). Compared to the calculated results with genetic algorithm (GA) and particle swarm optimization (PSO), the correctness of the model and algorithm is verified. Experimental results show that the I-ACO can quickly and effectively obtain the optimal solution of VRFTW.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 263-266)

Pages:

1609-1613

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.263-266.1609

Citation:

Cite this paper

Online since:

December 2012

Authors:

Su Ping Yu, Ya Ping Li

Keywords:

Ant Attracion, Ant Colony Optimization Algorithm (ACOA), Evenness of Solution, Vehicle Routing Problem with Time Windows

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] P. Toth, D. Vigo, "The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications," SIAM. Philadelphia . 2001.75 -879

Google Scholar

[2] M. Fisher, "Vehicle routing," Handbooks of Operations Research and Management Science, chapter 1.1995. 31 -987

Google Scholar

[3] M. W. P. Savelsbergh, "Local search in routing problems with time windows,"Annals of Operations Research.vol 4.1985.285- 985

DOI: 10.1007/bf02022044

Google Scholar

[4] I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Annals of Operations Research. 1993. 421 -1325

DOI: 10.1007/bf02023004

Google Scholar

[5] M. Gendreau, A. Hertz, and G. Laporte, "A tabu search heuristic for the vehicle routing problem," Management Science.1994.40(10). 1276 -2945

DOI: 10.1287/mnsc.40.10.1276

Google Scholar

[6] P. Toth, D. Vigo, "The granular tabu search and its application to the vehicle routing problem," INFORMS Journal on Computing. 2003.15(4). 346 -2987

DOI: 10.1287/ijoc.15.4.333.24890

Google Scholar

[7] A. Van Breedam, "An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem," RUCA Working Paper 14, University of Antwerp, Belgium, 1996.27- 558

Google Scholar