集成化物流选址-路径问题优化模型的算法研究

Single-stage Algorithm of Location-Routing Problem Optimization Model for Integrated Logistics

选址-路径问题(Location-Routing Problem,LRP)是物流系统中的一个组合优化问题.一般采用"两阶段法"将其分解为选址分派和车辆路径问题来求解.这种两阶段法未能考虑到问题的内在联系,因而往往不能得到满意的解.本研究把LRP问题的解看作是一个整体,采用遗传算法求解该问题;对遗传算法的编码进行重新设计,对交叉和变异操作做了改进,因而能够更容易得到问题的最优解.最后通过算例分析,验证了本算法的可行性.

Loeation-routing problem （LRP） in a logistics system is a problem of combinational optimization. A usual solution to LRP can be obtained by dividing the problem into location assignment and vehicle routing with a two-phase method but this method often does not lead to a satisfactory result for its ignoring the inherent relation between the two sides. This paper, using a genetic algorithm to solve the problem, regards its solution as a whole and thus easily obtains the optimal solution by designing the algorithm coding and improving the crossover and mutation. The feasibility of this algorithm has been verified through examples.