Dynamic construction site layout planning using max-min ant system

被引:111
|
作者
Ning, Xin [2 ]
Lam, Ka-Chi [1 ]
Lam, Mike Chun-Kit [1 ]
机构
[1] City Univ Hong Kong, Dept Bldg & Construct, Hong Kong, Hong Kong, Peoples R China
[2] Dongbei Univ Finance & Econ, Sch Investment & Construct Management, Dalian, Liaoning Prov, Peoples R China
关键词
Dynamic construction site layout planning; Max-min ant system; Ant colony optimization algorithms; Multi-objective optimization; Continuous dynamic searching scheme; FACILITIES; MODEL; ALGORITHM;
D O I
10.1016/j.autcon.2009.09.002
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Construction site layout planning (CSLP) is a dynamic multi-objective optimization (MOO) problem as there are different facilities employed in the different construction phases of a construction project. In this study, a new method using continuous dynamic searching scheme to guide the max-min ant system (MMAS) algorithm, which is one of the ant colony optimization (ACO) algorithms, to solve the dynamic CSLP problem under the two congruent objective functions of minimizing safety concerns and reducing construction cost is proposed. Using weighted sum method the MOO problem can be solved by the proposed MMAS method. An office building case was used to verify the capability of the proposed method to solve dynamic CSLP problem and the results are promising. The approach could be benchmarked by researchers using other advanced optimization algorithms to solve the same problem or expand the applications to other fields. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:55 / 65
页数:11
相关论文
共 50 条
  • [41] Pareto max-min ant system algorithm and its application to hot rolling batch planning problem
    Jia, Shu-Jin
    Zhu, Jun
    Du, Bin
    Yue, Heng
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2012, 29 (02): : 137 - 144
  • [42] A max-min ant system for the finance-based scheduling problem
    Al-Shihabi, Sameh T.
    AlDurgam, Mohammad M.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 110 : 264 - 276
  • [43] Max-Min Ant System to solve the Software Project Scheduling Problem
    Crawford, Broderick
    Soto, Ricardo
    Johnson, Franklin
    Paredes, Fernando
    Olivares Suarez, Miguel
    PROCEEDINGS OF THE 2014 9TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI 2014), 2014,
  • [44] MAX-MIN Ant System and local search for the traveling salesman problem
    Stutzle, T
    Hoos, H
    PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, : 309 - 314
  • [45] A Novel Max-Min Ant System Algorithm for Traveling Salesman Problem
    Zhang, Zhaojun
    Feng, Zuren
    2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 1, 2009, : 508 - 511
  • [46] Multivalent Graph Matching Problem Solved by Max-Min Ant System
    Ho, Kieu Diem
    Ramel, Jean Yves
    Monmarche, Nicolas
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2020, 2021, 12644 : 227 - 237
  • [47] The Undirected Rural Postman Problem Solved by the MAX-MIN Ant System
    Luisa Perez-Delgado, Maria
    7TH INTERNATIONAL CONFERENCE ON PRACTICAL APPLICATIONS OF AGENTS AND MULTI-AGENT SYSTEMS (PAAMS 2009), 2009, 55 : 179 - 187
  • [48] Disassembly sequence planning approach for product virtual maintenance based on improved max-min ant system
    Liu, Xinhua
    Peng, Gaoliang
    Liu, Xiumei
    Hou, Youfu
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 59 (5-8): : 829 - 839
  • [49] Implementing a GPU-based parallel MAX-MIN Ant System
    Skinderowicz, Rafal
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 106 : 277 - 295
  • [50] Extension of Max-Min Ant System with Exponential Pheromone Deposition Rule
    Acharya, Ayan
    Maiti, Deepyaman
    Banerjee, Aritra
    Janarthanan, R.
    Konar, Amit
    ADCOM: 2008 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATIONS, 2008, : 1 - +