A probabilistic approach to pickup and delivery problems with time window uncertainty

DOI10.1016/j.ejor.2018.10.031zbMath1430.90085OpenAlexW2898187187MaRDI QIDQ1755385

Tamás Kis, Péter Györgyi

Publication date: 9 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/9511/

zbMATH Keywords

network flowsroutingdynamic and stochastic pickup and delivery problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (2)

Optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network of railway terminal ⋮ Heterogeneous instant delivery orders scheduling and routing problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• The dynamic multiperiod vehicle routing problem with probabilistic information
• Local search heuristics for the probabilistic dial-a-ride problem
• Dynamic pickup and delivery problems
• Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search
• A review of dynamic vehicle routing problems
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers

This page was built for publication: A probabilistic approach to pickup and delivery problems with time window uncertainty