禁忌搜索算法在单分配多枢纽轴辐式物流网络中的应用

中国管理科学 ›› 2012, Vol. ›› Issue (3): 145-151.

禁忌搜索算法在单分配多枢纽轴辐式物流网络中的应用

傅少川, 胡梦飞, 唐方成

北京交通大学经济管理学院, 北京 100044

收稿日期:2011-07-15 修回日期:2012-04-11 出版日期:2012-06-29 发布日期:2012-07-05
基金资助:
国家自然科学基金资助项目(71128001)

The Optimization of Hub and Spoke Logistics Network Design based on Tabu Search Algorithm

FU Shao-chuan, HU Meng-fei, TANG Fang-cheng

School of Economics & Management, Beijing Jiaotong University, Beijing 100044, China

Received:2011-07-15 Revised:2012-04-11 Online:2012-06-29 Published:2012-07-05

摘要/Abstract

摘要： 随着经济的发展,轴辐式网络因有提高运输效率,优化资源配置,产生范围经济等作用越来越多的受到各方面学者的关注。本文对轴辐式网络进行优化分析,改进轴辐式网络的多重分配多枢纽中位问题模型,得到无容量限制的单分配多枢纽中位问题模型(USApHLP)的混合整数线性规划模型,并采用改进的禁忌搜索智能算法来求解,通过算例验证了禁忌搜索算法可以有效的求解单分配多枢纽中位问题。

关键词: 轴辐式网络, 单分配多枢纽, 禁忌搜索, 枢纽

Abstract: With the development of economy, hub and spoke network has gained many attentions from researchers and practitioners since it can improve transport efficiency, optimize resource allocation and result in economies of scale.In this paper, hub and spoke network is optimized and analyzed, and based on the classical model of multiple allocation problem for p-hub location problem in the hub and spoke network, an improved model which is a mixed integer linear programming model for uncapacitated single allocation of p-hub median location problem is put forward. Then, tabu search intelligent algorithm is used to solve the problem. At last, a numerical example shows that the tabu search algorithm can efficiently solve the single distribution of multi-hub median problem.

Key words: hub and spoke network, single allocation of p-hub median location problem, tabu search, hingle

中图分类号:

C931

傅少川, 胡梦飞, 唐方成. 禁忌搜索算法在单分配多枢纽轴辐式物流网络中的应用 [J]. 中国管理科学, 2012, (3): 145-151.

FU Shao-chuan, HU Meng-fei, TANG Fang-cheng. The Optimization of Hub and Spoke Logistics Network Design based on Tabu Search Algorithm[J]. Chinese Journal of Management Science, 2012, (3): 145-151.

参考文献

[1] 李阳.轴辐式网络理论及应用研究.上海: 复旦大学, 2006.
[2] 翁克瑞.轴辐式物流网络设计的选址与路线优化研究.武汉: 华中科技大学, 2007.
[3] 柏明国. 基于禁忌搜索算法的枢纽航线网络优化设计研究 [J].经济数学, 2008, 25(4): 412-417.
[4] 金凤君, 王成金.轴-辐侍服理念下的中国航空网络模式构筑 [J].地理研究, 2005, 24(5): 774-783.
[5] 姚志刚, 周伟, 王元庆.轴辐式运输网络的范围经济问题[J].交通运输系统工程与信息, 2009, 9(1): 24-27.
[6] Silva M R,Cunha C B. New simple and efficient heuristics for the uncapacitated single allocation hub location problem [J]. Computers & Operations Research, 2009, 36: 3152-3165.
[7] Meyera T, Ernstb A T,Krishnamoorthyb M.A 2-phase algorithm for solving the single allocation p-hub center problem [J]. Computers & Operations Research, 2009, 36: 3143-3151.
[8] Yaman H. The hierarchical hub median problem with single assignment[J]. Transportation Research,2009 (43): 643-658.
[9] Ilic A, Urosevic D, Brimberg J, Mladenovic N.A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem [J].European Journal of Operational Research, 2010, (206): 289-300.
[10] Chen J F.A hybrid heuristic for the uncapacited single allocation hub location problem [J].The International Journal of Management Science, 2007, (35): 211-220.
[11] Iwasa M, Saito H, Matsui T. Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems[J]. Discrete Applied Mathematics, 2009, (157): 2078-2088.
[12] Correia I, Nickel S, Saldanha-da-Gama F. The capacitated single-allocation hub location problem revisited: a note on a classical formulation [J]. European Journal of Operational Research, 2010, (207): 92-96.