Hybrid Time-Cost Optimization of Nonserial Repetitive Construction Projects

Ezeldin, A. Samer; Soliman, Ahmed Hassan

doi:10.1061/(asce)0733-9364(2009)135:1(42)

Cited by 37 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This article examines scheduling optimization problems in transportation‐type linear projects using LSM. Our research has three aspects: (1) proposition of a logical relationship description method between activities under the framework of LSM; (2) proposition of a constraints system under LSM, including the three classic constraints encountered in construction project scheduling optimization problems, that is, logical constraints, duration constraints, and resource constraints (Christodoulou and Ellinas, ; Ezeldin and Soliman, ). Other constraints are examined as well: (3) establishment of an LSM‐based scheduling optimization model (LSM‐SOM) based on constraint satisfaction problems (CSPs) and constraint programming (CP) technique to deal with optimization problems including resource allocation, resource leveling, and DTCTPs within transportation‐type linear projects with practicality and flexibility.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Optimization of Linear Schedule with Constraint Programming

Tang

Liu

Wang

et al. 2017

Computer aided Civil Eng

View full text Add to dashboard Cite

In recent decades, construction project scheduling optimization has received extensive attention from the research community. However, the most commonly used scheduling approach, the critical path method, is often inapplicable to transportation-type linear projects. Recently, the linear scheduling method (LSM) has demonstrated many advantages for such projects and has become a popular research subject. As a relatively novel scheduling method, LSM requires further improvement, as there are restrictions associated with the scheduling/optimization of linear projects. By analyzing results from previous studies, we propose a unique three-element mode, a description method for LSM's logical relationships and constraints system. An LSM-based scheduling optimization model based on constraint satisfaction problems and constraint programming is then proposed that could be used in classical scheduling optimization problems with flexibility, practicability, and solution superiority. The proposed model is verified using three practical transportation construction projects. Verification under six optimization scenarios demonstrates the advantages of our approach.

show abstract

Section: Introductionmentioning

confidence: 99%

Scheduling Optimization of Linear Schedule with Constraint Programming

Tang

Liu

Wang

et al. 2017

Computer aided Civil Eng

View full text Add to dashboard Cite

show abstract

“…For example, cost optimization of project schedules has been effectively carried out by genetic algorithms (Eshtehardian et al 2009), simulated annealing (He et al 2009), tabu search (Hazir et al 2011), neural networks (Adeli and Karim 1997), ant colony optimization (Kalhor et al 2011), particle swarm optimization (Yang 2007), differential evolution (Nearchou 2010), harmony search (Geem 2010) and hybrid methods, such as genetic algorithm and dynamic programming (Ezeldin and Soliman 2009), cutting plane method and Monte Carlo simulation (Mokhtari et al 2010), genetic algorithm and simulated annealing (Sonmez and Bettemir 2012) among others. Certainly, there are also various extensions of aforesaid techniques that can be found in the literature.…”

Section: Introductionmentioning

confidence: 99%

An integration of spreadsheet and project management software for cost optimal time scheduling in construction

Valenko

Klanšek

2017

Organization, Technology and Management in Construction: An International Journal

View full text Add to dashboard Cite

Successful performance and completion of construction projects highly depend on an adequate time scheduling of the project activities. On implementation of time scheduling, the execution modes of activities are most often required to be set in a manner that enables in achieving the minimum total project cost. This paper presents an approach to cost optimal time scheduling, which integrates a spreadsheet application and data transfer to project management software (PMS). At this point, the optimization problem of project time scheduling is modelled employing Microsoft Excel and solved to optimality using Solver while organization of data is dealt by macros. Thereupon, Microsoft Project software is utilized for further managing and presentation of optimized time scheduling solution. In this way, the data flow between programs is automated and possibilities of error occurrence during scheduling process are reduced to a minimum. Moreover, integration of spreadsheet and PMS for cost optimal time scheduling in construction is performed within well-known program environment that increases the possibilities of its wider use in practice. An application example is shown in this paper to demonstrate the advantages of proposed approach.

show abstract

“…genetic algorithms [7÷12], simulated annealing [13,14], tabu search [14,15], neural networks [16], ant colony optimization [17÷20], particle swarm optimization [21], differential evolution [22], harmony search [23] mixedinteger linear programming [24÷28] and hybrid methods, such as genetic algorithm and simulated annealing [28], genetic algorithm and dynamic programming [29], cutting plane method and Monte Carlo simulation [30], etc.…”

Section: Introductionmentioning

confidence: 99%

Mixed-integer nonlinear programming based optimal time scheduling of construction projects under nonconvex costs

Cajzek¹,

Klanšek

2016

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper Optimal project scheduling under nonconvex time-cost relations represents a challenging problem in construction management. The nonconvex time-cost relations may appear in a construction project when several different duration options are available for its activities due to alternative technological processes enabled for their realization or wide accessibility of production resources. The source of nonconvexity of the project scheduling optimization problem can also be the project penalty-or bonus-duration relations arranged within the construction contract. The aim of this paper is to present the mixed-integer nonlinear programming (MINLP) based optimal time scheduling of construction projects under nonconvex costs. For this purpose, the MINLP model was developed and applied. A numerical example from literature and an example of construction project time-cost trade-off analysis under practical nonconvex penalty function are given in the paper to demonstrate advantages of MINLP optimization. The example from literature first presented the capability of the MINLP approach to obtain the optimal solution for difficult, highly combinatorial nonconvex discrete project scheduling problem. Thereupon, the following example revealed that the optimal project time-cost curve may take very nonuniform shape on account of discrete nature of activity direct cost options and nonconvex relation between project duration and total cost. In this way, the presented study intends to provide practitioners with new information from the field of optimization techniques for project scheduling as well as an alternative view on performance of total cost when project duration is changed. Keywords: construction management; discrete optimization; mixed-integer nonlinear programming; nonconvex costs; time schedulingOptimalno terminsko planiranje građevinskih projekata s nekonveksnim troškovima pomoću mješovitog cjelobrojnog nelinearnog programiranja Izvorni znanstveni članakOptimalno terminsko planiranje projekata s nekonveksnim troškovima predstavlja zahtjevan problem u organizaciji građenja. Nekonveksni odnosi između vremena i troškova mogu nastupiti u građevinskom projektu kada su na raspolaganju različite varijante za trajanje njegovih aktivnosti zbog mogućnosti izbora različitih tehnoloških procesa za izvođenje radova ili široke pristupačnosti proizvodnih resursa. Izvor nekonveksnosti problema troškovne optimizacije terminskog plana je moguće naći i u dogovorenom odnosu između trajanja projekta te penala ili premije iz ugovora o građenju. Cilj ovoga rada je predstaviti optimalno terminsko planiranje projekata s nekonveksnim troškovima pomoću mješovitog cjelobrojnog nelinearnog programiranja. U tu svrhu je razvijen i primijenjen optimizacijski model. Za prikaz prednosti optimizacije s mješovitim cjelobrojnim nelinearnim programiranjem su u radu predstavljeni uporaba razvijenog modela na primjeru iz literature i primjer analize ovisnosti ukupnih troškova građevinskog projekta o dužini njegovoga trajanja uzimajući u...

show abstract

Hybrid Time-Cost Optimization of Nonserial Repetitive Construction Projects

Cited by 37 publications

References 13 publications

Scheduling Optimization of Linear Schedule with Constraint Programming

Scheduling Optimization of Linear Schedule with Constraint Programming

An integration of spreadsheet and project management software for cost optimal time scheduling in construction

Mixed-integer nonlinear programming based optimal time scheduling of construction projects under nonconvex costs

Contact Info

Product

Resources

About