A hybrid VND method for the split delivery vehicle routing problem

DOI10.1016/j.endm.2014.11.002zbMath1362.90091OpenAlexW2038152838MaRDI QIDQ2631222

Yury A. Kochetov, A. Khmelev

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.002

zbMATH Keywords

metaheuristicdiversificationejection chainvariable neighborhoods

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

New exact solution approaches for the split delivery vehicle routing problem ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups

Cites Work

• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• Variable neighborhood search
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Unnamed Item

This page was built for publication: A hybrid VND method for the split delivery vehicle routing problem