A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem

DOI10.1007/s11590-018-1376-1zbMath1444.90117OpenAlexW2907928238WikidataQ62609177 ScholiaQ62609177MaRDI QIDQ2174909

Stefan Voß, Eduardo Lalla-Ruiz

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/a-popmusic-approach-for-the-multidepot-cumulative-capacitated-vehicle-routing-problem(061e90c9-43b7-4d70-ae1b-e2db18f2dda5).html

zbMATH Keywords

matheuristicPOPMUSICdisaster logisticscustomer-oriented applicationsmulti-depot cumulative vehicle routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

New formulations and solution approaches for the latency location routing problem, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem, A POPMUSIC matheuristic for the capacitated vehicle routing problem, Routing multiple work teams to minimize latency in post-disaster road network restoration, Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization, An iterated local search algorithm for latency vehicle routing problems with multiple depots, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, Mathematical formulations and improvements for the multi-depot open vehicle routing problem, The multi-depot \(k\)-traveling repairman problem

Uses Software

• POPMUSIC

Cites Work

• Unnamed Item
• POPMUSIC as a matheuristic for the berth allocation problem
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
• Ambulance routing for disaster response with patient groups
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A classification of formulations for the (time-dependent) traveling salesman problem
• A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• A heuristic and lower bound for a multi-depot routing problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• The linear ordering problem with cumulative costs
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• The Truck Dispatching Problem
• The minimum latency problem
• The Delivery Man Problem and Cumulative Matroids
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Exploiting Erraticism in Search