A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
From MaRDI portal
Publication:2514732
DOI10.1016/J.EJOR.2013.08.032zbMATH Open1304.90038OpenAlexW2058742972MaRDI QIDQ2514732FDOQ2514732
Authors: 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
Recommendations
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Integer Programming and Combinatorial Optimization
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Shortest Path Problems with Resource Constraints
- Machine scheduling with deliveries to multiple customer locations
- Title not available (Why is that?)
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Column Generation
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Title not available (Why is that?)
- Energy Minimizing Vehicle Routing Problem
- Special issue on: Rich vehicle routing problems
- Approximating the \(k\)-traveling repairman problem with repair times
- Heuristics for the traveling repairman problem with profits
- A simple and effective metaheuristic for the minimum latency problem
- Solution of a min-max vehicle routing problem
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Exact algorithms for the minimum latency problem
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries
Cited In (29)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- A price-directed decomposition approach for solving large-scale capacitated part-routing problems
- Heuristic solution approaches for the cumulative capacitated vehicle routing problem
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- Minimizing latency of capacitated \(k\)-tours
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- The cumulative school bus routing problem: Polynomial‐size formulations
- New formulations and solution approaches for the latency location routing problem
- Cumulative vehicle routing problem: a column generation approach
- A branch-and-price algorithm for the minimum latency problem
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- The latency location-routing problem
- The multi-vehicle cumulative covering tour problem
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle 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
- A heuristic for cumulative vehicle routing using column generation
- A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
- An adaptive large neighborhood search for the multi-point dynamic aggregation problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Integrated production scheduling and delivery routing: complexity results and column generation
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- The multi-depot \(k\)-traveling repairman problem
Uses Software
This page was built for publication: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514732)
