Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows

DOI10.3138/infor.46.3.165OpenAlexW2108839477MaRDI QIDQ6160362

Gilbert Laporte, Vitória Pureza

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.46.3.165

zbMATH Keywords

time-dependent travel timesdynamic pickup and delivery problemsrequest bufferingvehicle waiting

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Heuristics for electric taxi fleet management at Teo Taxi, Measures of dynamism and urgency in logistics, Step cost functions in a fleet size and mix vehicle routing problem with time windows, The dynamic multi-period vehicle routing problem, Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels, Dynamic pickup and delivery problems, Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review, TLHSA and SACA: two heuristic algorithms for two variant VRP models, Opportunities for reinforcement learning in stochastic dynamic vehicle routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• Vehicle dispatching with time-dependent travel times
• Dynamic vehicle routing: Status and prospects
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Efficient modeling of travel in networks with time-varying link speeds
• Partially dynamic vehicle routing—models and algorithms
• The General Pickup and Delivery Problem
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching