Abstract
GVNS is a well known and widely used metaheuristic for solving efficiently many NP-Hard Combinatorial Optimization problems. In this paper, the qGVNS, which is a new quantum inspired variant of GVNS, is being introduced. This variant differs in terms of the perturbation phase because it achieves the shaking moves by adopting quantum computing principles. The functionality and efficiency of qGVNS have been tested using a comparative study (compared with the equivalent GVNS results) in selected TSPLib instances, both in first and best improvement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Rego, Csar, Dorabela Gamboa, Fred Glover, and Colin Osterman. 2011. Traveling salesman problem heuristics: Leading methods, implementations and latest advances. European Journal of Operational Research 211(3): 427–441.
Papalitsas, Ch., K. Giannakis, Th. Andronikos, D. Theotokis, and A. Sifaleras. 2015. Initialization methods for the TSP with time windows using variable neighborhood search. In IEEE Proceedings of the 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015), 6–8 July, Corfu.
De Castro, Leandro Nunes. 2006. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. London: Chapman & Hall/CRC.
Dey, Sandip, Siddhartha Bhattacharyya, and Ujjwal Maulik. 2016. New quantum inspired meta-heuristic techniques for multi-level colour image thresholding. Applied Soft Computing 46: 677–702.
Feynman, Richard P. 1982. Simulating physics with computers. International Journal of Theoretical Physics 21(6–7): 467–488.
Feynman, Richard Phillips, J.G. Hey, and Robin W. Allen. 1998. Feynman lectures on computation.
Hagouel, Paul Isaac, and Ioannis G. Karafyllidis. 2012. Quantum computers: Registers, gates and algorithms. In 2012 28th International Conference on Microelectronics Proceedings, May. Institute of Electrical and Electronics Engineers (IEEE).
Narayanan, A., and M. Moore. Quantum-inspired genetic algorithms. In Proceedings of IEEE International Conference on Evolutionary Computation.
Pavithr, R.S., and Gursaran. 2016. Quantum inspired social evolution (QSE) algorithm for 0–1 knapsack problem. Swarm and Evolutionary Computation 29: 33–46.
Fang, Wei, Jun Sun, Huanhuan Chen, and Xiaojun Wu. 2016. A decentralized quantum-inspired particle swarm optimization algorithm with cellular structured population. Information Sciences 330: 19–48.
Zheng, Tianmin, and Mitsuo Yamashiro. 2009. A novel hybrid quantum-inspired evolutionary algorithm for permutation flow-shop scheduling. Journal of Statistics and Management Systems 12(6): 1165–1182.
Lu, Tzyy-Chyang, and Jyh-Ching Juang. 2011. Quantum-inspired space search algorithm (QSSA) for global numerical optimization. Applied Mathematics and Computation 218(6): 2516–2532.
Mladenovic, N., and P. Hansen. 1997. Variable neighborhood search. Computers & Operations Research 24(11): 1097–1100.
Hansen, Pierre, Nenad Mladenovic, Raca Todosijevic, and Sad Hanafi. 2016. Variable neighborhood search: Basics and variants. EURO Journal on Computational Optimization 1–32. doi:10.1007/s13675-016-0075-x.
Mladenovic, Nenad, Raca Todosijevic, and Dragan Uroevic. 2016. Less is more: Basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326: 160–171.
Da Silva, Rodrigo Ferreira, and Sebastin Urrutia. 2010. A general VNS heuristic for the traveling salesman problem with time windows. Discrete Optimization 7(4): 203–211.
Jarboui, Bassem, Houda Derbel, Sad Hanafi, and Nenad Mladenovic. 2013. Variable neighborhood search for location routing. Computers & Operations Research 40(1): 47–57.
Sifaleras, Angelo, and Ioannis Konstantaras. 2017. Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems. Computers & Operations Research 78: 385–392.
Sifaleras, A., I. Konstantaras, and N. Mladenović. 2015. Variable neighborhood search for the economic lot sizing problem with product returns and recovery. International Journal of Production Economics 160: 133–143.
Sifaleras, A., and I. Konstantaras. 2015. General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain. Electronic Notes in Discrete Mathematics 47: 69–76.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Papalitsas, C., Karakostas, P., Kastampolidou, K. (2017). A Quantum Inspired GVNS: Some Preliminary Results. In: Vlamos, P. (eds) GeNeDis 2016. Advances in Experimental Medicine and Biology, vol 988. Springer, Cham. https://doi.org/10.1007/978-3-319-56246-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-56246-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56245-2
Online ISBN: 978-3-319-56246-9
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)