Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
DOI10.3390/a11040038zbMath1461.90014OpenAlexW2794880473WikidataQ130110827 ScholiaQ130110827MaRDI QIDQ2331437
Theodore Andronikos, Panayiotis Karakostas, Konstantinos Giannakis, Christos Papalitsas, Spyros Sioutas
Publication date: 29 October 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a11040038
Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for location routing
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Quantum-inspired space search algorithm (QSSA) for global numerical optimization
- A general VNS heuristic for the traveling salesman problem with time windows
- Variable neighborhood search
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- A performance study on multi improvement neighborhood search strategy
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- Variable neighborhood search: basics and variants
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
- An efficient GVNS for solving Traveling Salesman Problem with Time Windows
- Quantum Computing for Computer Scientists
- A novel hybrid quantum-inspired evolutionary algorithm for permutation flow-shop scheduling
This page was built for publication: Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection
