메뉴 건너뛰기




Volumn 48, Issue 1, 2012, Pages 6-16

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

Author keywords

Cost optimization; Mixed integer nonlinear programming (MINLP); Project management; Scheduling; Time cost trade off problem

Indexed keywords

COMMERCE; COSTS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; PROJECT MANAGEMENT; SCHEDULING;

EID: 84856998695     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2012.01.006     Document Type: Article
Times cited : (19)

References (51)
  • 1
    • 84963641565 scopus 로고
    • Prozesssynchrone kosten- und terminplanung von bauprojekten
    • M. Pšunder, and D. Rebolj Prozesssynchrone kosten- und terminplanung von bauprojekten Wirtschaftsingenieur 23 3 1991 22 25
    • (1991) Wirtschaftsingenieur , vol.23 , Issue.3 , pp. 22-25
    • Pšunder, M.1    Rebolj, D.2
  • 3
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
    • (1983) Science , vol.220 , Issue.4598 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 4
    • 84989487658 scopus 로고
    • Heuristic for integer programming using surrogate constraints
    • F. Glover Heuristic for integer programming using surrogate constraints Decis Sci 8 1 1977 156 166
    • (1977) Decis Sci , vol.8 , Issue.1 , pp. 156-166
    • Glover, F.1
  • 5
    • 0022471098 scopus 로고
    • Learning representations by backpropagating errors
    • D.E. Rumelhart, G.E. Hinton, and R.J. Williams Learning representations by backpropagating errors Nature 323 1986 533 536
    • (1986) Nature , vol.323 , pp. 533-536
    • Rumelhart, D.E.1    Hinton, G.E.2    Williams, R.J.3
  • 8
    • 0031185451 scopus 로고    scopus 로고
    • Using genetic algorithms to solve construction time-cost trade-off problems
    • C.W. Feng, L. Liu, and S.A. Burns Using genetic algorithms to solve construction time-cost trade-off problems J Comput Civil Eng 11 3 1997 184 189 (Pubitemid 127590539)
    • (1997) Journal of Computing in Civil Engineering , vol.11 , Issue.3 , pp. 184-189
    • Feng, C.-W.1    Liu, L.2    Burns, S.A.3
  • 9
    • 0032638332 scopus 로고    scopus 로고
    • Using machine learning and genetic algorithms to solve time-cost trade-off problems
    • H. Li, J.N. Cao, and P.E.D. Love Using machine learning and genetic algorithms to solve time-cost trade-off problems J Constr Eng Manage 125 5 1999 347 353
    • (1999) J Constr Eng Manage , vol.125 , Issue.5 , pp. 347-353
    • Li, H.1    Cao, J.N.2    Love, P.E.D.3
  • 10
    • 0033497302 scopus 로고    scopus 로고
    • Optimization of construction time-cost trade-off analysis using genetic algorithms
    • T. Hegazy Optimization of construction time-cost trade-off analysis using genetic algorithms Can J Civ Eng 26 6 1999 685 697 (Pubitemid 30192514)
    • (1999) Canadian Journal of Civil Engineering , vol.26 , Issue.6 , pp. 685-697
    • Hegazy, T.1
  • 11
    • 0033312040 scopus 로고    scopus 로고
    • GA-based multicriteria optimal model for construction scheduling
    • S.S. Leu, and C.H. Yang GA-based multicriteria optimal model for construction scheduling J Constr Eng Manage 125 6 1999 420 427
    • (1999) J Constr Eng Manage , vol.125 , Issue.6 , pp. 420-427
    • Leu, S.S.1    Yang, C.H.2
  • 12
    • 0030571697 scopus 로고    scopus 로고
    • Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm
    • DOI 10.1016/0377-2217(94)00158-8
    • A. Shtub, L.J. LeBlanc, and Z. Cai Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm Eur J Oper Res 88 1 1996 124 138 (Pubitemid 126367097)
    • (1996) European Journal of Operational Research , vol.88 , Issue.1 , pp. 124-138
    • Shtub, A.1    LeBlanc, L.J.2    Cai, Z.3
  • 13
    • 34247346538 scopus 로고    scopus 로고
    • A discrete-time approximation technique for the time-cost trade-off in pert networks
    • DOI 10.1051/ro:2007005
    • A. Azaron, M. Sakawa, R. Tavakkoli-Moghaddam, and N. Safaei A discrete-time approximation technique for the time-cost trade-off in PERT networks RAIRO Oper Res 41 1 2007 61 81 (Pubitemid 46644968)
    • (2007) RAIRO - Operations Research , vol.41 , Issue.1 , pp. 61-81
    • Azaron, A.1    Sakawa, M.2    Tavakkoli-Moghaddam, R.3    Safaei, N.4
  • 14
    • 0036707047 scopus 로고    scopus 로고
    • Minimisation of availability cost for project resources under time constraint by adaptation of tabu search method
    • M. Gagnon, G. D'Avignon, and F. Boctor Minimisation of availability cost for project resources under time constraint by adaptation of tabu search method INFOR 40 3 2002 277 304
    • (2002) INFOR , vol.40 , Issue.3 , pp. 277-304
    • Gagnon, M.1    D'Avignon, G.2    Boctor, F.3
  • 15
    • 0000191706 scopus 로고    scopus 로고
    • Scheduling/cost optimization and neural dynamics model for construction
    • H. Adeli, and A. Karim Scheduling/cost optimization and neural dynamics model for construction J Constr Eng Manage 123 4 1997 450 458 (Pubitemid 127590588)
    • (1997) Journal of Construction Engineering and Management , vol.123 , Issue.4 , pp. 450-458
    • Adeli, H.1    Karim, A.2
  • 16
    • 38149009704 scopus 로고    scopus 로고
    • Applying an ant colony optimization algorithm-based multiobjective approach for time-cost trade-off
    • Y. Xiong, and Y. Kuang Applying an ant colony optimization algorithm-based multiobjective approach for time-cost trade-off J Constr Eng Manage 134 2 2008 153 156
    • (2008) J Constr Eng Manage , vol.134 , Issue.2 , pp. 153-156
    • Xiong, Y.1    Kuang, Y.2
  • 17
    • 34250644399 scopus 로고    scopus 로고
    • Using elitist particle swarm optimization to facilitate bicriterion time-cost trade-off analysis
    • I.T. Yang Using elitist particle swarm optimization to facilitate bicriterion time-cost trade-off analysis J Constr Eng Manage 133 7 2007 498 505
    • (2007) J Constr Eng Manage , vol.133 , Issue.7 , pp. 498-505
    • Yang, I.T.1
  • 21
    • 0001173632 scopus 로고
    • An automatic method of solving discrete programming problems
    • A.H. Land, and A. Doig An automatic method of solving discrete programming problems Econom 28 3 1960 297 520
    • (1960) Econom , vol.28 , Issue.3 , pp. 297-520
    • Land, A.H.1    Doig, A.2
  • 22
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numer Math 4 3 1962 238 252
    • (1962) Numer Math , vol.4 , Issue.3 , pp. 238-252
    • Benders, J.F.1
  • 23
    • 0001620447 scopus 로고
    • Critical path planning and scheduling: Mathematical basis
    • J.E. Kelley Critical path planning and scheduling: mathematical basis Oper Res 9 1961 296 320
    • (1961) Oper Res , vol.9 , pp. 296-320
    • Kelley, J.E.1
  • 24
    • 0000181338 scopus 로고
    • A network flow computation for project curves
    • D. Fulkerson A network flow computation for project curves Manage Sci 7 1961 167 178
    • (1961) Manage Sci , vol.7 , pp. 167-178
    • Fulkerson, D.1
  • 25
    • 0015725441 scopus 로고
    • An algorithm for project cost-duration analysis problems with quadratic and convex cost functions
    • K.C. Kapur An algorithm for project cost-duration analysis problems with quadratic and convex cost functions AIIE Trans 5 4 1973 314 322
    • (1973) AIIE Trans , vol.5 , Issue.4 , pp. 314-322
    • Kapur, K.C.1
  • 28
    • 0038909956 scopus 로고
    • Extending CPM for multiform project time-cost curves
    • W.L. Meyer, and R.L. Shaffer Extending CPM for multiform project time-cost curves J Constr Div 91 1965 45 65
    • (1965) J Constr Div , vol.91 , pp. 45-65
    • Meyer, W.L.1    Shaffer, R.L.2
  • 29
    • 0001267414 scopus 로고
    • Decision CPM: A method for simultaneous planning, scheduling, and control of projects
    • W. Crowston, and G.L. Thompson Decision CPM: a method for simultaneous planning, scheduling, and control of projects Oper Res 15 1967 407 426
    • (1967) Oper Res , vol.15 , pp. 407-426
    • Crowston, W.1    Thompson, G.L.2
  • 30
    • 0014928334 scopus 로고
    • Decision CPM: Network reduction and solution
    • W. Crowston Decision CPM: network reduction and solution Oper Res Q 21 4 1970 435 452
    • (1970) Oper Res Q , vol.21 , Issue.4 , pp. 435-452
    • Crowston, W.1
  • 31
    • 0035742360 scopus 로고    scopus 로고
    • Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm
    • DOI 10.1023/A:1016046625583
    • N.R. Achuthan, and A. Hardjawidjaja Project scheduling under time dependent costs - a branch and bound algorithm Ann Oper Res 108 2001 55 74 (Pubitemid 33640261)
    • (2001) Annals of Operations Research , vol.108 , Issue.1-4 , pp. 55-74
    • Achuthan, N.R.1    Hardjawidjaja, A.2
  • 32
    • 7544238250 scopus 로고    scopus 로고
    • Project time-cost analysis under generalised precedence relations
    • S. Sakellaropoulos, and A.P. Chassiakos Project time-cost analysis under generalised precedence relations Adv Eng Softw 35 10-11 2004 715 724
    • (2004) Adv Eng Softw , vol.35 , Issue.1011 , pp. 715-724
    • Sakellaropoulos, S.1    Chassiakos, A.P.2
  • 33
    • 13444280108 scopus 로고    scopus 로고
    • New computational results for the discrete time/cost trade-off problem with time-switch constraints
    • DOI 10.1016/j.ejor.2004.04.007, PII S0377221704002450, Project Management and Scheduling
    • M. Vanhoucke New computational results for discrete time-cost trade-off problem with time-switch constraints Eur J Oper Res 165 2 2005 359 374 (Pubitemid 40206367)
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 359-374
    • Vanhoucke, M.1
  • 34
    • 13444270579 scopus 로고    scopus 로고
    • Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
    • DOI 10.1016/j.ejor.2004.04.006, PII S0377221704002449, Project Management and Scheduling
    • C. Akkan, A. Drexl, and A. Kimms Network decomposition-based benchmark results for the discrete time-cost trade-off problem Eur J Oper Res 165 2 2005 339 358 (Pubitemid 40206366)
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 339-358
    • Akkan, C.1    Drexl, A.2    Kimms, A.3
  • 36
    • 22544470279 scopus 로고    scopus 로고
    • The multilevel MINLP optimization approach to structural synthesis: The simultaneous topology, material, standard and rounded dimension optimization
    • DOI 10.1016/j.advengsoft.2005.03.004, PII S0965997805000426
    • S. Kravanja, S. Šilih, and Z. Kravanja The multilevel MINLP optimization approach to structural synthesis: the simultaneous topology, material, standard and rounded dimension optimization Adv Eng Softw 36 9 2005 568 583 (Pubitemid 41009674)
    • (2005) Advances in Engineering Software , vol.36 , Issue.9 , pp. 568-583
    • Kravanja, S.1    Silih, S.2    Kravanja, Z.3
  • 37
    • 0022208326 scopus 로고
    • Branch and bound experiments in convex nonlinear integer programming
    • O.K. Gupta, and A. Ravindran Branch and bound experiments in convex nonlinear integer programming Manage Sci 31 12 1985 1533 1546 (Pubitemid 16488951)
    • (1985) Management Science , vol.31 , Issue.12 , pp. 1533-1546
    • Gupta Omprakash, K.1    Ravindran, A.2
  • 38
    • 0024771323 scopus 로고
    • Method for nonlinear optimization with discrete design variables
    • G.R. Olsen, and G.N. Vanderplaats Method for nonlinear optimization with discrete design variables AIAA J 27 11 1989 1584 1589
    • (1989) AIAA J , vol.27 , Issue.11 , pp. 1584-1589
    • Olsen, G.R.1    Vanderplaats, G.N.2
  • 39
    • 0025626811 scopus 로고
    • Solution of mixed-discrete structural optimization problems with a new sequential linearization method
    • M. Bremicker, P.Y. Papalambros, and H.T. Loh Solution of mixed-discrete structural optimization problems with a new sequential linearization method Comput Struct 37 4 1990 451 461
    • (1990) Comput Struct , vol.37 , Issue.4 , pp. 451-461
    • Bremicker, M.1    Papalambros, P.Y.2    Loh, H.T.3
  • 41
    • 0015419856 scopus 로고
    • Generalized benders decomposition
    • A.M. Geoffrion Generalized benders decomposition J Optim Theory Appl 10 4 1972 237 260
    • (1972) J Optim Theory Appl , vol.10 , Issue.4 , pp. 237-260
    • Geoffrion, A.M.1
  • 42
    • 0022902024 scopus 로고
    • An outer-approximation algorithm for a class of mixed-integer nonlinear programs
    • M.A. Duran, and I.E. Grossmann An outer-approximation algorithm for a class of mixed-integer nonlinear programs Math Program 36 9 1986 307 339
    • (1986) Math Program , vol.36 , Issue.9 , pp. 307-339
    • Duran, M.A.1    Grossmann, I.E.2
  • 43
    • 0347923972 scopus 로고
    • Solving nonlinear integer programs with large-scale optimization software
    • H. Mawengkang, and B.A. Murtagh Solving nonlinear integer programs with large-scale optimization software Ann Oper Res 5 1-4 1986 425 437
    • (1986) Ann Oper Res , vol.5 , Issue.14 , pp. 425-437
    • Mawengkang, H.1    Murtagh, B.A.2
  • 44
    • 0026932968 scopus 로고
    • LP/NLP based branch and bound algorithm for convex MINLP optimization problems
    • DOI 10.1016/0098-1354(92)80028-8
    • I. Quesada, and I.E. Grossmann An LP/NLP based branch and bound algorithm for convex MINLP optimization problems Comput Chem Eng 16 10-11 1992 937 947 (Pubitemid 23602202)
    • (1992) Computers and Chemical Engineering , vol.16 , Issue.10-11 , pp. 937-947
    • Quesada, I.1    Grossmann, I.E.2
  • 45
    • 0000635160 scopus 로고    scopus 로고
    • Branch-and-reduce approach to global optimization
    • H.S. Ryoo, and N.V. Sahinidis Branch-and-reduce approach to global optimization J Glob Optim 8 2 1996 107 138
    • (1996) J Glob Optim , vol.8 , Issue.2 , pp. 107-138
    • Ryoo, H.S.1    Sahinidis, N.V.2
  • 46
    • 30844443284 scopus 로고    scopus 로고
    • Cost estimation, optimization and competitiveness of different composite floor systems-Part 1: Self-manufacturing cost estimation of composite and steel structures
    • DOI 10.1016/j.jcsr.2005.08.005, PII S0143974X05001550
    • U. Klanšek, and S. Kravanja Cost estimation, optimization and competitiveness of different composite floor systems - part 1: self-manufacturing cost estimation of composite and steel structures J Constr Steel Res 62 5 2006 434 448 (Pubitemid 43106669)
    • (2006) Journal of Constructional Steel Research , vol.62 , Issue.5 , pp. 434-448
    • Klansek, U.1    Kravanja, S.2
  • 48
    • 0025459923 scopus 로고
    • A combined penalty function and outer approximation method for MINLP optimization
    • J. Viswanathan, and I.E. Grossmann A combined penalty function and outer approximation method for MINLP optimization Comput Chem Eng 14 7 1990 769 782
    • (1990) Comput Chem Eng , vol.14 , Issue.7 , pp. 769-782
    • Viswanathan, J.1    Grossmann, I.E.2
  • 49
    • 0000930401 scopus 로고
    • CONOPT - A large-scale GRG code
    • A.S. Drudd CONOPT - a large-scale GRG code ORSA J Comput 6 2 1994 207 216
    • (1994) ORSA J Comput , vol.6 , Issue.2 , pp. 207-216
    • Drudd, A.S.1
  • 51
    • 36148934921 scopus 로고    scopus 로고
    • MINLP optimization of steel frames
    • Brebbia CA, editor Ostende, Belgium High performance structures and materials III, (WIT transactions on the built environment, vol. 85). Southampton, UK; Boston: Wessex Institute of Technology Press; Billerica, MA: Computational Mechanics; 2006. p. 605-13.
    • Kravanja S, Klanšek U. MINLP optimization of steel frames. In: Brebbia CA, editor. Third international conference on high performance structures and materials, Ostende, Belgium, 2006. High performance structures and materials III, (WIT transactions on the built environment, vol. 85). Southampton, UK; Boston: Wessex Institute of Technology Press; Billerica, MA: Computational Mechanics; 2006. p. 605-13.
    • (2006) Third International Conference on High Performance Structures and Materials
    • Kravanja S, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.