第四方物流中多任务路由优化问题的模型与算法

Min Huang, Yan Cui, Xin Xu, W. Ip, Xingwei Wang
{"title":"第四方物流中多任务路由优化问题的模型与算法","authors":"Min Huang, Yan Cui, Xin Xu, W. Ip, Xingwei Wang","doi":"10.1109/CCDC.2009.5193607","DOIUrl":null,"url":null,"abstract":"With the developing supply chain, fourth Party Logistics (4PL) has been attracting more and more attention from researches. Routing optimization is one of the important issues in 4PL. Based on the analysis of practical problems, considered the cost and time two properties of each node and edge, a mathematical model of the point to point multi-task without edge reuse routing optimization of 4PL is established. Considering the characteristics of the problem, the Ant Colony Optimization (ACO) algorithm is designed for the problem. The algorithm is tested by numerical analysis with different scale of problems. The results suggested that the algorithm is effective and efficient.","PeriodicalId":127110,"journal":{"name":"2009 Chinese Control and Decision Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Model and algorithm for the multi-task routing optimization problem in 4PL\",\"authors\":\"Min Huang, Yan Cui, Xin Xu, W. Ip, Xingwei Wang\",\"doi\":\"10.1109/CCDC.2009.5193607\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the developing supply chain, fourth Party Logistics (4PL) has been attracting more and more attention from researches. Routing optimization is one of the important issues in 4PL. Based on the analysis of practical problems, considered the cost and time two properties of each node and edge, a mathematical model of the point to point multi-task without edge reuse routing optimization of 4PL is established. Considering the characteristics of the problem, the Ant Colony Optimization (ACO) algorithm is designed for the problem. The algorithm is tested by numerical analysis with different scale of problems. The results suggested that the algorithm is effective and efficient.\",\"PeriodicalId\":127110,\"journal\":{\"name\":\"2009 Chinese Control and Decision Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Chinese Control and Decision Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2009.5193607\",\"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 Chinese Control and Decision Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2009.5193607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着供应链的发展,第四方物流(4PL)越来越受到人们的关注和研究。路由优化是第四方物流中的重要问题之一。在分析实际问题的基础上,考虑每个节点和边缘的成本和时间两个特性,建立了4PL点对点多任务无边缘复用路由优化的数学模型。针对该问题的特点,设计了蚁群优化算法。通过对不同规模问题的数值分析,验证了该算法的有效性。结果表明,该算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Model and algorithm for the multi-task routing optimization problem in 4PL
With the developing supply chain, fourth Party Logistics (4PL) has been attracting more and more attention from researches. Routing optimization is one of the important issues in 4PL. Based on the analysis of practical problems, considered the cost and time two properties of each node and edge, a mathematical model of the point to point multi-task without edge reuse routing optimization of 4PL is established. Considering the characteristics of the problem, the Ant Colony Optimization (ACO) algorithm is designed for the problem. The algorithm is tested by numerical analysis with different scale of problems. The results suggested that the algorithm is effective and efficient.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信