基于运输网络的配送路线优化模型  

Optimization Model for Delivery Route Based on Transport Networks

作　　者：张艳伟[1] 周万[1] 向家伟[2] 

机构地区：[1]武汉理工大学物流工程学院,湖北武汉430063 [2]武汉理工大学计算机科学与技术学院,湖北武汉430063

出　　处：《武汉理工大学学报（信息与管理工程版）》2014年第4期447-451,共5页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金青年基金资助项目(60904067)

摘　　要：针对传统的配送优化模型通常不考虑运输网络约束,而是直接利用勾股定理计算配送中心及各客户之间的运输距离,而不能很好地用于解决实际生产中的配送问题这一现象,在实际运输网络的基础上,利用弗洛伊德算法计算配送中心及各客户之间的最短路程,并利用该最短路程构造配送模型的运输距离矩阵,建立了配送路线问题的整数线性规划模型。利用LINGO软件对随机生成的算例进行求解,实验结果验证了该整数线性规划模型的正确性。考虑到LINGO求解速度较慢的弱点,开发了基于C语言的模拟退火算法对该物流配送问题进行求解,实验结果显示,模拟退火算法在求解速度和求解质量方面均表现良好。Traditional mathematical models usually do not take the constraints of the transport networks into account.Distances between distribution center and clients are assumed to be straight distances,which can hardly be used in the practical delivery route problems.Based on the practical transport networks,the minimum distances between distribution center and clients were calculated with the Floyd algorithm.An integer linear programming model was formulated.The model was solved with LINGO,and the result testified the model to be correct.As the solving time of LINGO was long,a simulated annealing algorithm based on C language was proposed to solve the delivery route problem.The results show that the performance of the simulated annealing algorithm is efficient at the solving time and solution quality aspects.

关 键 词：物流配送 运输网络 弗洛伊德算法 整数线性规划 LINGO 模拟退火 

分 类 号：F506[经济管理—产业经济]