The data-driven time-dependent orienteering problem with soft time windows

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

EURO Journal on Transportation and Logistics Pub Date : 2023-01-01 DOI:10.1016/j.ejtl.2023.100112

Edison Avraham, Tal Raviv

{"title":"The data-driven time-dependent orienteering problem with soft time windows","authors":"Edison Avraham, Tal Raviv","doi":"10.1016/j.ejtl.2023.100112","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437623000092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

Abstract

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.

查看原文本刊更多论文

带软时间窗的数据驱动时变定向问题

在本文中，我们研究了定向运动问题的一个扩展，其中旅行时间是随机的且与时间相关，服务时间是随机。此外，每个选定客户的服务都有一个软时间窗口；也就是说，违反窗口是允许的，但要受到增加延迟的惩罚。解决方案是在车辆离开停车场之前确定一个行程。目标是最大限度地提高所收取奖金的总和减去预期罚款。旅行和服务时间的随机性是由一组基于历史数据的场景建模的，这些历史数据可以从公共地理信息服务中收集。我们提出了一种基于分支定界算法的精确求解方法，该算法通过节点处的局部搜索过程来增强。数值实验证明了所提出的求解方法的优点。本研究首次考虑具有随机旅行时间和软时间窗的定向运动问题，在随机环境中，软时间窗比硬时间窗更相关。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

EURO Journal on Transportation and Logistics Multiple-

CiteScore

4.60

自引率

0.00%

发文量

审稿时长

129 days

期刊介绍： The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.