The data-driven time-dependent orienteering problem with soft time windows
In this paper, we study an extension of the orienteering problem where travel times are random and time-dependent and service times are random. Additionally, the service at each selected customer is subject to a soft time window; that is, violation of the window is allowed but subject to a penalty t...
Main Authors: | Edison Avraham, Tal Raviv |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2023-01-01
|
Series: | EURO Journal on Transportation and Logistics |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192437623000092 |
Similar Items
-
Waste Collection Vehicle Routing Problem with TimeWindows for Route Optimization of Garbage Transport Vehicles
by: Evi Yuliza, et al.
Published: (2023-01-01) -
A Modified Camel Algorithm for Optimizing Green Vehicle Routing Problem with Time Windows
by: Dana Marsetiya Utama, et al.
Published: (2022-06-01) -
An Enhanced Approach for the Multiple Vehicle Routing Problem with Heterogeneous Vehicles and a Soft Time Window
by: He-Yau Kang, et al.
Published: (2018-11-01) -
Container routing in multimodal and time – dependent network using genetic algorithms
by: Claudiu Domuţă, et al.
Published: (2011-12-01) -
Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach
by: Hasibe Berfu Demir, et al.
Published: (2022-10-01)