首页 | 本学科首页   官方微博 | 高级检索  
     检索      

定位路线问题的两阶段禁忌搜索算法研究
引用本文:徐丽蕊,李静.定位路线问题的两阶段禁忌搜索算法研究[J].陕西理工学院学报(自然科学版),2011,27(4):81-89.
作者姓名:徐丽蕊  李静
作者单位:陕西工业职业技术学院,物流管理学院,陕西,咸阳,712000
摘    要:定位路线问题是定位配给和车辆路线问题的集成。分析了定位路线问题的含义,建立了此问题的数学模型,并用Lingo 10.0验证了模型的正确性。由于该模型属于NP-hard问题,设计了两阶段禁忌搜索算法:第一阶段用禁忌搜索算法求解定位配给问题,确定设施定位及客户分配;第二阶段用禁忌搜索算法求解车辆路线问题,经过两个阶段的多次迭代求得定位路线问题的优化解,通过实例计算验证该算法的可行性和有效性。

关 键 词:定位路线  车辆路线  禁忌搜索  启发式算法

Solution to a two-phase tabu algorithm for location routing problem
XU Li-rui,LI Jing.Solution to a two-phase tabu algorithm for location routing problem[J].Journal of Shananxi University of Technology:Natural Science Edition,2011,27(4):81-89.
Authors:XU Li-rui  LI Jing
Institution:XU Li-rui,LI Jing(School of Logistics management,Shaanxi Polytechnic Institute,Xianyang 712000,China)
Abstract: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.Because 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 phas...
Keywords:location routing  vehicle routing problem  tabu search algorithms  heuristic algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号