In this paper, we study a dynamic and stochastic pickup and delivery problem proposed recently by Srour, Agatz and Oppen. We demonstrate that the cost structure of the problem permits an effective solution method without generating multiple scenarios. Instead, our method is based on a careful analysis of the transfer probability from one customer to the other. Our computational results confirm the effectiveness of our approach on the dataset of Srour et al., as well as on new, large problem instances.
- Dynamic and stochastic pickup and delivery problems
- Network flows
ASJC Scopus subject areas
- Computer Science(all)
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management