有能力车辆路径问题的自适应选择进化算法

P. Gwóźdź, E. Szlachcic
{"title":"有能力车辆路径问题的自适应选择进化算法","authors":"P. Gwóźdź, E. Szlachcic","doi":"10.1109/LINDI.2009.5258573","DOIUrl":null,"url":null,"abstract":"We propose a meta-heuristic based on an evolutionary approach for a Capacitated Vehicle Routing Problem. The modifications concern a selection process and two new heuristics for crossover operators. The numerical results demonstrate the effectiveness of an adaptive selection evolutionary algorithm on the benchmark test problems. The main advantage is the possibility of arranging the proposed selection process and crossover operators in the space of feasible solutions. The presented results are very promising for solving bigger problems. number of customers is large. The largest problems which can be consistently solved by the most effective exact algorithms proposed so far contain about 50 customers, whereas larger instances may be solved only in particular cases. So instances with hundreds of customers, as those arising in practical applications, may only be tackled with heuristic or meta- heuristic methods (12). In meta-heuristics, the emphasis is on performing a deep exploration of the most promising regions of the solution space. The quality of solutions produced by these methods is much better than that obtained by classical heuristic methods. In the paper special attention is paid to meta-heuristics methods with evolutionary mechanisms based on the idea of natural search in biology (5,8,12). Our purpose is to propose an evolutionary search based meta-heuristic idea with modified tournament selection process for CVRP. We will describe an adaptive tournament selection and two new crossover operators for the discussed routing problem.","PeriodicalId":306564,"journal":{"name":"2009 2nd International Symposium on Logistics and Industrial Informatics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Adaptive Selection Evolutionary Algorithm for the Capacitated Vehicle Routing Problem\",\"authors\":\"P. Gwóźdź, E. Szlachcic\",\"doi\":\"10.1109/LINDI.2009.5258573\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a meta-heuristic based on an evolutionary approach for a Capacitated Vehicle Routing Problem. The modifications concern a selection process and two new heuristics for crossover operators. The numerical results demonstrate the effectiveness of an adaptive selection evolutionary algorithm on the benchmark test problems. The main advantage is the possibility of arranging the proposed selection process and crossover operators in the space of feasible solutions. The presented results are very promising for solving bigger problems. number of customers is large. The largest problems which can be consistently solved by the most effective exact algorithms proposed so far contain about 50 customers, whereas larger instances may be solved only in particular cases. So instances with hundreds of customers, as those arising in practical applications, may only be tackled with heuristic or meta- heuristic methods (12). In meta-heuristics, the emphasis is on performing a deep exploration of the most promising regions of the solution space. The quality of solutions produced by these methods is much better than that obtained by classical heuristic methods. In the paper special attention is paid to meta-heuristics methods with evolutionary mechanisms based on the idea of natural search in biology (5,8,12). Our purpose is to propose an evolutionary search based meta-heuristic idea with modified tournament selection process for CVRP. We will describe an adaptive tournament selection and two new crossover operators for the discussed routing problem.\",\"PeriodicalId\":306564,\"journal\":{\"name\":\"2009 2nd International Symposium on Logistics and Industrial Informatics\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 2nd International Symposium on Logistics and Industrial Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LINDI.2009.5258573\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 2nd International Symposium on Logistics and Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LINDI.2009.5258573","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

针对有能力车辆路径问题,提出了一种基于进化方法的元启发式算法。改进涉及一个选择过程和两个新的交叉算子启发式算法。数值结果证明了自适应选择进化算法在基准测试问题上的有效性。其主要优点是可以将所提出的选择过程和交叉算子安排在可行解的空间中。提出的结果对于解决更大的问题是非常有希望的。客户数量大。迄今为止提出的最有效的精确算法能够持续解决的最大问题包含大约50个客户,而更大的实例只能在特定情况下解决。因此,在实际应用中出现的具有数百个客户的实例,可能只能使用启发式或元启发式方法来处理(12)。在元启发式中,重点是对解决方案空间中最有前途的区域进行深入探索。这些方法得到的解的质量比经典的启发式方法得到的解的质量要好得多。本文特别关注基于生物学自然搜索思想的进化机制的元启发式方法(5,8,12)。我们的目的是提出一种基于进化搜索的元启发式思想和改进的锦标赛选择过程的CVRP。对于所讨论的路由问题,我们将描述一个自适应锦标赛选择和两个新的交叉算子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Adaptive Selection Evolutionary Algorithm for the Capacitated Vehicle Routing Problem
We propose a meta-heuristic based on an evolutionary approach for a Capacitated Vehicle Routing Problem. The modifications concern a selection process and two new heuristics for crossover operators. The numerical results demonstrate the effectiveness of an adaptive selection evolutionary algorithm on the benchmark test problems. The main advantage is the possibility of arranging the proposed selection process and crossover operators in the space of feasible solutions. The presented results are very promising for solving bigger problems. number of customers is large. The largest problems which can be consistently solved by the most effective exact algorithms proposed so far contain about 50 customers, whereas larger instances may be solved only in particular cases. So instances with hundreds of customers, as those arising in practical applications, may only be tackled with heuristic or meta- heuristic methods (12). In meta-heuristics, the emphasis is on performing a deep exploration of the most promising regions of the solution space. The quality of solutions produced by these methods is much better than that obtained by classical heuristic methods. In the paper special attention is paid to meta-heuristics methods with evolutionary mechanisms based on the idea of natural search in biology (5,8,12). Our purpose is to propose an evolutionary search based meta-heuristic idea with modified tournament selection process for CVRP. We will describe an adaptive tournament selection and two new crossover operators for the discussed routing problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Adaptive Selection Evolutionary Algorithm for the Capacitated Vehicle Routing Problem Modeling of Survivable Network Design Problems with Simultaneous Unicast and Anycast Flows Hybrid DE-SVM Approach for Feature Selection: Application to Gene Expression Datasets An Integrated Train Protection and Information System for Regional Lines Allocation of Computing Resources in Two-Tier Hierarchical Wide Area Networks: An Heuristic Algorithm
×
引用
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