Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection
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 computat...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/11/4/38 |
id |
doaj-28ca712b054b48d0ab2280284ec0f494 |
---|---|
record_format |
Article |
spelling |
doaj-28ca712b054b48d0ab2280284ec0f4942020-11-24T21:19:02ZengMDPI AGAlgorithms1999-48932018-03-011143810.3390/a11040038a11040038Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage CollectionChristos Papalitsas0Panayiotis Karakostas1Theodore Andronikos2Spyros Sioutas3Konstantinos Giannakis4Department of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, GreeceDepartment of Applied Informatics, University of Macedonia, 54636 Thessaloniki, GreeceDepartment of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, GreeceDepartment of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, GreeceDepartment of Informatics, Ionian University, 7 Tsirigoti Square, 49132 Corfu, GreeceGeneral 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.http://www.mdpi.com/1999-4893/11/4/38metaheuristicsVNSquantum-inspiredoptimizationTSProuting algorithmsGPS applicationgarbage collection |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Christos Papalitsas Panayiotis Karakostas Theodore Andronikos Spyros Sioutas Konstantinos Giannakis |
spellingShingle |
Christos Papalitsas Panayiotis Karakostas Theodore Andronikos Spyros Sioutas Konstantinos Giannakis Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection Algorithms metaheuristics VNS quantum-inspired optimization TSP routing algorithms GPS application garbage collection |
author_facet |
Christos Papalitsas Panayiotis Karakostas Theodore Andronikos Spyros Sioutas Konstantinos Giannakis |
author_sort |
Christos Papalitsas |
title |
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection |
title_short |
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection |
title_full |
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection |
title_fullStr |
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection |
title_full_unstemmed |
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection |
title_sort |
combinatorial gvns (general variable neighborhood search) optimization for dynamic garbage collection |
publisher |
MDPI AG |
series |
Algorithms |
issn |
1999-4893 |
publishDate |
2018-03-01 |
description |
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. |
topic |
metaheuristics VNS quantum-inspired optimization TSP routing algorithms GPS application garbage collection |
url |
http://www.mdpi.com/1999-4893/11/4/38 |
work_keys_str_mv |
AT christospapalitsas combinatorialgvnsgeneralvariableneighborhoodsearchoptimizationfordynamicgarbagecollection AT panayiotiskarakostas combinatorialgvnsgeneralvariableneighborhoodsearchoptimizationfordynamicgarbagecollection AT theodoreandronikos combinatorialgvnsgeneralvariableneighborhoodsearchoptimizationfordynamicgarbagecollection AT spyrossioutas combinatorialgvnsgeneralvariableneighborhoodsearchoptimizationfordynamicgarbagecollection AT konstantinosgiannakis combinatorialgvnsgeneralvariableneighborhoodsearchoptimizationfordynamicgarbagecollection |
_version_ |
1726007100647145472 |