Irrigation Scheduling with Genetic Algorithms

A typical irrigation scheduling problem is one of preparing a schedule to service a group of outlets that may be serviced simultaneously. This problem has an analogy with the classical multimachine earliness/tardiness scheduling problem in operations research (OR). In previously published work, integer programming was used to solve irrigation scheduling problems; however, such scheduling problems belong to a class of combinatorial optimization problems known to be computationally demanding. This is widely reported in OR literature. Hence integer programs (IPs) can be used only to solve relatively small problems typically in a research environment where considerable computational resources and time can be allocated to solve a single schedule. For practical applications, metaheuristics such as genetic algorithms, simulated annealing, or tabu search methods need to be used. However, these need to be formulated carefully and tested thoroughly. The current research explores the potential of genetic algorithms to solve the simultaneous irrigation scheduling problem. For this purpose, two models are presented: the stream tube model and the time block model. These are formulated as genetic algorithms, which are then tested extensively, and the solution quality is compared with solutions from an IP. The suitability of these models for the simultaneous irrigation scheduling problem is reported.     

Non-Unit-Based Planning and Scheduling of Repetitive Construction Projects

Repetitive scheduling methods are more effective than traditional critical path methods in the planning and scheduling of repetitive construction projects. Nevertheless, almost all the repetitive scheduling methods developed so far have been based on the premise that a repetitive project is comprised of many identical production units. In this research a non-unit-based algorithm for the planning and scheduling of repetitive projects is developed. Instead of repetitive production units, repetitive or similar activity groups are identified and employed for scheduling. The algorithm takes into consideration: (1) the logical relationship of activity groups in a repetitive project; (2) the usage of various resource crews in an activity group; (3) the maintaining of resource continuity; and (4) the time and cost for the routing of resource crews. A sample case study and a case study of a sewer system project are conducted to validate the algorithm, as well as to demonstrate its application. Results and findings are reported.     

Investigating the Effectiveness of Certain Priority Rules on Resource Scheduling of Housing Estate Projects

The heuristic method is one of the methods used for the scheduling of resource-constrained projects. This method is commonly used in programming the projects with high number of activities and resources such as construction investments. This paper investigates the effectiveness of three heuristic method priority rules applied in the resource scheduling of ten Turkish housing estate projects which were scheduled according to three preselected priority rules [maximum remaining path length (MRPL), latest finish time (LFT), and minimum slack time (MNSLCK)] in resource-constrained conditions. The performance of each priority rule was evaluated in relation to the duration of the project. The results revealed that MRPL priority reduced the project duration to minimum in six projects, whereas LFT priority yielded the best duration results in three projects and MNSLCK priority in only one project.     

Parallel Genetic Algorithms for Optimizing Resource Utilization in Large-Scale Construction Projects

This paper presents the development of a parallel multiobjective genetic algorithm framework to enable an efficient and effective optimization of resource utilization in large-scale construction projects. The framework incorporates a multiobjective optimization module, a global parallel genetic algorithm module, a coarse-grained parallel genetic algorithm module, and a performance evaluation module. The framework is implemented on a cluster of 50 parallel processors and its performance was evaluated using 183 experiments that tested various combinations of construction project sizes, numbers of parallel processors and genetic algorithm setups. The results of these experiments illustrate the new and unique capabilities of the developed parallel genetic algorithm framework in: (1) Enabling an efficient and effective optimization of large-scale construction projects; (2) achieving significant computational time savings by distributing the genetic algorithm computations over a cluster of parallel processors; and (3) requiring a limited and feasible number of parallel processors/computers that can be readily available in construction engineering and management offices.     

Finance-Based Scheduling of Construction Projects Using Integer Programming

Construction scheduling is the process of devising schemes for sequencing activities. A realistic schedule fulfills the real concerns of users, thus minimizing the chances of schedule failure. The minimization of total project duration has been the concept underlying critical-path method/program evaluation and review technique (CPM/PERT) schedules. Subsequently, techniques including resource management and time-cost trade-off analysis were developed to customize CPM/PERT schedules in order to fulfill users’ concerns regarding project resources, cost, and time. However, financing construction activities throughout the course of the project is another crucial concern that must be properly treated otherwise, nonrealistic schedules are to be anticipated. Unless contractors manage to procure adequate cash to keep construction work running according to schedule, the pace of work will definitely be relaxed. Therefore, always keeping scheduled activities in balance with available cash is a potential contribution to producing realistic schedules. This paper introduces an integer-programming finance-based scheduling method to produce financially feasible schedules that balance the financing requirements of activities at any period with the cash available during that same period. The proposed method offers twofold benefits of minimizing total project duration and fulfilling finance availability constraints.     

Efficient Hybrid Genetic Algorithm for Resource Leveling via Activity Splitting

Resource leveling problem is an attractive field of research in project management. Traditionally, a basic assumption of this problem is that network activities could not be split. However, in real-world projects, some activities can be interrupted and resumed in different time intervals but activity splitting involves some cost. The main contribution of this paper lies in developing a practical algorithm for resource leveling in large-scale projects. A novel hybrid genetic algorithm is proposed to tackle multiple resource-leveling problems allowing activity splitting. The proposed genetic algorithm is equipped with a novel local search heuristic and a repair mechanism. To evaluate the performance of the algorithm, we have generated and solved a new set of network instances containing up to 5,000 activities with multiple resources. For small instances, we have extended and solved an existing mixed integer programming model to provide a basis for comparison. Computational results demonstrate that, for large networks, the proposed algorithm improves the leveling criterion at least by 76% over the early schedule solutions. A case study on a tunnel construction project has also been examined.     

Resource Optimization Using Combined Simulation and Genetic Algorithms

This paper presents a new approach for resource optimization by combining a flow-chart based simulation tool with a powerful genetic optimization procedure. The proposed approach determines the least costly, and most productive, amount of resources that achieve the highest benefit/cost ratio in individual construction operations. To further incorporate resource optimization into construction planning, various genetic algorithms (GA)-optimized simulation models are integrated with commonly used project management software. Accordingly, these models are activated from within the scheduling software to optimize the plan. The result is a hierarchical work-breakdown-structure tied to GA-optimized simulation models. Various optimization experiments with a prototype system on two case studies revealed its ability to optimize resources within the real-life constraints set in the simulation models. The prototype is easy to use and can be used on large size projects. Based on this research, computer simulation and genetic algorithms can be an effective combination with great potential for improving productivity and saving construction time and cost.     

Survey of the Construction Industry Relative to the Use of CPM Scheduling for Construction Projects

While critical-path method (CPM) scheduling has been around since the 1950s, its application in the construction industry has still not received 100% acceptance or consistency in how it is used. Project controls, and CPM scheduling in particular, have gone unchanged in the standards arena with little focus for a common understanding and recognition of what is required for CPM schedule development, implementation, and use. In recent years, little research has been conducted relative to the use of CPM and its benefits. In order to determine how the industry views its applicability and usage, a survey was developed for the stakeholders in the construction industry. This paper summarizes extensive research that was performed of the construction industry relative to the use of CPM scheduling, its applicability and its acceptance in the execution of today’s constructed projects. The research obtained the stakeholders’ views on the use and effectiveness of CPM scheduling; the necessary qualifications of scheduling personnel; and opinions relative to whether standards and/or best practices are necessary. The paper discusses the different views of the stakeholders and recommendations as to how consistency can be obtained in the use of CPM scheduling in order to improve the construction industry.     

Optimizing Resource Leveling in Construction Projects

Construction schedules, generated by network scheduling techniques, often cause undesirable resource fluctuations that are impractical, inefficient, and costly to implement on construction sites. This paper presents the development of two innovative resource leveling metrics to directly measure and minimize the negative impact of resource fluctuations on construction productivity and cost. The first metric quantifies the total amount of resources that need to be temporarily released during low demand periods and rehired at a later stage during high demand periods. The second measures the total number of idle and nonproductive resource days that are caused by undesirable resource fluctuations. The two new metrics are incorporated in a robust and practical optimization model that is capable of generating optimal and practical schedules that maximize the efficiency of resource utilization. An application example is analyzed to illustrate the use of the model and demonstrate its capabilities. The results of this analysis show that the present model and metrics are capable of outperforming existing metrics and eliminating undesirable resource fluctuations and resource idle time.     

Optimized Scheduling of Linear Projects

This paper presents a model, designed to optimize scheduling of linear projects. The model employs a two-state-variable, N-stage, dynamic programming formulation, coupled with a set of heuristic rules. The model is resource-driven, and incorporates both repetitive and nonrepetitive activities in the optimization process to generate practical and near-optimal schedules. The model optimizes either project construction duration, total cost, or their combined impact for what is known as cost-plus-time bidding, also referred to as A+B bidding. The model has a number of interesting and practical features. It supports multiple crews to work simultaneously on any activity, while accounting for: (1) multiple successors and predecessors with specified lead and lag times; (2) the impact of transverse obstructions, such as rivers and creeks, on crew assignments and associated time and cost; (3) the effect of inclement weather and learning curve on crew productivity; and (4) variations in quantities of work in repetitive activities from one unit to another. The model is implemented in a prototype software that operates in Windows? environment. It is developed utilizing object-oriented programming, and provides for automated data entry. Several graphical and tabular output reports can be generated. An example project, drawn from the literature, is analyzed to demonstrate the features of the developed model.     

Methodology for Integrated Risk Management and Proactive Scheduling of Construction Projects

An integrated methodology is developed for planning construction projects under uncertainty. The methodology relies on a computer supported risk management system that allows for the identification, analysis, and quantification of the major risk factors and the derivation of their probability of occurrence and their impact on the duration of the project activities. Using project management estimates of the marginal cost of activity starting time disruptions, a heuristic procedure is used to develop a stable proactive baseline schedule that is sufficiently protected against the anticipated disruptions that may occur during project execution and that exhibits acceptable makespan performance. We illustrate the application of the methodology on a real life construction project and demonstrate that our proactive scheduler generates baseline schedules that outperform the schedules generated by commercial software packages in terms of robustness and timely project completion probability.     

Finance-Based Scheduling: Tool to Maximize Project Profit Using Improved Genetic Algorithms

Contractor’s ability to procure cash to carry out construction operations represents a crucial factor to run profitable business. Bank overdrafts have always been the major source to finance construction projects. However, it is not uncommon that bankers set a limit on the credit allocated to an established overdraft. Bankers’ interest rates and consequently contractors’ financing costs are basically determined based on the allocated credit limits. Furthermore, project indirect costs are directly proportional to the project duration which is affected by the allocated credit limit. Thus, the credit limit affects project financing costs and indirect costs which in turn affect project profit. However, finance-based scheduling produces financially executable schedules at specified credit limits while maintaining the demand of time minimization. Thus, finance-based scheduling provides a tool to control the credit requirements. This control enables contractors to negotiate lower interest rates which reduce financing costs. Thus, finance-based scheduling enables contractors to reduce project indirect costs and financing costs. This paper utilizes genetic algorithm’s technique to devise finance-based schedules that maximize project profit through minimizing financing costs and indirect costs.     

Comparison of Using Mixed-Integer Programming and Genetic Algorithms for Construction Site Facility Layout Planning

The use of modular construction has gained wide acceptance in the industry. For a specific construction facility layout problem such as site precast standardized modular units, it requires the establishment of an on-site precast yard. Arranging the precast facilities within a construction site presents real challenge to site management. This complex task is further augmented with the involvement of several resources and different transport costs. A genetic algorithm (GA) model was developed for the search of a near-optimal layout solution. Another approach using mixed-integer programming (MIP) has been developed to generate optimal facility layout. These two approaches are applied to solve with an example in this paper to demonstrate that the solution quality of MIP outperforms that of GA. Further, another scenario with additional location constraints can also be solved readily by MIP, which, however, if modeled by GA, the solution process would be complicated. The study has highlighted that MIP can perform better than GA in site facility layout problems in which the site facilities and locations can be represented by a set of integer variables.     

Time-Profit Trade-Off Analysis for Construction Projects

This paper presents a multiobjective optimization model that provides new and unique capabilities including generating and evaluating optimal/near-optimal construction resource utilization and scheduling plans that simultaneously minimize the time and maximize the profit of construction projects. The computations in the present model are organized in three major modules: (1) a scheduling module that develops practical schedules for construction projects; (2) a profit module that computes the project profit; and (3) a multiobjective module that searches for and identifies optimal/near optimal trade-offs between project time and profit. A large-scale construction project is analyzed to illustrate the use of the model and to demonstrate its capabilities in generating and visualizing optimal trade-offs between construction time and profit.     

Fuzzy Repetitive Scheduling Method for Projects with Repeating Activities

In projects with repeating activities (such as multistory buildings, highways, or pipelines consisting of reiterating identical or similar units) and in which the activity unit production rates are characterized by uncertainty or imprecision, fuzzy set theory and the well-established repetitive scheduling method (RSM) can be combined to ensure uninterrupted usage of resources between similar activities in different units. The reason for this approach is that in practice the application of RSM may be hindered by several considerations, for example, repetitive units may be slightly different from each other, the performance of construction crews may vary, and there may be complex resource matching and sharing between activities and work sites. The proposed methodology is termed fuzzy repetitive scheduling method (F-RSM), and it requires a generalization of RSM in which schedules are represented by two- or three-dimensional graphs and whereby the concepts of a control segment and the controlling sequence area are introduced. The resulting methodology addressing the original RSM scheduling problem is presented in this paper.     

Optimal Planning and Scheduling for Repetitive Construction Projects

This paper presents a multiobjective optimization model for the planning and scheduling of repetitive construction projects. The model enables construction planners to generate and evaluate optimal construction plans that minimize project duration and maximize crew work continuity, simultaneously. The computations in the present model are organized in three major modules: scheduling, optimization, and ranking modules. First, the scheduling module uses a resource-driven scheduling algorithm to develop practical schedules for repetitive construction projects. Second, the optimization module utilizes multiobjective genetic algorithms to search for and identify feasible construction plans that establish optimal tradeoffs between project duration and crew work continuity. Third, the ranking module uses multiattribute utility theory to rank the generated plans in order to facilitate the selection and execution of the best overall plan for the project being considered. An application example is analyzed to illustrate the use of the model demonstrate its new capabilities in optimizing the planning and scheduling of repetitive construction projects.     

Fast and Accurate Risk Evaluation for Scheduling Large-Scale Construction Projects

This paper presents the development of a novel probabilistic scheduling model that enables fast and accurate risk evaluation for large-scale construction projects. The model is designed to overcome the limitations of existing probabilistic scheduling methods, including the inaccuracy of the program evaluation and review technique (PERT) and the long computational time of the Monte Carlo simulation method. The model consists of three main modules: PERT model; fast and accurate multivariate normal integral method; and a newly developed approximation method. The new approximation method is designed to focus the risk analysis on the most significant paths in the project network by identifying and removing insignificant paths that are either highly correlated or have high probability of completion time. The performance of the new model is analyzed using an application example. The results of this analysis illustrate that the new model was able to reduce the computational time for a large-scale construction project by more than 94% while keeping the error of its probability estimates to less than 3%, compared with Monte Carlo Simulation methods.     

Multiobjective Linear Programming Model for Scheduling Linear Repetitive Projects

Linear repetitive construction projects require large amounts of resources which are used in a sequential manner and therefore effective resource management is very important both in terms of project cost and duration. Existing methodologies such as the critical path method and the repetitive scheduling method optimize the schedule with respect to a single factor, to achieve minimum duration or minimize resource work breaks, respectively. However real life scheduling decisions are more complicated and project managers must make decisions that address the various cost elements in a holistic way. To respond to this need, new methodologies that can be applied through the use of decision support systems should be developed. This paper introduces a multiobjective linear programming model for scheduling linear repetitive projects, which takes into consideration cost elements regarding the project’s duration, the idle time of resources, and the delivery time of the project’s units. The proposed model can be used to generate alternative schedules based on the relative magnitude and importance of the different cost elements. In this sense, it provides managers with the capability to consider alternative schedules besides those defined by minimum duration or maximizing work continuity of resources. The application of the model to a well known example in the literature demonstrates its use in providing explicatory analysis of the results.     

Genetic Algorithms for Construction Site Layout in Project Planning

Construction site layout is concerned with the existence, positioning, and timing of the temporary facilities that are used to carry out a construction project. Typically these problems are very complicated to formulate and difficult to solve. They are, however, very important to virtually any construction project, since the site layout can significantly affect the cost of the project. This paper describes the general site layout problem from both a theoretical and a practical point of view. It proposes genetic algorithms as a possible solution technique and includes a theoretical example of positioning temporary facilities. This is extended to a practical problem in which the cost of movement is modeled realistically using an augmented genetic algorithm. Some preliminary conclusions are drawn for the application of genetic algorithms to construction site layout problems.