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

DOI10.1287/TRSC.27.3.298MaRDI QIDQ4279046zbMATH OpenOpenAlexFDO

Authors L. J. J. van der Bruggen, Peter Cornelis Schuur, 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

local search methodsingle depottraveling salesmanvariable-depth search

Mathematics Subject Classification ID

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

Recommendations

• Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms
• scientific article; zbMATH DE number 1082107
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

Cited in

(16)

• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• Single-vehicle scheduling with time window constraints
• Planning models for long-haul operations of postal and express shipment companies
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• Routing problems: A bibliography
• Metaheuristics: A bibliography
• 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
• Vehicle routing problems with simultaneous pick-up and delivery service.
• 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
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Recent models and algorithms for one-to-one pickup and delivery problems
• A variable depth search branching
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279046)