Title: Quantum-inspired ant colony algorithm for vehicle routing problem with time windows
Abstract: Vehicle routing problem with time windows(VRPTW) is an important extended type of vehicle routing problem(VRP),and it's a NP-hard problem in combinatorial optimization.A quantum-inspired ant colony algorithm(QACA) for solving vehicle routing problem with time windows is proposed hereof based upon the combination of ant colony optimization and quantum computing.With the transition probability of artificial ants,the heuristic factor with quantum bits,quantum logic gates combined,the capacity as well as the velocity of the algorithm for global search undergoes significant improvability. And the disadvantage of getting into the local optimum can be effectively avoided by the QACA.The computational comparison of series of numerical examples shows that the QACA has a better performance than the ant colony algorithm(ACA) and other algorithms for solving the VRPTW.
Publication Year: 2013
Publication Date: 2013-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot