基于动态约束的单配送中心相关车辆路径问题研究

Yuqiang Chen, Xuanzi Hu, G. Ye
{"title":"基于动态约束的单配送中心相关车辆路径问题研究","authors":"Yuqiang Chen, Xuanzi Hu, G. Ye","doi":"10.1109/CIS.2013.23","DOIUrl":null,"url":null,"abstract":"Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows and dynamic constraint. The simulated result shows that the self-adapting chaos genetic algorithm is flexible and feasible to solve this kind of model.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Research on Related Vehicle Routing Problem for Single Distribution Centre Based on Dynamic Constraint\",\"authors\":\"Yuqiang Chen, Xuanzi Hu, G. Ye\",\"doi\":\"10.1109/CIS.2013.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows and dynamic constraint. The simulated result shows that the self-adapting chaos genetic algorithm is flexible and feasible to solve this kind of model.\",\"PeriodicalId\":294223,\"journal\":{\"name\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2013.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Ninth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2013.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

相关车辆路线问题是车辆路线问题的另一种形式。RVRP也属于NP-Hard,研究基于道路容量动态约束的单配送中心RVRP。道路通行系数表示为路况系数,然后将其加入目标函数中。建立具有软时间窗和动态约束的单配送中心单车型RVRP模型。仿真结果表明,自适应混沌遗传算法求解这类模型是灵活可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Related Vehicle Routing Problem for Single Distribution Centre Based on Dynamic Constraint
Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows and dynamic constraint. The simulated result shows that the self-adapting chaos genetic algorithm is flexible and feasible to solve this kind of model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信