摘要
针对无容量限制的多重分派枢纽中位问题(UMApHMP),提出了一种基于禁忌搜索和最短路算法的新的启发式算法。利用CAB基准数据对该算法进行了验证,计算结果表明所提算法具有较强寻优能力和较快的求解效率。
A new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the uncapacitated multiple allocation p-hub median problem（UMApHMP）. The CAB benchmark data are used to test the algorithm. The result calculacted shows that the proposed algorithm has strong ability and quick effi- ciency in finding optimization solution.
出处
《运筹与管理》
CSCD
2007年第4期64-68,共5页
Operations Research and Management Science
基金
国家教育部博士学科点基金资助项目(20020287001)
关键词
交通运输规划与管理
启发式算法
禁忌搜索算法
最短路算法
枢纽航线网络
traffic and transportation planning and management
heuristic algorithm
tabu search algorithm
shortest path algorithm
hub and spoke network
