用基于特征的引导和多样性管理增强元搜索法解决拥挤车辆路由问题

Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux
{"title":"用基于特征的引导和多样性管理增强元搜索法解决拥挤车辆路由问题","authors":"Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux","doi":"arxiv-2407.20777","DOIUrl":null,"url":null,"abstract":"We propose a metaheuristic algorithm enhanced with feature-based guidance\nthat is designed to solve the Capacitated Vehicle Routing Problem (CVRP). To\nformulate the proposed guidance, we developed and explained a supervised\nMachine Learning (ML) model, that is used to formulate the guidance and control\nthe diversity of the solution during the optimization process. We propose a\nmetaheuristic algorithm combining neighborhood search and a novel mechanism of\nhybrid split and path relinking to implement the proposed guidance. The\nproposed guidance has proven to give a statistically significant improvement to\nthe proposed metaheuristic algorithm when solving CVRP. Moreover, the proposed\nguided metaheuristic is also capable of producing competitive solutions among\nstate-of-the-art metaheuristic algorithms.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"20 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Metaheuristic Enhanced with Feature-Based Guidance and Diversity Management for Solving the Capacitated Vehicle Routing Problem\",\"authors\":\"Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux\",\"doi\":\"arxiv-2407.20777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a metaheuristic algorithm enhanced with feature-based guidance\\nthat is designed to solve the Capacitated Vehicle Routing Problem (CVRP). To\\nformulate the proposed guidance, we developed and explained a supervised\\nMachine Learning (ML) model, that is used to formulate the guidance and control\\nthe diversity of the solution during the optimization process. We propose a\\nmetaheuristic algorithm combining neighborhood search and a novel mechanism of\\nhybrid split and path relinking to implement the proposed guidance. The\\nproposed guidance has proven to give a statistically significant improvement to\\nthe proposed metaheuristic algorithm when solving CVRP. Moreover, the proposed\\nguided metaheuristic is also capable of producing competitive solutions among\\nstate-of-the-art metaheuristic algorithms.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.20777\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.20777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了一种基于特征引导的元启发式算法,旨在解决有容量车辆路由问题(CVRP)。为了制定所建议的指导,我们开发并解释了一个有监督的机器学习(ML)模型,该模型用于在优化过程中制定指导和控制解决方案的多样性。我们提出了一种将邻域搜索与混合拆分和路径重链接的新机制相结合的超启发式算法来实现所提出的指导。事实证明,在求解 CVRP 时,所提出的指导对元启发式算法有显著的改进。此外,与其他最先进的元启发式算法相比,所提出的引导式元启发式也能产生有竞争力的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Metaheuristic Enhanced with Feature-Based Guidance and Diversity Management for Solving the Capacitated Vehicle Routing Problem
We propose a metaheuristic algorithm enhanced with feature-based guidance that is designed to solve the Capacitated Vehicle Routing Problem (CVRP). To formulate the proposed guidance, we developed and explained a supervised Machine Learning (ML) model, that is used to formulate the guidance and control the diversity of the solution during the optimization process. We propose a metaheuristic algorithm combining neighborhood search and a novel mechanism of hybrid split and path relinking to implement the proposed guidance. The proposed guidance has proven to give a statistically significant improvement to the proposed metaheuristic algorithm when solving CVRP. Moreover, the proposed guided metaheuristic is also capable of producing competitive solutions among state-of-the-art metaheuristic algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reconfiguration of labeled matchings in triangular grid graphs Decision problems on geometric tilings Ants on the highway A sequential solution to the density classification task using an intermediate alphabet Complexity of Deciding the Equality of Matching Numbers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1