A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

DOI10.1016/j.ejor.2013.08.032zbMath1304.90038OpenAlexW2058742972MaRDI QIDQ2514732

Jens Lysgaard, Sanne Wøhlk

Publication date: 3 February 2015

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

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

zbMATH Keywords

routingbranch-and-cut-and-priceminimum latencyCCVRP

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (19)

Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ 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 ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ 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 ⋮ 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 ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ The cumulative school bus routing problem: Polynomial‐size formulations ⋮ Minimizing latency of capacitated \(k\)-tours ⋮ Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation ⋮ The multi-depot \(k\)-traveling repairman problem ⋮ A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning ⋮ A heuristic for cumulative vehicle routing using column generation

Uses Software

• VRP
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for the traveling repairman problem with profits
• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
• Machine scheduling with deliveries to multiple customer locations
• Exact algorithms for the minimum latency problem
• Approximation algorithm for minimizing total latency in machine scheduling with deliveries
• Special issue on: Rich vehicle routing problems
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A simple and effective metaheuristic for the minimum latency problem
• Approximating the \(k\)-traveling repairman problem with repair times
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Solution of a Min-Max Vehicle Routing Problem
• Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
• Energy Minimizing Vehicle Routing Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Column Generation
• Shortest Path Problems with Resource Constraints

This page was built for publication: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem