AN ALGORITHM ON MULTI-DEPOTS AND MULTI-TYPE VEHICLES ROUTING BASED ON GLOBAL SEARCHING CLUSTERING

摘要：

For the multiple vehicle fields multiple vehicle type vehicle routing problem, the paper gives a mathematics model and gives a two stage solving schema.The first stage is using K-means clustering algorithms to change double multi problem to single one to reduce dimension of multiple vehicle fields multiple vehicle model routing problem and reduce the complexity of problem solving.the second stage is using genetic algorithm get shortest routing. Furthermore, the paper give five type interleaved genetic operator and two-step aberrance method to get the initiation population variaty; the schema is proved to be efficient by the experiment.

关键词： Vehicle Routing Multi-Depots and Multi-Type Vehicles Genetic Algorithm K-Means Clustering

作者: Liying Zheng Jingbo Wang Haipeng Jia

作者单位: College of Electronic & Information Engineering,Lanzhou Jiaotong University Lanzhou 730070,P.R.China Air Defense Forces Command College of PLA Zhengzhou 450050,P.R.China

会议类型: 国际会议

会议名称: 2009 International Symposium on Computer Science and Technology(2009 中国宁波国际计算机科学与技术学术大会)

会议地点: 宁波

会议语种:英文

页码: 536-539

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