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 条
  • [31] MAX-MIN ANT SYSTEM FOR LOCATION-ROUTING PROBLEMS
    Sodsoon, Suphan
    SURANAREE JOURNAL OF SCIENCE AND TECHNOLOGY, 2010, 17 (04): : 321 - 334
  • [32] Transmembrane Helix Assembly by Max-Min Ant System Algorithm
    Sujaree, Kanon
    Kitjaruwankul, Sunan
    Boonamnaj, Panisak
    Supunyabut, Chirayut
    Sompornpisut, Pornthep
    CHEMICAL BIOLOGY & DRUG DESIGN, 2015, 86 (06) : 1360 - 1372
  • [33] MEMORY OPTIMIZED PHEROMONE STRUCTURES FOR MAX-MIN ANT SYSTEM
    Behalek, Marek
    Surkovsky, Martin
    Meca, Ondrej
    Bohm, Stanislav
    NEURAL NETWORK WORLD, 2015, 25 (02) : 161 - 174
  • [34] A Modified Max-Min Ant System for Vehicle Routing Problems
    Zhao, Gang
    Luo, Wenjuan
    Sun, Ruoying
    Yin, Chunhua
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 6377 - 6380
  • [35] Max-min ant system applied to water distribution system optimisation
    Zecchin, AC
    Maier, HR
    Simpson, AR
    Roberts, AJ
    Berrisford, MJ
    Leonard, M
    MODSIM 2003: INTERNATIONAL CONGRESS ON MODELLING AND SIMULATION, VOLS 1-4: VOL 1: NATURAL SYSTEMS, PT 1; VOL 2: NATURAL SYSTEMS, PT 2; VOL 3: SOCIO-ECONOMIC SYSTEMS; VOL 4: GENERAL SYSTEMS, 2003, : 795 - 800
  • [36] A Parallel Max-Min Ant System Algorithm for Dynamic Resource Allocation to Support QoS Requirements
    Dac-Nhuong Le
    Bhateja, Vikrant
    Gia Nhu Nguyen
    2017 4TH IEEE UTTAR PRADESH SECTION INTERNATIONAL CONFERENCE ON ELECTRICAL, COMPUTER AND ELECTRONICS (UPCON), 2017, : 697 - 700
  • [37] Dynamic Combination of Improved Max-Min and Ant Colony Algorithm for Load Balancing in Cloud System
    Ghumman, Navtej Singh
    Kaur, Rajwinder
    2015 6TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT), 2015, : 263 - 267
  • [38] Feature Selection in Classification using Binary Max-Min Ant System with Differential Evolution
    Montemayor, Jennifer Joyce M.
    Crisostomo, Renato V.
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 2559 - 2566
  • [39] A Max-Min Ant System Modeling Approach for Production Scheduling in a FMS
    Kato, E. R. R.
    Morandin, O., Jr.
    Fonseca, M. A. S.
    IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2010), 2010,
  • [40] Solving the Uncapacitated Traveling Purchaser Problem with the MAX-MIN Ant System
    Skinderowicz, Rafal
    COMPUTATIONAL COLLECTIVE INTELLIGENCE, ICCCI 2018, PT II, 2018, 11056 : 257 - 267