Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows
From MaRDI portal
Publication:5106417
DOI10.1287/ijoc.2021.1151zbMath1497.90051OpenAlexW3105239291MaRDI QIDQ5106417
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1151
Uses Software
Cites Work
- Rich vehicle routing problems: from a taxonomy to a definition
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- A column generation algorithm for the vehicle routing problem with soft time windows
- Anticipatory optimization for dynamic decision making
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- 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
- Interior point stabilization for column generation
- Vehicle routing problem with elementary shortest path based column generation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- 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
- Julia: A Fresh Approach to Numerical Computing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows
- JuMP: A Modeling Language for Mathematical Optimization
- Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
This page was built for publication: Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows
