Abstract
Logistics faces great challenges in vehicle schedule problem. Intelligence Technologies need to be developed for solving the transportation problem. This paper proposes an improved Quantum-Inspired Evolutionary Algorithm (IQEA), which is a hybrid algorithm of Quantum-Inspired Evolutionary Algorithm (QEA) and greed heuristics. It extends the standard QEA by combining its principles with some heuristics methods. The proposed algorithm has also been applied to optimize a problem which may happen in real life. The problem can be categorized as a vehicle routing problem with time windows (VRPTW), which means the problem has many common characteristics that VRPTW has, but more constraints need to be considered. The basic idea of the proposed IQEA is to embed a greed heuristic method into the standard QEA for the optimal recombination of consignment subsequences. The consignment sequence is the order to arrange the vehicles for the transportation of the consignments. The consignment subsequences are generated by cutting the whole consignment sequence according to the values of quantum bits. The computational result of the simulation problem shows that IQEA is feasible in achieving a relatively optimal solution. The implementation of an optimized schedule can save much more cost than the initial schedule. It provides a promising, innovative approach for solving VRPTW and improves QEA for solving complexity problems with a number of constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alba E., Dorronsoro B. (2006) Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters 98: 225–230
Benioff P. (1980) The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by Turing machines. Journal of Statistical Physics 22: 563–591
Coelho L. S. (2008) A quantum particle swarm optimizer with chaotic mutation operator. Chaos, Solitons and Fractals 37: 1409–1418
Dolgui A., Ofitserov D. (1997) A stochastic method for discrete and continuous optimization in manufacturing systems. Journal of Intelligent Manufacturing 8(5): 405–413
Feng, X. Y., Wang, Y., Ge, H. W., Zhou, C. G., & Liang, Y. C. (2006). Quantum-inspired evolutionary algorithm for travelling salesman problem. Computational Methods, pp. 1363–1367.
Feynman R. (1982) Simulating physics with computers. International Journal of Theoretical Physics 21(6): 467–488
Grover, L. K. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. In Proceedings of the 35th annual symposium on foundations of computer science (pp. 124–134). IEEE Press, Piscataway, NJ.
Han K. H., Kim J. H. (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Transactions on Evolutionary Computation 6(6): 580–593
Hey T. (1999) Quantum computing: An introduction. Computing & Control of Engineering 10(3): 105–112
Ho S. C., Haugland D. (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31: 1947–1964
Hwang H. S. (2002) An improved model for vehicle routing problem with time constraint based on genetic algorithm. Computers & Industrial Engineering 42: 361–369
Li B. B., Wang L. (2007) A hybrid quantum-inspired genetic algorithm for multi-objective scheduling. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 37: 576–591
Li P. C., Li S. Y. (2008) Quantum-inspired evolutionary algorithm for continuous space optimization based on Bloch coordinates of qubits. Neurocomputing 72: 581–591
Ramanan, T. R., Sridharan, R., Shashikant, K. S., & Haq, A. N., (2009). An artificial neural network based heuristic for flow shop scheduling problems. Journal of Intelligent Manufacturing (published online).
Shor, P. W. (1998). Quantum computing. Documenta mathematica. In Extra volume, Proceedings of the International Congress of Mathematicians (pp. 467–486). Germany: Berlin.
Talbi H., Draa A., Batouche M. (2004) A new quantum-inspired Genetic Algorithm for solving the travelling salesman problem. IEEE International Conference on Industrial Technology 3: 1192–1197
Vlachogiannis Y. J. G., Otergaard J. (2009) Reactive power and voltage control based on general quantum genetic algorithms. Expert Systems with Applications 36: 6118–6126
Wang, L., Wu, H., Tang, & Zheng, F. D. (2006). A hybrid quantum-inspired genetic algorithm for flow shop scheduling”, ICIC2006, Part II, LNCS 3654, pp. 636-644.
Wang Y., Feng X. Y., Huang Y. X., Pu D. B., Zhou W. G., Liang C. G., Zhou Y. C. (2007) A novel quantum swarm evolutionary algorithm and its applications. Neurocomputing 70: 633–640
Xiao J. H., Xu J., Chen Z. H., Zhang K., Pan L. Q. (2009) A hybrid quantum chaotic swarm evolutionary algorithm for DNA encoding. Computers and Mathematics with Applications 57: 1949–1958
Zapfel G., Bogl M. (2008) Multi-period vehicle routing and crew scheduling with outsourcing options. Int. J. Production Economics 113: 980–996
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, L., Kowk, S.K. & Ip, W.H. Design of an improved quantum-inspired evolutionary algorithm for a transportation problem in logistics systems. J Intell Manuf 23, 2227–2236 (2012). https://doi.org/10.1007/s10845-011-0568-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-011-0568-7