全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

受限单分配枢纽选址问题的并行蚁群算法

, PP. 74-81

Keywords: 交通规则,轴-辐式网络,枢纽选址,并行蚁群算法,蚁群系统,局域搜索

Full-Text   Cite this paper   Add to My Lib

Abstract:

研究了受限单分配枢纽选址问题的特点,以网络运输总成本和固定设施费用之和为最小化目标函数,建立了具有较少变量的混合整数线性规划模型,应用并行蚁群算法对模型进行求解,并结合澳大利亚邮政数据进行选址仿真试验。计算结果表明对于最难求解的50个节点的双紧约束问题,算法运算时间为3.59s,远低于已有的其他算法;各算例的运算偏差不大于0.09%。可见,并行蚁群算法具有良好的求解效率和计算稳定性。

References

[1]  HORNER M W, O’KELLY M E. Embedding economies of scale concepts for hub network design[J]. Journal of Transport Geography, 2001, 9(4): 255-265.
[2]  ALUMUR S, KARA B Y. Network hub location problem: the state of the art[J]. European Journal of Operational Research, 2008, 190(1): 1-21.
[3]  ERNST A T, KRISHNAMOORTHY M. Solution algorithms for the capacitated single allocation hub location problem[J]. Annals of Operations Research, 1999, 86(0): 141-159.
[4]  RANDALL M. Solution approaches for the capacitated single allocation hub location problem using ant colony optimization[J]. Computational Optimization Applications, 2008, 39(2): 239-261.
[5]  COSTA M D G, CAPTIVO M E, CLIMACO J. Capacitated sin-gle allocation hub location problem―a bi-criteria approach[J]. Computers and Operations Research, 2008, 35(11): 3671-3695.
[6]  CHEN J F. A heuristics for the capacitated single allocation hub location problem[J]. Lecture Notes in Electrical Engineering, 2008(5): 185-196.
[7]  CONTRERAS I, DIAZ J A, FERNANDEZ E. Lagrangean relaxation for the capacitated hub location problem with single assignment[J]. OR Spectrum, 2009, 31(3): 483-505.
[8]  邓亚娟,陈小鸿,杨 超.需求不确定的枢纽辐射式航线网络设计[J].交通运输工程学报,2009,9(6):69-75. DENG Ya-juan, CHEN Xiao-hong, YANG Chao. Hub-and-spoke airline network design with uncertainty demand[J]. Journal of Traffic and Transportation Engineering, 2009, 9(6): 69-75.(in Chinese)
[9]  李 阳.轴辐式网络理论及应用研究[D].上海:复旦大学,2006. LI Yang. Research on hub and spoke network theory and its application[D]. Shanghai: Fudan University, 2006.(in Chinese)
[10]  DORIGO M, GANBARDELLA L M. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 53-66.
[11]  MULLEN R J, MONEKOSSO D, BARMAN S, et al. A review of ant algorithms[J]. Espert Systems with Applications, 2009, 36(6): 9608-9617.
[12]  CHEN C H, TING C J. Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem[J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(6): 1099-1122.
[13]  刘臣奇,李梅娟,陈雪波.基于蚁群算法的拣选作业优化问题[J].系统工程理论与实践,2009,29(3):179-185. LIU Chen-qi, LI Mei-juan, CHEN Xue-bo. Order picking problem based on ant colony algorithm[J]. Systems Engin-eering―Theory and Practice, 2009, 29(3): 179-185.(in Chinese)
[14]  CHU S C, RODDICK J F, PAN J S. Ant colony system with communication strategies[J]. Information Sciences, 2004, 167(1/2/3/4): 63-76.
[15]  ELLLABIB I, CALAMAI P, BASIR O. Exchange strategies for multiple ant colony system[J]. Information Sciences, 2007, 177(5): 1248-1264.
[16]  RANDALL M, LEWIS A. A parallel implementation of ant colony optimization[J]. Journal of Parallel and Distributed Computing, 2002, 62(9): 1421-1432.
[17]  葛春景,王 霞,关贤军.应急服务设施轴辐网络布局的λ-鲁棒优化[J].工业工程与管理,2010,15(6):45-50,57. GE Chun-jing, WANG Xia, GUAN Xian-jun. λ-robust optimization of emergent service facilities hub-and-spoke network response for large-scale emergency[J]. Industkial Engineering and Management, 2010, 15(6): 45-50, 57.(in Chinese)

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133