Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
Summary: 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.
- A generalized variable neighborhood search for combinatorial optimization problems
- A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- Genetic Quantum Particle Swarm Optimization Algorithm for Solving Traveling Salesman Problems
- A general VNS heuristic for the traveling salesman problem with time windows
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A general VNS heuristic for the traveling salesman problem with time windows
- A novel hybrid quantum-inspired evolutionary algorithm for permutation flow-shop scheduling
- A performance study on multi improvement neighborhood search strategy
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- An efficient GVNS for solving traveling salesman problem with time windows
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- Quantum Computing for Computer Scientists
- Quantum-inspired space search algorithm (QSSA) for global numerical optimization
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Variable neighborhood search
- Variable neighborhood search for location routing
- Variable neighborhood search: basics and variants
This page was built for publication: Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331437)
