Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows

DOI10.1287/trsc.27.3.298zbMath0788.90017OpenAlexW2113562462MaRDI QIDQ4279046

Peter Cornelis Schuur, L. J. J. van der Bruggen, Jan Karel Lenstra

Publication date: 24 February 1994

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.27.3.298

zbMATH Keywords

traveling salesmanlocal search methodvariable-depth searchsingle depot

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (16)

Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Routing problems: A bibliography ⋮ Metaheuristics: A bibliography ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows ⋮ A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem ⋮ A variable depth search branching ⋮ Vehicle routing problems with simultaneous pick-up and delivery service. ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service ⋮ Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Planning models for long-haul operations of postal and express shipment companies ⋮ Single-vehicle scheduling with time window constraints ⋮ Perturbation heuristics for the pickup and delivery traveling salesman problem

This page was built for publication: Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows