Essay On Layout Planning

1712 Words4 Pages

CHAPTER TWO – LITERATURE REVIEW

2.1 Concept of Site Layout Planning
The site layout in every construction sites requiring a good planning. A proper planned site layout would definitely reduce the cost and time for construction. Before planning, there are three issues needed to be considered. The first one is identify the temporary facilities needed to support the overall site operation and all the temporary facilities are not a part of the permanent structure. The next issue is to find out the shape and the physical dimensions of those facilities. Finally, those facilities should be positioned within the site boundaries or any remote areas (Tommelein et al., 1991).

We can classify the site layout problems into two different aspects - Static problems and Dynamic problems. According to Ning et al. (2010), a site layout planning without changing the available locations and the facilities in different stages of construction are classified as static problem. While for dynamic problems, it involves the changing of required facilities and the available locations in different construction stages, it is called dynamic problems.

According to Cheng and O’Connor, (1996) an efficient temporary site layout can optimize the following criteria: handling of materials and equipment, travel interference, the need of expansion and relocation, transportation and travel distance for materials and workers and finally the workforce travelling. There are many things we have to consider for the site layout and this is why the site layout with a good planning is needed.

Although there has no completely developed method to get the best solutions for site layout planning, every effort should be made to make the model as good as possible. There are 10 guid...

... middle of paper ...

... type of software like CPLEX, XPRESS, OSL and GUROBI that can used solve MIP problems but not limited to MIP problems.

LINGO is a simples and powerful software that can be used to solve MIP optimization problems. This software can handle tens of thousands of variables and constraints with up to few thousand integer variables (Schrage, 2006). Wong et al. (2010) and Easa and Hossain (2008) used this software to solve MIP problems to find the global optimal solution.

GUROBI is another type of solver that can deal with MIP problems. Hvattum et al. (2012) studied the performance of three different types of solvers, XPRESS, CPLEX and GUROBI in term of the time used to solve BMILP problems and concluded that GUROBI is the fastest solvers and give the optimal results while XPRESS used the longest time to obtain the solution and the solution is not as good as GUROBI did.

Open Document