基于遗传算法的西安邮政配送路线优化研究  

Study on optimization of Xi'an post logistics distribution routing by genetic algorithm

作　　者：解丹蕊[1] 薛惠锋[1] 韩建新[1] 

机构地区：[1]西北工业大学自动化学院,陕西西安710072

出　　处：《河北科技大学学报》2008年第3期214-218,241,共6页Journal of Hebei University of Science and Technology

基　　金：陕西省自然科学基金资助项目(2005F45);西北工业大学创新基金资助项目

摘　　要：构建了单源点、单车型、有时间窗约束的非满载车辆调度问题的模型,设计了基于自然数编码的遗传算法用于求解该模型。采用最大保留交叉算子,最大程度地保留了父代的优良特性并增强了算法的寻优能力。通过最后对西安邮政配送系统的行车路线问题进行计算机仿真,得出3个不同配送中心所负责的需求点范围内的行车路线安排,证明了本算法的优越性。A model for non-full loaded vehicle scheduling problem with single park and single vehicle type, which has time windows restriction, was constructed. For solving the model, a genetic algorithm based on nature number was designed. Using the maximum preserved crossover, it furthest retained the excellent characteristics of parent, and built up the quality of the al- gorithm optimization capabilities. Finally, through computer simulation of Xi＇an post logistics routing problem, the demand points of the route arrangement for responsible area of three different distribution centers was given, which proved the superiority of the algorithm.

关 键 词：遗传算法 带时间窗的车辆路线问题(VRPTW) 优化 西安邮政 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] F603[自动化与计算机技术—计算机科学与技术]