物流网络选址与路径优化问题的模型与启发式解法

Model and heuristic solution for location routing problems of logistics network

以商品从供应商,经过物流中心(或配送中心),配送到最终用户的整个过程中所产生的费用最小化为目标函数,提出了求解供应商的最佳位置与数量、配送中心的最佳位置与数量以及从配送中心到最终用户的最佳配送路径优化问题,建立了问题的数学模型,利用传统启发式算法与模拟退火法开发了问题求解的混合启发式解法,并利用人工生成数据和实例进行了计算验证。对于小规模问题,通过与数理规划软件所求得的最优解进行比较可以看出,所提出的数学模型可以准确地描述此类问题,所提出的混合启发式解法能够在短时间内求解问题,并得到非常接近于最优解的近似解;对于大规模问题,虽然无法求得最优解进行比较,但从实例计算结果来看,所求解也是较好的,因此可以认为所提出的解法是有效和良好的,具有较高的实用价值。

The minimum cost related to the process, in which goods are delivered from suppliers, through logistics centers （or distribution centers） to ultimate customers, was taken as the object function, MSDLRP （multi-supplier multi-depot location routing problem） was presented, including the optimal number and locations of suppliers, the optimal number and locations of distribution centers, the optimal routes from distribution centers to ultimate customers, a mathematic model of the problem was put forward, a mixed heuristic solution was developed by using traditional heuristic solution and simulated annealing solution, they were tested by manually generated data and studied cases. For small-scaled problem, compared with the optimal result got by using planning software, MSDLRP can be described by the mathematic model accurately, the problem can be solved by the heuristic solution during short period, and the optimal result is obtained. For big-scaled problem, although the optimal result can not be got, the result also is better. 2 tabs, 3 figs, 9 refs.