An improved construction approach using ant colony optimization for solving the dynamic facility layout problem

被引:29
|
作者
Zouein, Pierrette P. [1 ]
Kattan, Sarah [1 ]
机构
[1] Lebanese Amer Univ, Byblos, Lebanon
关键词
Ant colony optimization; dynamic construction site layout; dynamic facility layout; metaheuristics; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM; SEARCH; HEURISTICS;
D O I
10.1080/01605682.2021.1920345
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an improved Ant Colony Optimization (ACOII) algorithm to solve the dynamic facility layout problem for construction sites. The algorithm uses a construction approach in building the layout solutions over time and uses a discrete dynamic search with heuristic info based on both relocation and flow costs to influence facilities' placement in different time periods. The performance of ACOII is investigated using randomly generated data sets where the number of facilities and the number of time periods in the planning horizon vary to mimic what happens on a construction site over time. The experimental results show that ACOII is effective in solving the problem. A benchmarking study using instances from the literature showed promising results with improved solutions for all instances with very large number of facilities and periods.
引用
收藏
页码:1517 / 1531
页数:15
相关论文
共 50 条
  • [21] Hybrid ant systems for the dynamic facility layout problem
    McKendall, AR
    Shang, J
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (03) : 790 - 803
  • [22] Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem
    Nourelfath, M.
    Nahas, N.
    Montreuil, B.
    ENGINEERING OPTIMIZATION, 2007, 39 (08) : 953 - 968
  • [23] A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
    Wong, Kuan Yew
    See, Phen Chiak
    ENGINEERING COMPUTATIONS, 2010, 27 (1-2) : 117 - 128
  • [24] Research on an improved ant colony optimization algorithm for solving traveling salesmen problem
    Lei, Wenli
    Wang, Fubao
    International Journal of Database Theory and Application, 2016, 9 (09): : 25 - 36
  • [25] Improved auto control ant colony optimization using lazy ant approach for grid scheduling problem
    Tiwari, Pawan Kumar
    Vidyarthi, Deo Prakash
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 60 : 78 - 89
  • [26] A TIME-BASED APPROACH FOR SOLVING THE DYNAMIC PATH PROBLEM IN VANETS - AN EXTENSION OF ANT COLONY OPTIMIZATION
    Jyothi, Kambhampati
    Jackson, J. Christy
    JOURNAL OF ENGINEERING SCIENCE AND TECHNOLOGY, 2018, 13 (03) : 813 - 821
  • [27] Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
    Dahan, Fadl
    El Hindi, Khalil
    Mathkour, Hassan
    AlSalman, Hussien
    SENSORS, 2019, 19 (08)
  • [28] Solving Network Coding Resource Problem Using Ant Colony Optimization
    Li, Jingyi
    2018 11TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 2, 2018, : 37 - 40
  • [29] Solving the Feeder Vehicle Routing Problem using ant colony optimization
    Huang, Ying-Hua
    Blazquez, Carola A.
    Huang, Shan-Huen
    Paredes-Belmar, German
    Latorre-Nunez, Guillermo
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 127 : 520 - 535
  • [30] Solving railroad blocking problem using ant colony optimization algorithm
    Yaghini, Masoud
    Foroughi, Amir
    Nadjari, Behnam
    APPLIED MATHEMATICAL MODELLING, 2011, 35 (12) : 5579 - 5591