A partial tours based path-scanning heuristic for the capacitated arc routing problem

Badis Bensedira, Abdesslam Layeb, Zakaria Zendaoui
{"title":"A partial tours based path-scanning heuristic for the capacitated arc routing problem","authors":"Badis Bensedira, Abdesslam Layeb, Zakaria Zendaoui","doi":"10.1109/PAIS56586.2022.9946880","DOIUrl":null,"url":null,"abstract":"The Capacitated Arc Routing Problem (CARP) is known to be NP-Hard combinatorial optimization problem, and hence is not expected to be resolved in polynomial time for the general case. Consequently numerous heuristics and metaheuristics approaches have been developed to solve it. In this paper an “partial tours” based heuristic is proposed for the CARP. This approach is based on the path-scanning heuristic, one of the mostly used greedy heuristics for this problem. The innovation consists basically of creating a partial tours set to determine the promising segments in all tours. The quality of this new approach was tested on nine standard datasets and the results were compared against two path-scanning heuristics. The empirical study indicate that the “partial tours” approach gives a good results.","PeriodicalId":266229,"journal":{"name":"2022 4th International Conference on Pattern Analysis and Intelligent Systems (PAIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Pattern Analysis and Intelligent Systems (PAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PAIS56586.2022.9946880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Capacitated Arc Routing Problem (CARP) is known to be NP-Hard combinatorial optimization problem, and hence is not expected to be resolved in polynomial time for the general case. Consequently numerous heuristics and metaheuristics approaches have been developed to solve it. In this paper an “partial tours” based heuristic is proposed for the CARP. This approach is based on the path-scanning heuristic, one of the mostly used greedy heuristics for this problem. The innovation consists basically of creating a partial tours set to determine the promising segments in all tours. The quality of this new approach was tested on nine standard datasets and the results were compared against two path-scanning heuristics. The empirical study indicate that the “partial tours” approach gives a good results.
基于部分行程的路径扫描启发式方法求解电容电弧布线问题
电容电弧布线问题(CARP)是一个NP-Hard组合优化问题,一般情况下不能在多项式时间内得到解决。因此,许多启发式和元启发式方法被开发来解决它。本文提出了一种基于“部分行程”的启发式算法。该方法基于路径扫描启发式,这是解决该问题最常用的贪婪启发式方法之一。这项创新基本上包括创建一个部分旅游集,以确定所有旅游中有希望的部分。在9个标准数据集上测试了这种新方法的质量,并将结果与两种路径扫描启发式方法进行了比较。实证研究表明,“部分巡回”方法具有较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信