Study on Multi-depot Vehicle Scheduling Problem Based on Milk-Run Model

Ying Dai, Wen-hui Xia, Xian-long Ge
{"title":"Study on Multi-depot Vehicle Scheduling Problem Based on Milk-Run Model","authors":"Ying Dai, Wen-hui Xia, Xian-long Ge","doi":"10.1109/ICOIP.2010.12","DOIUrl":null,"url":null,"abstract":"After analyzing the multi-depot vehicle scheduling problem, a mathematical model which takes the shortest single distribution as the target function was built. First of all, the paper make it to be the different single distribution center vehicle scheduling problem by dividing all the suppliers, then use genetic algorithm to solve the single distribution center VSP problem. Finally, verify the effectiveness of the model and the algorithm with examples based on theMaple soft.","PeriodicalId":333542,"journal":{"name":"2010 International Conference on Optoelectronics and Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Optoelectronics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIP.2010.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

After analyzing the multi-depot vehicle scheduling problem, a mathematical model which takes the shortest single distribution as the target function was built. First of all, the paper make it to be the different single distribution center vehicle scheduling problem by dividing all the suppliers, then use genetic algorithm to solve the single distribution center VSP problem. Finally, verify the effectiveness of the model and the algorithm with examples based on theMaple soft.
基于牛奶运行模型的多车场车辆调度问题研究
在分析多车场车辆调度问题的基础上,建立了以单次配送最短为目标函数的数学模型。首先,本文将不同供应商划分为不同的单个配送中心车辆调度问题,然后利用遗传算法求解单个配送中心的VSP问题。最后,通过基于maple软件的实例验证了模型和算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信