Ala-Eddine Yahiaoui, Mikael Rönnqvist, Jean-François Audy
{"title":"A mathheuristic approach for the vehicle routing problem with queuing considerations","authors":"Ala-Eddine Yahiaoui, Mikael Rönnqvist, Jean-François Audy","doi":"10.1007/s10479-025-06647-z","DOIUrl":null,"url":null,"abstract":"<div><p>Queuing in vehicle routing problems happens when a given node requires to be visited by several vehicles, whereas only a limited number of vehicles can perform the service simultaneously. Hence, some vehicles must wait until the node is available. We present in this paper a mathheuristic approach to solve the problem. This approach incorporates two phases. The first phase executes a rolling horizon heuristic multiple times to generate an initial set of solutions. Those generated solutions are used to initialize a pool of routes. In the second phase, a column-generation based procedure is used to generate new routes. The contribution of our paper can be summarized as follows. (1) We implemented an efficient set partitioning model that allocates pre-determined slots of time to service operations of vehicles. (2) We proposed fast pricing heuristics to generate new routes with negative reduced costs. (3) The newly generated routes are based on existing ones, keeping the same physical description but the starting times of service operations are modified to better fit the queuing aspects. Performance evaluation has been conducted using instances derived from data provided by forest companies. Experiments proved the effectiveness of the proposed approach, by recording low route duration and achieving almost zero queuing times compared to the initial pool of solutions.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"1307 - 1330"},"PeriodicalIF":4.5000,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-025-06647-z","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Queuing in vehicle routing problems happens when a given node requires to be visited by several vehicles, whereas only a limited number of vehicles can perform the service simultaneously. Hence, some vehicles must wait until the node is available. We present in this paper a mathheuristic approach to solve the problem. This approach incorporates two phases. The first phase executes a rolling horizon heuristic multiple times to generate an initial set of solutions. Those generated solutions are used to initialize a pool of routes. In the second phase, a column-generation based procedure is used to generate new routes. The contribution of our paper can be summarized as follows. (1) We implemented an efficient set partitioning model that allocates pre-determined slots of time to service operations of vehicles. (2) We proposed fast pricing heuristics to generate new routes with negative reduced costs. (3) The newly generated routes are based on existing ones, keeping the same physical description but the starting times of service operations are modified to better fit the queuing aspects. Performance evaluation has been conducted using instances derived from data provided by forest companies. Experiments proved the effectiveness of the proposed approach, by recording low route duration and achieving almost zero queuing times compared to the initial pool of solutions.
期刊介绍:
The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications.
In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.