MINLP optimization model for the nonlinear discrete time–cost trade-off problem

Klanšek, Uroš; Pšunder, Mirko

doi:10.1016/j.advengsoft.2012.01.006

Cited by 17 publications

(19 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in [15], time-switch constraints, work continuity constraints, and net present value optimization are included. In [17], TCTP including generalized precedence relationship constraints between project activities, project duration constraints, logical constraints and a budget constraint is formulated as a mixed integer nonlinear optimization problem. In [18], DTCTP with multi-mode case is studied.…”

Section: Time-cost Trade-offmentioning

confidence: 99%

Optimizations in Project Scheduling: A State-of-Art Survey

Wang

Jiang

2014

Intelligent Systems, Control and Automation: Science and Engineering

View full text Add to dashboard Cite

Project scheduling is concerned with an optimal allocation of resources to activities realized over time. To survive in today's competitive environment, efficient scheduling for project development becomes more and more important. The classical project scheduling is based on the critical path method (CPM) in which resources required are assumed unlimited. This is however impractical. To overcome CPM's drawback, several techniques and optimizations have been proposed in project scheduling literature. In this chapter, we will present a state-of-art survey on project scheduling from the optimization point of view. In particularly, we will focus on the advancements of optimization formulations and solutions on project scheduling in the recent years.

show abstract

Section: Time-cost Trade-offmentioning

confidence: 99%

Optimizations in Project Scheduling: A State-of-Art Survey

Wang

Jiang

2014

Intelligent Systems, Control and Automation: Science and Engineering

View full text Add to dashboard Cite

show abstract

“…The MINLP approach can be executed in three steps (Klanšek, Pšunder 2012). The first one comprises the generation of a superstructure with different alternatives for discrete solutions of continuous variables, the second one includes the development of the MINLP model formulation and the last one consists of a solution for the stated MINLP problem.…”

Section: Minlp Optimization Approachmentioning

confidence: 99%

“…In recent paper by Klanšek and Pšunder (2012), the capability of the MINLP optimization to solve a specific nonlinear discrete network problem was shown on the nonlinear discrete time-cost trade-off problem. The implemented research presents a natural continuation of the work introduced in reference (Klanšek, Pšunder 2010), where the performance of different global nonlinear programming (NLP) optimization techniques was tested on a set of nonlinear (continuous) transportation problems.…”

Section: Introductionmentioning

confidence: 99%

Solving the Nonlinear Discrete Transportation Problem by Minlp Optimization

Klanšek

2013

Transport

Self Cite

View full text Add to dashboard Cite

The Nonlinear Discrete Transportation Problem (NDTP) belongs to the class of the optimization problems that are generally difficult to solve. The selection of a suitable optimization method by which a specific NDTP can be appropriately solved is frequently a critical issue in obtaining valuable results. The aim of this paper is to present the suitability of five different Mixed-Integer Nonlinear Programming (MINLP) methods, specifically for the exact optimum solution of the NDTP. The evaluated MINLP methods include the extended cutting plane method, the branch and reduce method, the augmented penalty/outer-approximation/equality-relaxation method, the branch and cut method, and the simple branch and bound method. The MINLP methods were tested on a set of NDTPs from the literature. The gained solutions were compared and a correlative evaluation of the considered MINLP methods is shown to demonstrate their suitability for solving the NDTPs.

show abstract

“…Kelley, J. E. and Fulkerson, D. R. are the pioneers of the formulation of the optimization problem considering the time-cost ratio, as an LP model [30].…”

Section: Applied Methodsmentioning

confidence: 99%

Minimization of direct costs in the construction of torrent control structures

et al. 2017

View full text Add to dashboard Cite

Original scientific paperThe most important elements in the planning of the implementation of the torrent (flood) control projects which need to be estimated are time, costs (budget) and resource required. These three elements are interactive: a shorter duration of structure construction causes additional resources engagement and increased costs, and vice versa -greater costs provide a shorter duration of construction. This paper analysis direct project cost minimization for four torrent control projects. The construction duration and the dynamic plan of project activities have been determined using the CPM method of network planning. The optimization problem -minimization of direct cost of construction subject to constraints such as: given deadline, precedence constraints, and upper and lower bounded duration time of activities is solved using linear programming and Matlab toolbox. Our results show that applied methods ensure significant cost savings, which is an important challenge in the construction management. Keywords: cost minimization; CPM method; linear programming; torrent control Minimiziranje direktnih troškova izgradnje objekata za zaštitu od poplavaIzvorni znanstveni članak Najvažniji elemeni u planiranju provedbe projekata kontrole od bujica (poplava) su procjena vremena, troškova (buđžeta) i resursa. Ova tri elementa su interaktivna: kraće trajanje izgradnje strukture uzrokuje angažman dodatnih resursa i povećanje troškova i obrnuto, veći troškovi dovode do kraćeg trajanja gradnje. Ovaj rad se bavi minimiziranjem direktnih troškova projekta na primjeru četiri projekta kontrole bujičnih poplava. Trajanje gradnje i dinamički plan projektnih aktivnosti su određeni pomoću CMP metode mrežnog planiranja. Optimizacijski problem -minimiziranje direktnih troškova gradnje, uz ograničenja kao što su: zadan rok, redoslijed aktivnosti, gornja i donja ograničenja vremena trajanja aktivnosti, riješen je primjenom linearnog programiranja i sučelja Matlaba. Dobiveni rezultati pokazuju da primijenjene metode osiguravaju značajne uštede što je važan izazov organizacije građenja.

show abstract

MINLP optimization model for the nonlinear discrete time–cost trade-off problem

Cited by 17 publications

References 40 publications

Optimizations in Project Scheduling: A State-of-Art Survey

Optimizations in Project Scheduling: A State-of-Art Survey

Solving the Nonlinear Discrete Transportation Problem by Minlp Optimization

Minimization of direct costs in the construction of torrent control structures

Contact Info

Product

Resources

About