A fast two-level variable neighborhood search for the clustered vehicle routing problem
From MaRDI portal
Publication:1652293
DOI10.1016/j.cor.2017.02.007zbMath1458.90609OpenAlexW2586188487MaRDI QIDQ1652293
Kenneth Sörensen, Christof Defryn
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/a1237d44-3207-4cd0-bc36-bb87c137638b
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem ⋮ Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ A parallel variable neighborhood search approach for the obnoxious p‐median problem ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ The clustered team orienteering problem ⋮ Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection ⋮ A unified exact approach for clustered and generalized vehicle routing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- Hybrid metaheuristics for the clustered vehicle routing problem
- Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- Variable neighborhood search
- An efficient transformation of the generalized vehicle routing problem
- New mathematical models of the generalized vehicle routing problem and extensions
- The Truck Dispatching Problem
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- `` Strong NP-Completeness Results
- Some applications of the clustered travelling salesman problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- New heuristics for one-dimensional bin-packing
This page was built for publication: A fast two-level variable neighborhood search for the clustered vehicle routing problem
