Quantum evolutionary algorithm for capacitated vehicle routing problem

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice

Volumn 29, Issue 2, 2009, Pages 159-166

  Zhao, Yan Wei ^a   Peng, Dian Jun ^a   Zhang, Jing Ling ^a   Wu, Bin ^a  

^a ZHEJIANG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Capacitated vehicle routing problem; Cataclysm; Quantum evolutionary algorithm; Rotation gate

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; QUANTUM THEORY; ROTATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES;

BENCH-MARK PROBLEMS; CAPACITATED VEHICLE ROUTING PROBLEM; CATACLYSM; EARLY CONVERGENCES; EFFICIENT METHODS; EXCELLENT PERFORMANCE; INTELLIGENT OPTIMIZATION ALGORITHMS; LOCAL OPTIMAL SOLUTIONS; MATRIX ENCODING; NP-COMPLETE PROBLEMS; OTHER ALGORITHMS; QUANTUM EVOLUTIONARY ALGORITHM; QUANTUM ROTATIONS; SOLUTION SPACES; VEHICLE ROUTING PROBLEMS;

EVOLUTIONARY ALGORITHMS;

EID: 62249099833     PISSN: 10006788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science, 1959, 4(6): 80-91.
2. Golden B, Assad A, Levy L, et al. The fleet size and mix vehicle routing problem[J]. Computers and Operations Research, 1984, 11(1): 49-66.
3. Kolen A W J, Rinnooy Kan A H G, Trienekens H W J M. Vehicle routing with time windows[J]. Operations Research, 1987, 35(2): 266-273.
4. Malandraki C, Daskin M S. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms[J]. Transportation Science, 1992, 24(3): 185-200.
5. Sariklis D, Powell S. A heuristic method for the open vehicle routing problem[J]. Journal of the Operational Research Society, 2000, 51(5): 565-573.
6. Berger J, Salois M, Begin R. A hybird genetic algorithm for the vehicle routing problem with time windows[C]//Advances in Artificial Intelligence, 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, 1998: 114-127.
7. Czech Z J, Czarnas P. Parallel simulated for the vehicle routing problem with time windows[C]//Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2002: 376-383.
8. Xiao J M, Huang Y F, Li J J, Wang X H. Vehicle routing problem bases on discrete particle swarm optimization[J]. Systems Engineering, 2005, 23(4): 97-100.
9. Tian P, Ma J, Zhang D M. Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism[J]. European Journal of Operational Research, 1999, 118(1): 81-94.
10. Yuan J, Liu J, Lu H Q. Annealed neural networks approach to the vehicle routing problem with stochastic demands[J]. Systems Engineering-Theory and Practice, 2002, 22(3): 109-113.
11. Shor P W. Algorithms for quantum computation: Discrete logarithms and factoring[C]//Proc of the 35th Annual Symposium on the Foundation of Computer Sciences, 1994: 124-134.
12. Grover L K. A Fast quantum mechanical algorithm for database search[C]//Proc of the 28th Annual ACM Symposium on the Theory of Computing, Pennsylvania, 1996: 212-219.
13. Bennett C H. Quantum Information and Computation[J]. Nature, 2000, 404: 247-255.
14. Narayanan A, Moore M. Quantum inspired genetic algorithms[C]//Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996: 61-66.
15. Han K H, Kim J H. Genetic quantum algorithm and its application to combinatorial optimization problem[C]//Proceedings of the 2000 Congress on Evolutionary Computation, 2: 1354-1360.
16. Han K H, Kim J H. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(6): 580-593.
17. Han K H, Kim J H. Quantum-inspired evolutionary algorithms with a new termination criterion, h-epsilon gate, and two-phase scheme[J]. IEEE Traps on Evolutionary Computation, 2004, 8(2): 156-169.
18. Wang L, Wu H, Tang F, et al. A hybrid quantum-inspired genetic algorithm for flow shop scheduling[C]//Advances in Intelligent Computing. International Conference on Intelligent Computing, 2005: 636-644.
19. Zhao Y W, Wu B, Jiang L, et al. Double populations genetic algorithm for vehicle routing problem[J]. Computer Integrated Manufacturing Systems, 2004, 10(3): 303-306.
20. Hey T. Quantum computing: An introduction[J]. Computing and Control Engineering Journal, 1999, 10(3): 105-112.
21. Jiang D L, Yang X L, Du W, et al. A study on the genetic algorithm for vehicle routing problem[J]. Systems Engineering-Theory and Practice, 1999, 19(6): 44-45.
22. Lysgaard J, Letchford A N, Eglese R W. A new branch-and-cut algorithm for the capacitated vehicle routing problem[J]. Mathematical Programming, 2004, 100(2): 423-445.
23. Wu B, Wang W L, Zhao Y W, Xu X L, Yang F Y. A novel real number encoding method of particle swarm optimization for vehicle routing problem[C]//The 6th World Congress on Intelligent Control and Automation, VOLS1-12, Conference Processing, 2006: 3271-3275.
24. Gao H, Xu G H, Wang Z R. An improved quantum evolutionary algorithm and its application to a real distribution routing problem[J]. Control Theory and Applications, 2007, 24(6): 969-972.
25. Alfares F, Alfares M, Esat II. Quantum-inspired evolution algorithm: Experimental analysis[C]//Adaptive Computing in Design and Manufacture VI, 2004: 377-389.
26. Li P C, Li S Y. Quantum ant colony algorithm for continuous space optimization[J]. Control Theory and Applications, 2008, 25(2): 237-241.