Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
From MaRDI portal
Publication:2197321
DOI10.1007/s10951-019-00620-yzbMath1446.90079OpenAlexW2905740732MaRDI QIDQ2197321
Timo Gschwind, Simon Emde, Stefan Irnich, Christian Tilk
Publication date: 31 August 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1805.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows, Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition, How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola
- Parallel machine scheduling with precedence constraints and setup times
- Scheduling with a minimum number of machines
- The school bus routing problem: a review
- Direct shipping and the dynamic single-depot/multi-retailer inventory system
- A branch-and-price algorithm for the minimum latency problem
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- A new branching strategy for time constrained routing problems with application to backhauling
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- A heuristic for cumulative vehicle routing using column generation
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A survey of scheduling problems with setup times or costs
- Resource extension functions: properties, inversion, and generalization to segments
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Parallel Machine Scheduling by Column Generation
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Vehicle Routing
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- Solving Parallel Machine Scheduling Problems by Column Generation
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- The k -traveling repairmen problem
- Column Generation
- Shortest Path Problems with Resource Constraints
- Scheduling
