Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Quantum Inspired General Variable Neighborhood Search (qGVNS) for Dynamic Garbage Collection

Version 1 : Received: 20 November 2017 / Approved: 20 November 2017 / Online: 20 November 2017 (11:37:18 CET)

How to cite: Papalitsas, C.; Karakostas, P.; Andronikos, T.; Sioutas, S.; Giannakis, K. Quantum Inspired General Variable Neighborhood Search (qGVNS) for Dynamic Garbage Collection. Preprints 2017, 2017110128. https://doi.org/10.20944/preprints201711.0128.v1 Papalitsas, C.; Karakostas, P.; Andronikos, T.; Sioutas, S.; Giannakis, K. Quantum Inspired General Variable Neighborhood Search (qGVNS) for Dynamic Garbage Collection. Preprints 2017, 2017110128. https://doi.org/10.20944/preprints201711.0128.v1

Abstract

General Variable Neighborhood Search (GVNS) is a well known and widely used metaheuristic for efficiently solving many NP-hard combinatorial optimization problems. Quantum General Variable Neighborhood Search (qGVNS) is a novel, quantum inspired extension of the conventional GVNS. Its quantum nature derives from the fact that it takes advantage and incorporates tools and techniques from the field of quantum computation. 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 for Geographical Systems (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 symmetric TSP instances (symmetric in order to faithfully simulate GPS problems), which are shown in a series of figures and tables, allow us to conclude that the novel qGVNS algorithm can provide an efficient solution for this type of geographical problems.

Keywords

metaheuristics; VNS; quantum inspired; qGVNS; optimization; TSP; routing algorithms; GPS application; garbage collection

Subject

Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.