Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems

DOI10.1016/j.ejor.2017.09.035zbMath1403.90114OpenAlexW2732379263MaRDI QIDQ1754114

Timo Gschwind, Christian Tilk, Ann-Kathrin Rothenbächer, Stefan Irnich

Publication date: 30 May 2018

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_1710.pdf

zbMATH Keywords

column generationroutingpickup-and-deliverybidirectional labelingshortest-path problem with resource constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (8)

The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ A generic exact solver for vehicle routing and related problems ⋮ Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands ⋮ Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• The pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and handling operations
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• 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
• Resource extension functions: properties, inversion, and generalization to segments
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• Vehicle Routing
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Column Generation
• Shortest Path Problems with Resource Constraints
• Benchmarking optimization software with performance profiles.

This page was built for publication: Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems