Research on the non-strict uncapacitated multiple allocation p-hub median problem based on tuba search
The problem of locating hub facilities arises in the design of transportation and telecommunications networks. In this paper we consider the non-strict uncapacitated multiple allocation p-hub median problem which belongs to a class of discrete location-allocation problems. A mixed integer linear programming model of the non-strict uncapacitated multiple allocation p-hub median problem is proposed and a new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the non-strict uncapacitated multiple allocation p-hub median problem. Our algorithm is benchmarked on a Chinese data. Computational results demonstrate that the algorithm can find the best solution of all the problems within 0.14 seconds, so the heuristic algorithm has strong ability and quick efficiency in finding Optimal Solutions.
Hub Non-hub Shortest path algorithm Tabu search Heuristic algorithm
BAI Ming-guo
School of Management, Anhui University of Technology, Ma’anshan 243002, China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
2156-2160
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）