Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/325184 
Erscheinungsjahr: 
2023
Quellenangabe: 
[Journal:] EURO Journal on Transportation and Logistics (EJTL) [ISSN:] 2192-4384 [Volume:] 12 [Issue:] 1 [Article No.:] 100112 [Year:] 2023 [Pages:] 1-13
Verlag: 
Elsevier, Amsterdam
Zusammenfassung: 
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 that increases in the delay. A solution is a tour determined before the vehicle departs from the depot. The objective is to maximize the sum of the collected prizes net of the expected penalty. The randomness of the travel and service times is modeled by a set of scenarios based on historical data that can be collected from public geographical information services. We present an exact solution method for the problem based on a branch-and-bound algorithm enhanced by a local search procedure at the nodes. A numerical experiment demonstrates the merits of the proposed solution approach. This study is the first to consider an orienteering problem with stochastic travel times and soft time windows, which are more relevant than hard time windows in stochastic settings.
Schlagwörter: 
Orienteering
Time-dependent
Transportation
Vehicle routing
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by-nc-nd Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe
1.34 MB





Publikationen in EconStor sind urheberrechtlich geschützt.