The pickup and delivery problem with time windows and handling operations

DOI10.1016/j.cor.2016.07.014zbMath1391.90098OpenAlexW2478610019MaRDI QIDQ1652028

Gilbert Laporte, Marilène Cherkesly, Marjolein Veenstra, Guy Desaulniers

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://research.rug.nl/en/publications/the-pickup-and-delivery-problem-with-time-windows-and-handling-operations(0c1a0247-d6df-4234-8046-3856f01e3442).html

zbMATH Keywords

column generationvalid inequalitiesbranch-price-and-cutvehicle routing with pickups and deliverieshandling operations

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) Combinatorial optimization (90C27)

Related Items

The pickup and delivery problem with time windows, multiple stacks, and handling operations, Exact algorithms for the multi-pickup and delivery problem with time windows, A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry, Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• 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
• Cutting planes for branch-and-price algorithms
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• The General Pickup and Delivery Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows