Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

DOI10.1016/j.ejor.2015.10.046zbMath1346.90088OpenAlexW1848719272MaRDI QIDQ322560

Stefan Irnich, Gilbert Laporte, Marilène Cherkesly, Guy Desaulniers

Publication date: 7 October 2016

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

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

zbMATH Keywords

column generationvalid inequalitiesloading constraintsbranch-price-and-cutvehicle routing with pickups and deliveries

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

The pickup and delivery problem with time windows, multiple stacks, and handling operations, Daily aircraft routing for amphibious ready groups, The pickup and delivery problem with time windows and handling operations, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry, Dynamic courier routing for a food delivery service, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Exact solutions for the collaborative pickup and delivery problem

Cites Work

• Unnamed Item
• Exact algorithms for the double vehicle routing problem with multiple stacks
• An exact solution framework for a broad class of vehicle routing problems
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• An exact method for the double TSP with multiple stacks
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• Exact solutions to the double travelling salesman problem with multiple stacks
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• Cutting planes for branch-and-price algorithms
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Column Generation
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading