考虑排队的车辆路径问题的数学启发式方法

IF 4.5 3区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Ala-Eddine Yahiaoui, Mikael Rönnqvist, Jean-François Audy
{"title":"考虑排队的车辆路径问题的数学启发式方法","authors":"Ala-Eddine Yahiaoui,&nbsp;Mikael Rönnqvist,&nbsp;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":"{\"title\":\"A mathheuristic approach for the vehicle routing problem with queuing considerations\",\"authors\":\"Ala-Eddine Yahiaoui,&nbsp;Mikael Rönnqvist,&nbsp;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}","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

摘要

车辆路径问题中的排队问题发生在给定节点需要若干车辆访问,而只有有限数量的车辆可以同时执行服务的情况下。因此,一些车辆必须等到节点可用。本文提出了一种数学启发式方法来解决这一问题。这种方法包含两个阶段。第一阶段多次执行滚动地平线启发式来生成一组初始解。这些生成的解决方案用于初始化路由池。在第二阶段,使用基于列生成的过程来生成新的路由。本文的贡献可以概括如下。(1)实现了一种高效的集合划分模型,将预先确定的时段分配给车辆的服务操作。(2)提出快速定价启发式算法,生成成本负降低的新路线。(3)新生成的路线以现有路线为基础,保持相同的物理描述,但修改了服务操作的开始时间,以更好地适应排队方面。利用从森林公司提供的数据得出的实例进行了业绩评价。实验证明了该方法的有效性,与初始解决方案池相比,该方法记录了较低的路由持续时间,并且几乎实现了零排队时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A mathheuristic approach for the vehicle routing problem with queuing considerations

A mathheuristic approach for the vehicle routing problem with queuing considerations

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annals of Operations Research
Annals of Operations Research 管理科学-运筹学与管理科学
CiteScore
7.90
自引率
16.70%
发文量
596
审稿时长
8.4 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信