定位路线问题的两阶段禁忌搜索算法研究

定位路线问题是定位配给和车辆路线问题的集成。分析了定位路线问题的含义，建立了此问题的数学模型，并用Lingo10．0验证了模型的正确性。由于该模型属于NP—hard问题，设计了两阶段禁忌搜索算法：第一阶段用禁忌搜索算法求解定位配给问题，确定设施定位及客户分配；第二阶段用禁忌搜索算法求解车辆路线问题，经过两个阶段的多次迭代求得定位路线问题的优化解，通过实例计算验证该算法的可行性和有效性。

Solution to a two-phase tabu algorithm for location routing problem

Location routing problem is the integrated decision of location allocation problem and vehicle routing problem. This paper describes the location routing problem, sets up the mathematical model of this problem, and validates the model by Lingo 10.0. Beeause this model is a NP-hard problem, to solve this problem, a two-phase tabu search algorithms was designed. At the first phase, the problems of location allocation to fix on the facility and custom allocation were solved by tabu search algorithms; at the second phase, the vehicle routing problem was solved by tabu search algorithms; by a large number of iterative from location to routing phases, the optimizing solution to the location routing can be obtained. Comparing with the related literature, the computing result shows that the designed algorithm is practicable and effective to solve this problem.