A New Variant of Dynamic Pickup and Delivery Problem with Time Windows

VALENTA, Petr, Hana RUDOVÁ and Soumen ATTA. A New Variant of Dynamic Pickup and Delivery Problem with Time Windows. Online. In Scheduling and Planning Applications woRKshop (SPARK). 2020, p. 1-3.

Basic information

Original name

A New Variant of Dynamic Pickup and Delivery Problem with Time Windows

Authors

VALENTA, Petr, Hana RUDOVÁ and Soumen ATTA

Edition

Scheduling and Planning Applications woRKshop (SPARK), p. 1-3, 3 pp. 2020

---

Other information

Language

English

Type of outcome

Stať ve sborníku

Country of publisher

France

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

References:

URL

Organization unit

Faculty of Informatics

Keywords in English

Dynamic vehicle routing; meta-heuristics; search; logistics

Tags

International impact, Reviewed

---

Abstract

V originále

Motivated by the challenges faced by a logistics company, we present a new variant of the dynamic capacitated pickup and delivery problem with time windows (PDPTW) where excessive changes of unaffected routes are undesirable. In real-life scenarios, different dynamism sources such as canceled requests, change of demands, change of pickup, or delivery time windows often disrupt the existing planning of routes. The static PDPTW is solved with the current information about the problem well before executing the routes, such as the previous night. We present an algorithmic idea of a dynamic solver quickly addressing changes that occur due to the dynamism while avoiding excessive modifications to the previous solution. Since the company has not yet the dynamic data, new dynamic instances are generated from the existing static PDPTW instances in the literature. Preliminary results demonstrate that we can quickly incorporate the required changes. Future perspectives of this ongoing work are discussed in the end.