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: | Christos Papalitsas, Panayiotis Karakostas, Theodore Andronikos, Spyros Sioutas, Konstantinos Giannakis |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/11/4/38 |
Similar Items
-
Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows
by: Christos Papalitsas, et al.
Published: (2019-08-01) -
A QUBO Model for the Traveling Salesman Problem with Time Windows
by: Christos Papalitsas, et al.
Published: (2019-10-01) -
A Performance Study of the Impact of Different Perturbation Methods on the Efficiency of GVNS for Solving TSP
by: Christos Papalitsas, et al.
Published: (2019-09-01) -
Optimization of Truck-Drone Parcel Delivery Using Metaheuristics
by: Sarab AlMuhaideb, et al.
Published: (2021-07-01) -
Collectors of survival: the “living material” in the scene of garbage
by: Carlos Antonio de Souza Moraes
Published: (2010-05-01)