Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem

DOI10.1016/j.ejor.2015.08.067zbMath1346.90170OpenAlexW1778127384MaRDI QIDQ320880

Christian Prins, Juan Carlos Rivera, H. Murat Afsar

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.08.067

zbMATH Keywords

disaster logisticsmultitrip cumulative capacitated single-vehicle routing problemresource constrained shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items

New formulations and solution approaches for the latency location routing problem, The constrained shortest path problem with stochastic correlated link travel times, A branch-and-price algorithm for the minimum latency problem, A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem, Routing multiple work teams to minimize latency in post-disaster road network restoration, 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, A truck and drones model for last-mile delivery: a mathematical model and heuristic approach, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, The multi-depot \(k\)-traveling repairman problem, Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A classification of formulations for the (time-dependent) traveling salesman problem
• The asymmetric traveling salesman problem with replenishment arcs
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• A simple and effective metaheuristic for the minimum latency problem
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
• OR/MS research in disaster operations management
• Approximating the \(k\)-traveling repairman problem with repair times
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• The minimum latency problem
• Solution of a Min-Max Vehicle Routing Problem
• Special cases of traveling salesman and repairman problems with time windows
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Delivery Man Problem and Cumulative Matroids
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Time‐dependent traveling salesman problem–the deliveryman case
• The traveling salesman problem with cumulative costs
• The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon