期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 274, 期 3, 页码 909-923出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2018.10.031
关键词
Routing; Dynamic and stochastic pickup and deliver problems; Network flows
资金
- National Research, Development and Innovation Office (NKFIH) [K112881, GINOP-2.3.2-15-2016-00002]
- Ministry of National Economy of Hungary
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. (C) 2018 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据