Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
From MaRDI portal
Publication:5086000
DOI10.1287/ijoc.2021.1105OpenAlexW3212336222MaRDI QIDQ5086000
Siqian Shen, Viswanath Nagarajan, Miao Yu
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1105
column generationparallel computingelementary shortest pathrandom coloringvehicle routing problem (VRP)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A hybrid algorithm for a class of vehicle routing problems
- Solving the orienteering problem with time windows via the pulse framework
- On an exact method for the constrained shortest path problem
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
- An exact solution framework for a broad class of vehicle routing problems
- Home health care routing and scheduling: a review
- New benchmark instances for the capacitated vehicle routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Color-coding
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
This page was built for publication: Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
