%0 Journal Article
%T Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection
%A Christos Papalitsas
%A Konstantinos Giannakis
%A Panayiotis Karakostas
%A Spyros Sioutas
%A Theodore Andronikos
%J Algorithms | An Open Access Journal from MDPI
%D 2018
%R https://doi.org/10.3390/a11040038
%X Abstract 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. View Full-Tex
%K metaheuristics
%K VNS
%K quantum-inspired
%K optimization
%K TSP
%K routing algorithms
%K GPS application
%K garbage collection
%U https://www.mdpi.com/1999-4893/11/4/38