A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
From MaRDI portal
Publication:2174909
Recommendations
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- POPMUSIC for a real-world large-scale vehicle routing problem with time windows
- scientific article; zbMATH DE number 3883903
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- On a \textsc{Capacitated Multivehicle Routing Problem}
Cites work
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A heuristic and lower bound for a multi-depot routing problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A tabu search heuristic for the multi-depot vehicle routing problem
- Ambulance routing for disaster response with patient groups
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Exploiting erraticism in search
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- POPMUSIC as a matheuristic for the berth allocation problem
- The Delivery Man Problem and Cumulative Matroids
- The linear ordering problem with cumulative costs
- The minimum latency problem
- The truck dispatching problem
Cited in
(11)- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Mathematical formulations and improvements for the multi-depot open vehicle routing problem
- POPMUSIC for a real-world large-scale vehicle routing problem with time windows
- 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
- New formulations and solution approaches for the latency location routing problem
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- An iterated local search algorithm for latency vehicle routing problems with multiple depots
- The multi-depot \(k\)-traveling repairman problem
This page was built for publication: A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174909)