CUI Xiao-yan, LI Xu-hong, MAO Hai-jun, ZHANG Yong, YANG Ping-le. Parallel ant colony optimization of location problem for limited single allocation hub[J]. Journal of Traffic and Transportation Engineering, 2011, 11(3): 74-81. doi: 10.19818/j.cnki.1671-1637.2011.03.013
Citation: CUI Xiao-yan, LI Xu-hong, MAO Hai-jun, ZHANG Yong, YANG Ping-le. Parallel ant colony optimization of location problem for limited single allocation hub[J]. Journal of Traffic and Transportation Engineering, 2011, 11(3): 74-81. doi: 10.19818/j.cnki.1671-1637.2011.03.013

Parallel ant colony optimization of location problem for limited single allocation hub

doi: 10.19818/j.cnki.1671-1637.2011.03.013
More Information
  • Author Bio:

    CUI Xiao-yan(1981-), female, doctoral student, +86-25-83689832, cxy_198153@yahoo.com.cn

    LI Xu-hong(1963-), male, professor, PhD, +86-25-83793685, lixuhong@seu.edu.cn

  • Received Date: 2011-01-26
  • Publish Date: 2011-06-25
  • The characteristics of location problem for limited single allocation hub were analyzed. The sum of total network transportation costs and fixed facility costs was taken as the minimum objective function, and a mixed integer linear programming model with fewer variables was set up. Parallel ant colony optimization (P-ACO) was used to solve the model, and correlative simulation test was carried out combined with Australia post data. Calculation result indicates that for the most difficult problem with 50 nodes and double tight constraints, the computational time of proposed model is 3.59 s, which is minimum compared with the other algorithms, and the calculation errors are not more than 0.09%. So, P-ACO has good solution efficiency and calculational stability.

     

  • loading
  • [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. doi: 10.1016/S0966-6923(01)00019-9
    [2]
    LI Yang. Research on hub and spoke network theory and its application[D]. Shanghai: Fudan University, 2006. (in Chinese)
    [3]
    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. doi: 10.1016/j.ejor.2007.06.008
    [4]
    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.
    [5]
    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. doi: 10.1007/s10589-007-9069-1
    [6]
    COSTA M D G, CAPTIVO M E, CLIMACO J. Capacitated single allocation hub location problem—a bi-criteria approach[J]. Computers and Operations Research, 2008, 35 (11): 3671-3695. doi: 10.1016/j.cor.2007.04.005
    [7]
    CHEN J F. A heuristics for the capacitated single allocation hub location problem[J]. Lecture Notes in Electrical Engineering, 2008 (5): 185-196.
    [8]
    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. doi: 10.1007/s00291-008-0159-y
    [9]
    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) doi: 10.3969/j.issn.1671-1637.2009.06.014
    [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. doi: 10.1109/4235.585892
    [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 systemto solve the single source capacitated facility location problem[J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44 (6): 1099-1122. doi: 10.1016/j.tre.2007.09.001
    [13]
    LIU Chen-qi, LI Mei-juan, CHEN Xue-bo. Order picking problem based on ant colony algorithm[J]. Systems Engineering—Theory and Practice, 2009, 29 (3): 179-185. (in Chinese) doi: 10.3321/j.issn:1000-6788.2009.03.025
    [14]
    CHUS C, RODDICKJ F, PANJ 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 opti mization[J]. Journal of Parallel and Distributed Computing, 2002, 62 (9): 1421-1432.
    [17]
    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) https://www.cnki.com.cn/Article/CJFDTOTAL-GYGC201006012.htm

Catalog

    Article Metrics

    Article views (645) PDF downloads(602) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return