Optimization of Single Row Layout in Construction Site Planning: A Comparative Study of Heuristics Algorithms

Several heuristics algorithms can be employed to solve single row layout in construction site planning. Firstly, this chapter builds Tabu Search to deal with the problem. Other heuristics methods which are genetic algorithm (GA) and estimation distribution algorithm (EDA) are also developed against Tabu Search. A comparative study is performed to test the effectiveness and efficiency of the algorithms. The statistical test, ANOVA followed by the t-test, compares the results of the three algorithms. Then, the pros and cons of using the algorithms are stated.

[1]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[2]  Hamed Samarghandi,et al.  A Particle Swarm Optimization for the Single Row Facility Layout Problem , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[3]  Jian Guan,et al.  Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem , 2016, Eur. J. Oper. Res..

[4]  K. Ravi Kumar,et al.  A heuristic procedure for the single-row facility layout problem , 1995 .

[5]  Cuauhtémoc Sánchez-Ramírez,et al.  Handbook of Research on Managerial Strategies for Achieving Optimal Performance in Industrial Processes , 2016 .

[6]  Khaled A El-Rayes,et al.  Performance of global optimization models for dynamic site layout planning of construction projects , 2013 .

[7]  Andrew Higgins,et al.  Scheduling of road vehicles in sugarcane transport: A case study at an Australian sugar mill , 2006, Eur. J. Oper. Res..

[8]  Alfonso J. Gil,et al.  The Knowledge Transfer Process on the Development of Dynamic Capabilities through Industrial Networks , 2016 .

[9]  Chao Ou-Yang,et al.  Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem , 2013, Comput. Ind. Eng..

[10]  José Rui Figueira,et al.  Single row facility layout problem using a permutation-based genetic algorithm , 2011, Eur. J. Oper. Res..

[11]  Kyrre Glette,et al.  Pareto Optimal Based Evolutionary Approach for Solving Multi-Objective Facility Layout Problem , 2009, ICONIP.

[12]  Kourosh Eshghi,et al.  An efficient tabu algorithm for the single row facility layout problem , 2010, Eur. J. Oper. Res..

[13]  M. Adel El-Baz,et al.  A genetic algorithm for facility layout problems of different manufacturing environments , 2004, Comput. Ind. Eng..

[14]  S. H. Choi,et al.  A hybrid estimation of distribution algorithm for simulation-based scheduling in a stochastic permutation flowshop , 2015, Comput. Ind. Eng..

[15]  Xiaoping Li,et al.  Estimation of distribution algorithm for permutation flow shops with total flowtime minimization , 2011, Comput. Ind. Eng..

[16]  Qingfu Zhang,et al.  Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems , 2010, Expert Syst. Appl..

[17]  Kaushik Kumar,et al.  Earthquake Resistant Design , 2019, Optimization of Design for Better Structural Capacity.

[18]  Fred W. Glover,et al.  Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..

[19]  Kyrre Glette,et al.  Adaptive variable neighborhood search for solving multi-objective facility layout problems with unequal area facilities , 2013, Swarm Evol. Comput..

[20]  Hasan Seyyedhasani,et al.  Using the Vehicle Routing Problem to reduce field completion times with multiple machines , 2017, Comput. Electron. Agric..

[21]  Ravi Shankar,et al.  An ant algorithm for the single row layout problem in flexible manufacturing systems , 2005, Comput. Oper. Res..

[22]  M. K. Tiwari,et al.  Facility layout problem: an approach based on a group decision-making system and psychoclonal algorithm , 2008 .