A two-phase metaheuristic for the cumulative capacitated vehicle routing problem

DOI10.1016/J.COR.2012.08.020zbMath1349.90859OpenAlexW2030007454MaRDI QIDQ340275

Liangjun Ke, Zu-Ren Feng

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.020

zbMATH Keywords

local searchvehicle routing problemmetaheuristic

Mathematics Subject Classification ID

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

Related Items (14)

New formulations and solution approaches for the latency location routing problem ⋮ Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem ⋮ The latency location-routing problem ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem ⋮ The multi-vehicle cumulative covering tour problem ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ Multi-criteria optimization for last mile distribution of disaster relief aid: test cases and applications ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem ⋮ A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ The multi-depot \(k\)-traveling repairman problem ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem ⋮ A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning

This page was built for publication: A two-phase metaheuristic for the cumulative capacitated vehicle routing problem