基于禁忌搜索的战略投送枢纽选址研究  

Hub Location in Strategic Projection Based on Tabu Search

作　　者：毕海玲[1] 张旭涛[1] 傅钰[1] 

机构地区：[1]军事交通学院装备保障系,天津300161

出　　处：《军事交通学院学报》2017年第6期81-86,共6页Journal of Military Transportation University

摘　　要：为解决战略投送枢纽的选址与分配问题,将战略投送网络选址问题抽象为轴辐式多式联运问题,建立带时间约束的0-1整数规划模型。针对模型的复杂性,设计一种基于特定最短路算法和禁忌搜索的启发式算法,运用仿真算例验证算法的收敛性和有效性。研究表明,该算法能有效对模型求解,可为国防交通建设规划提供决策参考。To solve the problems of hub location and allocation in strategic projection,the paper firstly abstracts the problem of network location into radiant multimodal transport,and establishes 0-1 integer programming model with time restraint. Then,it designs a heuristic algorithm based on specific shortest path algorithm and Tabu search according to the complexity of the model,and verifies the convergence and validity of the algorithm through simulation example. The research shows that this algorithm can solve the model and provide decision-making reference for planning national defense transportation construction.

关 键 词：战略投送 枢纽选址 整数规划 禁忌搜索 最短路算法 

分 类 号：F560[经济管理—产业经济]