The pickup and delivery problem with time windows, multiple stacks, and handling operations

DOI10.1016/j.ejor.2021.11.021zbMath1506.90032MaRDI QIDQ2140213

Timo Gschwind, Marilène Cherkesly

Publication date: 20 May 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.021

zbMATH Keywords

routing; branch-price-and-cut; pickup-and-delivery; last-in-first-out loading; multiple stacks

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

Uses Software

• VRP