Vehicle Routing Problem with Multi-type Vehicles in the Cold Chain Logistics System

Chu-Xuan Huai, Guo-hua Sun, Ranwen Qu, Z. Gao, Zehao Zhang
{"title":"Vehicle Routing Problem with Multi-type Vehicles in the Cold Chain Logistics System","authors":"Chu-Xuan Huai, Guo-hua Sun, Ranwen Qu, Z. Gao, Zehao Zhang","doi":"10.1109/ICSSSM.2019.8887612","DOIUrl":null,"url":null,"abstract":"In this paper, a multi-objective model aiming to minimize both distribution cost and cargo damage cost is constructed to study the vehicle routing problem (VRP) with multi-type vehicles in the cold chain logistics system. Since VRP is an NP-hard problem, the optimal solutions cannot be obtained in a short time with exact algorithms as the scale increases. The genetic algorithms based on two decoding methods giving the priority to capacity and cargo damage are designed to solve the problem. The algorithm is applied to solve the distribution problem of H logistics company and the results obtained with two decoding methods are compared.","PeriodicalId":442421,"journal":{"name":"2019 16th International Conference on Service Systems and Service Management (ICSSSM)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 16th International Conference on Service Systems and Service Management (ICSSSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2019.8887612","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, a multi-objective model aiming to minimize both distribution cost and cargo damage cost is constructed to study the vehicle routing problem (VRP) with multi-type vehicles in the cold chain logistics system. Since VRP is an NP-hard problem, the optimal solutions cannot be obtained in a short time with exact algorithms as the scale increases. The genetic algorithms based on two decoding methods giving the priority to capacity and cargo damage are designed to solve the problem. The algorithm is applied to solve the distribution problem of H logistics company and the results obtained with two decoding methods are compared.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
冷链物流系统中多类型车辆的车辆路径问题
本文建立了以配送成本和货损成本同时最小化为目标的多目标模型,研究了冷链物流系统中多类型车辆的车辆路径问题。由于VRP是np困难问题,随着规模的增大,用精确的算法无法在短时间内得到最优解。针对这一问题,设计了基于两种解码方法的遗传算法,分别优先考虑货物容量和货物损坏。将该算法应用于H物流公司的配送问题,比较了两种解码方法的解码结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the Influence Mechanism of Gamification Elements on Users' Willingness to Continue Using in Interest-based Virtual Communities ‐‐ Based on ECM-ISC Model The Application of Offshore Operation Risk Classification Management Method An empirical study of corporate environmental liability performance, industry characteristics and financial performance The Application of Safety&security System in the Long Distance Landing Subsea Pipeline A Clustering-based Approach for Reorganizing Bus Route on Bus Rapid Transit System
×
引用
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