摘要
定位路线问题是定位配给和车辆路线问题的集成决策，本文在对该问题进行描述的基础上，建立了多站点定位路线问题的数学模型，并用Lingo10．0验证了模型的正确性。针对此模型的NP—hard属性，设计了两阶段禁忌搜索启发式算法；即第一阶段用禁忌搜索算法求解定位配给问题，确定设施定位及客户分配；第二阶段用禁忌搜索算法求解车辆路线问题，经过两个阶段的多次迭代求得定位路线问题的优化解，通过物流决策过程的实例计算，结果表明该算法具有可行性和有效性。
Location routing problem is the integrated decision of location allocation problem and vehicle routing problem. This paper describes the location routing problem, builds up the mathematical model and testing the model by using Lingo10.0. Aimed at the NP - hard attribute of the model, the paper designs two-phase tabu search algorithms to solve the problem. In the first phase, solves the location allocation to fix on the facility and custom allocation, in the second phase, solves the vehicle routing problem, and aquire the optimize solution through two phases iteration. The logistic example computing result shows the feasibility and validity of the algorithm.
出处
《陕西工业职业技术学院学报》
2008年第3期34-40,共7页
Journal of Shaanxi Polytechnic Institute
关键词
定位路线
车辆路线
禁忌搜索
启发式算法
location routing
vehicle routing problem
tabu search algorithms
heuristic algorithm
