Vehicle Scheduling Problem for the Single-depot Based on Genetic Algorithms

摘要：

Vehicle scheduling problem is a common problem in trucking industry. Because of the existence of a large number of constraints, it is difficult to obtain the optimal solution. This issue has been an NP difficult problem. In this paper, we will both establish bi-objective vehicle scheduling model with the goal that shortest vehicle Run and least number of vehicles and solve this problem using of genetic algorithm. Practical application justify that the model and algorithm can quickly obtain the optimal solution of the problem.

关键词： Vehicle scheduling problem Genetic Algorithm Combinatorial Optimization

作者: Chun-qiu Xu Bing Li Hua Xuan Fang-fang Su

作者单位: School of Management Science &Engineering Zhengzhou University Zhengzhou, China

会议类型: 国际会议

会议名称: 2010 International Conference of Informationa Science and Management Engineering(2010年信息科学与管理工程国际学术会议 ISME 2010)

会议地点: 西安

会议语种:英文

页码: 254-256

在线出版日期: 2010-08-07（万方平台首次上网日期，不代表论文的发表时间）