{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T01:05:03Z","timestamp":1782349503860,"version":"3.54.5"},"reference-count":43,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>General variable neighborhood search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. We propose a novel extension of the conventional GVNS. Our approach incorporates ideas and techniques from the field of quantum computation during the shaking phase. The travelling salesman problem (TSP) is a well known NP-hard problem which has broadly been used for modelling many real life routing cases. As a consequence, TSP can be used as a basis for modelling and finding routes via the Global Positioning System (GPS). In this paper, we examine the potential use of this method for the GPS system of garbage trucks. Specifically, we provide a thorough presentation of our method accompanied with extensive computational results. The experimental data accumulated on a plethora of TSP instances, which are shown in a series of figures and tables, allow us to conclude that the novel GVNS algorithm can provide an efficient solution for this type of geographical problem.<\/jats:p>","DOI":"10.3390\/a11040038","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T12:17:24Z","timestamp":1522153044000},"page":"38","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-796X","authenticated-orcid":false,"given":"Christos","family":"Papalitsas","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panayiotis","family":"Karakostas","sequence":"additional","affiliation":[{"name":"Department of Applied Informatics, University of Macedonia, 54636 Thessaloniki, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theodore","family":"Andronikos","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4199-6708","authenticated-orcid":false,"given":"Konstantinos","family":"Giannakis","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,3,27]]},"reference":[{"key":"ref_1","unstructured":"Voigt, B.F. (1981). Der Handlungsreisende, Wie er Sein Soll und was er zu thun Hat, um Auftr\u00e4ge zu Erhalten und Eines Gl\u00fccklichen Erfolgs in Seinen Gesch\u00e4ften Gewiss zu zu Sein. Commis-Voageur, Ilmenau, Verlag Bernd Schramm."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley.","DOI":"10.2307\/2582681"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","article-title":"Traveling salesman problem heuristics: Leading methods, implementations and latest advances","volume":"211","author":"Rego","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Papalitsas, C., Giannakis, K., Andronikos, T., Theotokis, D., and Sifaleras, A. (2015, January 6\u20138). Initialization methods for the TSP with Time Windows using Variable Neighborhood Search. Proceedings of the IEEE 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015), Corfu, Greece.","DOI":"10.1109\/IISA.2015.7388106"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","article-title":"A General VNS heuristic for the traveling salesman problem with time windows","volume":"7","author":"Silva","year":"2010","journal-title":"Discrete Optim."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.endm.2012.10.012","article-title":"An efficient GVNS for solving Traveling Salesman Problem with Time Windows","volume":"39","author":"Mladenovic","year":"2012","journal-title":"Electron. Notes Discrete Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.asoc.2015.09.042","article-title":"New quantum-inspired meta-heuristic techniques for multi-level colour image thresholding","volume":"46","author":"Dey","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.swevo.2016.02.006","article-title":"Quantum Inspired Social Evolution (QSE) algorithm for 0\u20131 knapsack problem","volume":"29","author":"Pavithr","year":"2016","journal-title":"Swarm Evol. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ins.2015.09.055","article-title":"A decentralized quantum-inspired particle swarm optimization algorithm with cellular structured population","volume":"330","author":"Fang","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_10","first-page":"1165","article-title":"A novel hybrid quantum-inspired evolutionary algorithm for permutation flow-shop scheduling","volume":"12","author":"Zheng","year":"2009","journal-title":"J. Stat. Manag. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2516","DOI":"10.1016\/j.amc.2011.07.067","article-title":"Quantum-inspired space search algorithm (QSSA) for global numerical optimization","volume":"218","author":"Lu","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1016\/j.pnsc.2009.02.007","article-title":"A novel quantum-inspired immune clonal algorithm with the evolutionary game approach","volume":"19","author":"Wu","year":"2009","journal-title":"Prog. Nat. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"586","DOI":"10.3390\/computation3040586","article-title":"Dominant Strategies of Quantum Games on Quantum Periodic Automata","volume":"3","author":"Giannakis","year":"2015","journal-title":"Computation"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.eswa.2016.08.060","article-title":"A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem","volume":"65","author":"Sze","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.cor.2017.02.007","article-title":"A fast two-level variable neighborhood search for the clustered vehicle routing problem","volume":"83","author":"Defryn","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ejor.2017.04.046","article-title":"Order matters\u2013A Variable Neighborhood Search for the Swap-Body Vehicle Routing Problem","volume":"263","author":"Huber","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1111\/tgis.12045","article-title":"A comparative analysis of traveling salesman solutions from geographic information systems","volume":"18","author":"Curtin","year":"2014","journal-title":"Trans. GIS"},{"key":"ref_18","unstructured":"Papalitsas, C., Karakostas, P., Giannakis, K., Sifaleras, A., and Andronikos, T. (2017, January 8\u201310). Initialization methods for the TSP with Time Windows using qGVNS. Proceedings of the 6th International Symposium on Operational Research, OR in the Digital Era\u2014ICT Challenges, Thessaloniki, Greece."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1080\/23335777.2017.1358765","article-title":"RFID-based smart parking management system","volume":"3","author":"Tsiropoulou","year":"2017","journal-title":"Cyber Phys. Syst."},{"key":"ref_20","unstructured":"Liebig, T., Piatkowski, N., Bockermann, C., and Morik, K. (2014, January 28). Predictive Trip Planning - Smart Routing in Smart Cities. Proceedings of the Workshops of the EDBT\/ICDT 2014 Joint Conference (EDBT\/ICDT 2014), Athens, Greece."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1186\/s12942-016-0034-z","article-title":"Performance analysis of multiple Indoor Positioning Systems in a healthcare environment","volume":"15","author":"Crombez","year":"2016","journal-title":"Int. J. Health Geogr."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.4258\/hir.2011.17.1.18","article-title":"Hospital wireless local area network-based tracking system","volume":"17","author":"Woo","year":"2011","journal-title":"Healthc. Inform. Res."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Glover, F., Kochenberger, G.A., Glover, F., and Kochenberger, G.A. (2003). Handbook of Metaheuristics, Kluwer Academic Publishers.","DOI":"10.1007\/b101874"},{"key":"ref_24","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovic","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","article-title":"Variable neighborhood search: Basics and variants","volume":"5","author":"Hansen","year":"2017","journal-title":"EURO J. Comput. Optim."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","article-title":"Less is more: Basic variable neighborhood search for minimum differential dispersion problem","volume":"326","author":"Mladenovic","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","article-title":"Variable neighborhood search for location routing","volume":"40","author":"Jarboui","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ijpe.2014.10.003","article-title":"Variable neighborhood search for the economic lot sizing problem with product returns and recovery","volume":"160","author":"Sifaleras","year":"2015","journal-title":"Int. J. Prod. Econ."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.endm.2014.11.010","article-title":"General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain","volume":"47","author":"Sifaleras","year":"2015","journal-title":"Electron. Notes Discrete Math."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","article-title":"Simulating physics with computers","volume":"21","author":"Feynman","year":"1982","journal-title":"Int. J. Theor. Phys."},{"key":"ref_32","unstructured":"Feynman, R.P., Hey, J., and Allen, R.W. (1998). Feynman Lectures on Computation, CRC Press."},{"key":"ref_33","unstructured":"Nielsen, M.A., and Chuang, I.L. (2004). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Yanofsky, N.S., Mannucci, M.A., and Mannucci, M.A. (2008). Quantum Computing for Computer Scientists, Cambridge University Press.","DOI":"10.1017\/CBO9780511813887"},{"key":"ref_35","unstructured":"Vlamos, P. (2017). A Quantum Inspired GVNS: Some Preliminary Results. GeNeDis 2016, Springer International Publishing."},{"key":"ref_36","first-page":"12","article-title":"An Introduction to Geographic Information Systems: Linking Maps to Databases","volume":"15","author":"Franklin","year":"1992","journal-title":"Database"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/02693799308901962","article-title":"Guest editorial latest developments in GIS\/LIS","volume":"7","author":"Muller","year":"1993","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-9236(94)00018-N","article-title":"Spatial decision support systems: An overview of technology and a test of efficacy","volume":"14","author":"Crossland","year":"1995","journal-title":"Decis. Support Syst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-9236(97)00054-7","article-title":"Spatial decision support systems for vehicle routing","volume":"22","author":"Keenan","year":"1998","journal-title":"Decis. Support Syst."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Asimakopoulos, G., Christodoulou, S., Gizas, A., Triantafillou, V., Tzimas, G., Gialelis, J., Voyiatzis, A., Karadimas, D., and Papalambrou, A. (2015, January 18\u201322). Architecture and Implementation Issues, Towards a Dynamic Waste Collection Management System. Proceedings of the 24th International Conference on World Wide Web, Florence, Italy.","DOI":"10.1145\/2740908.2742134"},{"key":"ref_41","unstructured":"Reinelt, G. (2017, September 25). TSPLIB. Available online: http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/."},{"key":"ref_42","first-page":"17","article-title":"Double-ended nearest and loneliest neighbour\u2014A nearest neighbour heuristic variation for the travelling salesman problem","volume":"6","author":"Pimentel","year":"2016","journal-title":"Revista de Ci\u00eancias da Computa\u00e7\u00e3o"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.endm.2017.03.026","article-title":"A performance study on multi improvement neighborhood search strategy","volume":"58","author":"Rios","year":"2017","journal-title":"Electron. Notes Discrete Math."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/4\/38\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T14:58:38Z","timestamp":1760194718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/4\/38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,27]]},"references-count":43,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["a11040038"],"URL":"https:\/\/doi.org\/10.3390\/a11040038","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,27]]}}}