Research of the node-based multi-objective Vehicle Scheduling Optimization

Feng-xing Zou, Jia-Hua Wei, Yang Kai
{"title":"Research of the node-based multi-objective Vehicle Scheduling Optimization","authors":"Feng-xing Zou, Jia-Hua Wei, Yang Kai","doi":"10.1109/ICSESS.2011.5982372","DOIUrl":null,"url":null,"abstract":"This paper presents an approach to solve the Vehicle Scheduling Problem(VSP). Taking into the actual connectivity of paths connected to the nodes, we establish a multi-objective mathematical model based on the path length and customer waiting time. A algorithm combining the A* algorithm for path searching with the Particle Swarm Optimization(PSO) for global exploration together, is applied to the multi-objective vehicle scheduling model. Some practical problems has been solved with good results by this approach.","PeriodicalId":108533,"journal":{"name":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 2nd International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2011.5982372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents an approach to solve the Vehicle Scheduling Problem(VSP). Taking into the actual connectivity of paths connected to the nodes, we establish a multi-objective mathematical model based on the path length and customer waiting time. A algorithm combining the A* algorithm for path searching with the Particle Swarm Optimization(PSO) for global exploration together, is applied to the multi-objective vehicle scheduling model. Some practical problems has been solved with good results by this approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于节点的多目标车辆调度优化研究
本文提出了一种求解车辆调度问题的方法。考虑到连接节点的路径的实际连通性,建立了基于路径长度和客户等待时间的多目标数学模型。将A*路径搜索算法与粒子群优化算法(PSO)全局搜索相结合,应用于多目标车辆调度模型。用这种方法解决了一些实际问题,取得了良好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The design of frequent sequence tree in incremental mining of sequential patterns Notice of RetractionA study of incentive mechanism to weaken bullwhip effect of supply chains Design patterns in object oriented analysis and design An operational model of security policies in Service-Oriented Applications An adaptive threshold segmentation method based on BP neural network for paper defect detection
×
引用
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