基于节点的多目标车辆调度优化研究

2011 IEEE 2nd International Conference on Software Engineering and Service Science Pub Date : 2011-07-15 DOI:10.1109/ICSESS.2011.5982372

Feng-xing Zou, Jia-Hua Wei, Yang Kai

{"title":"基于节点的多目标车辆调度优化研究","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":"{\"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}","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

摘要

本文提出了一种求解车辆调度问题的方法。考虑到连接节点的路径的实际连通性，建立了基于路径长度和客户等待时间的多目标数学模型。将A*路径搜索算法与粒子群优化算法(PSO)全局搜索相结合，应用于多目标车辆调度模型。用这种方法解决了一些实际问题，取得了良好的效果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 IEEE 2nd International Conference on Software Engineering and Service Science

自引率

0.00%

发文量