A Hybrid Ant Algorithm for the Vehicle Routing Problem

Yu Li; Liang Ma

doi:10.4028/www.scientific.net/AMM.182-183.2118

Paper Titles

A Genetic Algorithm with Weight-Based Encoding for One-Dimensional Bin Packing Problem
p.2100

An Anti-Eavesdropping Network Coding Algorithm
p.2105

A Multi-Strategy Word Sense Disambiguation Method
p.2109

The Gray Processing of Moon Digital Orthophoto Map
p.2113

A Hybrid Ant Algorithm for the Vehicle Routing Problem
p.2118

A Maintenance Strategy of Materialized Views in Distributed Environment
p.2123

The Research of MapReduce on the Cloud Computing
p.2127

Study on Filter Algorithm of QoS-Based Fuzzy Multi-Attribute Web Service Composition
p.2131

Dynamic Service Selection Based on Ant Colony System
p.2136

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 182-183A Hybrid Ant Algorithm for the Vehicle Routing...

A Hybrid Ant Algorithm for the Vehicle Routing Problem

Abstract:

A hybrid algorithm for solving the vehicle routing problem is proposed based upon the combination of Ant Colony Optimization and quantum computing. The algorithm takes the advantage of the principles in quantum computing, such as the qubit, quantum gate, and the quantum superposition of states. It can search the best solution by quantum walk and can further improve the search capability of the algorithm for the best solution. Numerical examples are tested and verified, that show the good performances.

You might also be interested in these eBooks

Applied Mechanics and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 182-183)

Pages:

2118-2122

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.182-183.2118

Citation:

Cite this paper

Online since:

June 2012

Authors:

Yu Li, Liang Ma

Keywords:

Ant Algorithm, Hybrid Algorithm, Quantum Computing, Vehicle Routing Problem (VRP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Dantizig G, Rmser J. The truck dispatching problem. Management Science. 1959, 6(1): 80-91.

Google Scholar

[2] Daniele Vigo. A heuristic algorithm for the asymmetric capacitated vehicle routing problem. European Journal of Operational Research, 1996, 89(1): 108-126.

DOI: 10.1016/s0377-2217(96)90060-0

Google Scholar

[3] Caroline Prodhon, A hybrid evolutionary algorithm for the periodic location-routing problem. European Journal of Operational Research, 2011, 210(2011): 204-212.

DOI: 10.1016/j.ejor.2010.09.021

Google Scholar

[4] Yannis M, Magdalene M, Georgios D. A hybrid particle swarm optimization algorithm for the vehicle routing problem. Engineering Applications of Artificial Intelligence 23 (2010): 463–472.

DOI: 10.1016/j.engappai.2010.02.002

Google Scholar

[5] Dorigo M, Maniezzo V, Colorni A. The ant system: optimization by ant colony cooperating agents. IEEE Trans. Sys. Man, Cybern., 1996, 26 (2): 29-41.

DOI: 10.1109/3477.484436

Google Scholar

[6] Ma liang, Zhu Gang. Ant Colony Optimization Algorithm. Beijing: Science Press. 2008. 8.

Google Scholar

[7] Han Kuk-Hyun, Kim Jong-Hwan. Quantum-inspired Evolutionary Algorithms with a New Termination Criterion. IEEE Trans on Evolutionary Computation, 2004, 8(2): 156-169.

DOI: 10.1109/cec.2004.1331155

Google Scholar

[8] Michael A. Nielsen, Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, (2000).

Google Scholar