A Quantum Inspired GVNS: Some Preliminary Results

Papalitsas, Christos; Karakostas, Panagiotis; Kastampolidou, Kalliopi

doi:10.1007/978-3-319-56246-9_23

Cited by 13 publications

(16 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…From 334 the data one may conclude that in all cases qGVNS is at least as good as GVNS, and in many cases 335 outperforms GVNS. This is in accordance with the work in [27], which, through a comparative analysis, 336 also showed that the quantum inspired GVNS achieves better results than the conventional GVNS.…”

Section: Qgvns Versus Nearest Neighbor Variantssupporting

confidence: 89%

“…At this point, it should be mentioned that the Nearest Neighbor heuristic is used in order to produce an initial feasible solution (the first node is set as a depot). From an algorithmic perspective, qGVNS is summarized in the next pseudocode fragment [27].…”

Section: Description Of the Qgvnsmentioning

confidence: 99%

“…337 Table 4. Comparison between qGVNS and the conventional GVNS [27]. Our aim in this paper was the implementation of a method based on well-known metaheuristics that would be efficient enough to solve real world problems, such as garbage collection studied here.…”

Section: Qgvns Versus Nearest Neighbor Variantsmentioning

confidence: 99%

See 2 more Smart Citations

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

Papalitsas¹,

Karakostas²,

Andronikos³

et al. 2017

Preprint

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Qgvns Versus Nearest Neighbor Variantssupporting

confidence: 89%

Section: Description Of the Qgvnsmentioning

confidence: 99%

See 1 more Smart Citation

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

Papalitsas¹,

Karakostas²,

Andronikos³

et al. 2017

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Papalitsas et al [72] developed a metaheuristic based on conventional principles for finding feasible solutions for the TSPTW within a short period of time. Subsequently, a novel quantum-inspired unconventional metaheuristic method, based on the original General Variable Neighborhood Search (GVNS), was proposed in order to solve the standard TSP [73]. This quantum inspired metaheuristic was applied to the solution of the garbage collection problem modeled as a TSP instance [18].…”

Section: Previous Work On Tsptwmentioning

confidence: 99%

A QUBO Model for the Traveling Salesman Problem with Time Windows

et al. 2019

Self Cite

View full text Add to dashboard Cite

This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality constraints, which are known to be particularly difficult to articulate within the QUBO framework. This is, we believe, the first time this major obstacle is overcome and the TSPTW is cast in the QUBO formulation. We have every reason to anticipate that this development will lead to the actual execution of small scale TSPTW instances on the D-Wave platform.

show abstract

“…In addition to the aforementioned conventional approach, we propose an unconventional GVNS scheme that solves the TSP with Time Windows using quantum inspired principles on the perturbation function. For those two separate implementations we also followed [30,31]. In this paragraph the design and implementation process will be discussed.…”

Section: Our Approachmentioning

confidence: 99%

Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

Papalitsas

Andronikos

2019

Technologies

Self Cite

View full text Add to dashboard Cite

GVNS, which stands for General Variable Neighborhood Search, is an established and commonly used metaheuristic for the expeditious solution of optimization problems that belong to the NP-hard class. This paper introduces an expansion of the standard GVNS that borrows principles from quantum computing during the shaking stage. The Traveling Salesman Problem with Time Windows (TSP-TW) is a characteristic NP-hard variation in the standard Traveling Salesman Problem. One can utilize TSP-TW as the basis of Global Positioning System (GPS) modeling and routing. The focus of this work is the study of the possible advantages that the proposed unconventional GVNS may offer to the case of garbage collector trucks GPS. We provide an in-depth presentation of our method accompanied with comprehensive experimental results. The experimental information gathered on a multitude of TSP-TW cases, which are contained in a series of tables, enable us to deduce that the novel GVNS approached introduced here can serve as an effective solution for this sort of geographical problems.

show abstract

A Quantum Inspired GVNS: Some Preliminary Results

Cited by 13 publications

References 17 publications

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

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

A QUBO Model for the Traveling Salesman Problem with Time Windows

Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

Contact Info

Product

Resources

About