{"title":"A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty","authors":"M.E. Bruni, P. Beraldi, S. Khodaparasti","doi":"10.1016/j.endm.2018.07.029","DOIUrl":null,"url":null,"abstract":"<div><p>This paper addresses the <em>k</em>-traveling repairman problem with profits under uncertain travel times, a new vehicle routing problem aimed at visiting a subset of customers in order to collect a revenue, defined as decreasing function of the uncertain arrival times. We adopt a risk-averse approach, enabling the decision maker to manage and control risk, and develop a mean-risk model in which only the first and the second moment of the travel times distribution are required to be known. We propose an adaptive local search heuristic in which, in each iteration, a Greedy Randomized Adaptive Search Procedure is used to generate the initial solution. The effectiveness of the solution approach is shown by the computational experiments performed on a set of instances.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.029","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 16
Abstract
This paper addresses the k-traveling repairman problem with profits under uncertain travel times, a new vehicle routing problem aimed at visiting a subset of customers in order to collect a revenue, defined as decreasing function of the uncertain arrival times. We adopt a risk-averse approach, enabling the decision maker to manage and control risk, and develop a mean-risk model in which only the first and the second moment of the travel times distribution are required to be known. We propose an adaptive local search heuristic in which, in each iteration, a Greedy Randomized Adaptive Search Procedure is used to generate the initial solution. The effectiveness of the solution approach is shown by the computational experiments performed on a set of instances.
期刊介绍：
Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
