The pickup and delivery problem with alternative locations and overlapping time windows

DOI10.1016/j.cor.2022.105758OpenAlexW4213283684MaRDI QIDQ2147021

Yanyan Li

Publication date: 22 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105758

zbMATH Keywords

adaptive large neighborhood searchpickup and delivery problemalternative locationslocker boxesroaming deliveries

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• OpenStreetMap
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• The pickup and delivery problem with time windows
• Variable neighborhood search
• Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach
• The multi-pickup and delivery problem with time windows
• Solution techniques for the inter-modal pickup and delivery problem in two regions
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Vehicle routing with private and shared delivery locations
• The moving-target traveling salesman problem
• The General Pickup and Delivery Problem
• The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
• A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone