Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
From MaRDI portal
Publication:666967
DOI10.1016/j.ejor.2019.01.041zbMath1430.90141OpenAlexW2799339823WikidataQ128515169 ScholiaQ128515169MaRDI QIDQ666967
Michael Drexl, Stefan Irnich, Christian Tilk
Publication date: 12 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1801.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (2)
A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A column generation algorithm for the vehicle routing problem with soft time windows
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Arc routing problems with time-dependent service costs
- The vehicle routing problem. Latest advances and new challenges.
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
- A method for solving ship routing problems with inventory constraints
- A mixed-integer model for solving ordering problems with side constraints
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- Fleet assignment and routing with schedule synchronization constraints
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
- Improved branch-cut-and-price for capacitated vehicle routing
- Dynamic graph generation for the shortest path problem in time expanded networks
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Resource extension functions: properties, inversion, and generalization to segments
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Vehicle Routing
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- A nested column generation algorithm to the meta slab allocation problem in the steel making industry
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- The vehicle routing problem with time windows and temporal dependencies
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Efficient Production-Distribution System Design
- Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The Split Delivery Vehicle Routing Problem: A Survey
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Column Generation
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Benchmarking optimization software with performance profiles.
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
This page was built for publication: Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
