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

Péter Györgyi, T. Kis

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
JournalEuropean Journal of Operational Research
DOIs
Publication statusAccepted/In press - Jan 1 2018

Fingerprint

Pickup and Delivery
Pickups
Probabilistic Approach
Time Windows
Uncertainty
Costs
Computational Results
Customers
Scenarios
Demonstrate
Time windows
Pickup and delivery
Cost structure

Keywords

  • Dynamic and stochastic pickup and delivery problems
  • Network flows
  • Routing

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

@article{9d817ddd38a141eb94cb69fa554e08da,
title = "A probabilistic approach to pickup and delivery problems with time window uncertainty",
abstract = "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.",
keywords = "Dynamic and stochastic pickup and delivery problems, Network flows, Routing",
author = "P{\'e}ter Gy{\"o}rgyi and T. Kis",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.ejor.2018.10.031",
language = "English",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",

}

TY - JOUR

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

AU - Györgyi, Péter

AU - Kis, T.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Dynamic and stochastic pickup and delivery problems

KW - Network flows

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=85055744428&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055744428&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2018.10.031

DO - 10.1016/j.ejor.2018.10.031

M3 - Article

AN - SCOPUS:85055744428

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

ER -