Mixed Ant Colony Algorithm for Vehicle Routing Problem with Time Windows

Jian Wang; Hong Yun Li; Hong Chen

doi:10.4028/www.scientific.net/AMR.706-708.855

Paper Titles

Integrity Protection of the Intelligent Robot's Remote Information
p.836

Localization of Magnetometer Sensor Based on Magnetic Gradient
p.840

Magnetic Field Intensity Gradient Method on the Detection of a Remote Target
p.845

Mechanical Analysis of Snake-Like Robot for Colonoscopy
p.849

Mixed Ant Colony Algorithm for Vehicle Routing Problem with Time Windows
p.855

Modeling and Simulation of Circulating Fluidized Bed Boiler Combustion System Based on Neural Network
p.859

Multiobjective Topology Optimization of Multi-Input and Multi-Output Compliant Mechanisms with Geometrically Nonlinearity
p.864

Multi-Step Ahead Prediction for Electromechanical Device Using Multivariate SVM Predictor
p.878

On Study of High Speed Permanent Magnet Synchronous Motor without Iron Core
p.882

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 706-708Mixed Ant Colony Algorithm for Vehicle Routing...

Mixed Ant Colony Algorithm for Vehicle Routing Problem with Time Windows

Abstract:

To optimize the vehicle routing problem with time windows(VRPTW), a mixed ant colony algorithm (MACO) was proposed to accomplish the vehicles’ scheduling. The pheromone adaptive volatile strategy takes real-time traffic status into consideration. Algorithm was accomplished on computer with the c# language.10 examples were calculated. Results show, MACO has a quick convergence rate, the result is stable.

You might also be interested in these eBooks

Mechatronics and Intelligent Materials III

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 706-708)

Pages:

855-858

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.706-708.855

Citation:

Cite this paper

Online since:

June 2013

Authors:

Jian Wang, Hong Yun Li, Hong Chen

Keywords:

Ant Colony Algorithm (ACA), Pheromone Update Strategy, VRPTW

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Jose Brandao: A Tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Computers&Operations Research, 2011).

DOI: 10.1016/j.cor.2010.04.008

Google Scholar

[2] Ren yingtao, Maged Dessouky and Fernando Ordonez: The multi-shift vehicle routing problem with overtime (Computer&operations research,2010).

DOI: 10.1016/j.cor.2010.01.016

Google Scholar

[3] Habibeh Nazif, Lai soon lee: Optimised crossover genetic algorithm for capacitated vehicle routing problem(Applied Methematical Modeling.,2012).

DOI: 10.1016/j.apm.2011.08.010

Google Scholar

[4] W.Y. Szeto, Yongzhong Wu and Sin c Ho: Anartificial bee colony algorithm for the capacitated vehicle routing problem(European Journal of operational research,2011).

DOI: 10.1016/j.ejor.2011.06.006

Google Scholar

[5] Duan haibin: Principle and Application of Ant Colony Algorithm (Science Press,2005).

Google Scholar

[6] Marius M, Solomon M: Algorithms for vehicle routing and scheduling problems with time window constrains(Operation Research,1987).

Google Scholar