摘要
物流配送系统的车辆旅途问题是一个NP-hard问题。文中针对某烟草物流配送系统,将其配送路径抽象为TSP问题,完成现实空间到问题空间的映射,使实际问题转化为平衡运输问题的数学模型,采用单纯形法和贪婪法配合使用,从而求出最优解或满意解。实践证明:这种组合方式是相当成功的。
The vehicle problems in logistics delivering system are NP - hard problems. In this paper, it abstracts TSP from the delivering route in a logistics delivering system,has finished reflecting from real space to problem space,converts fact problem into mathematical model of balancing transport problem. By means of combination of simplex method and greedy method, have obtained the optimization solution or satisfactory solution. The practice proves that it obtains the certain success.
出处
《计算机技术与发展》
2006年第8期46-48,共3页
Computer Technology and Development
关键词
物流配送
路径优化
数学模型
单纯形法
贪婪法
logistics delivering
optimizing route
mathematical model
simplex method
greedy method
