A min-max regret approach to unbalanced bidding in construction

被引:17
|
作者
Afshar, Abbas [1 ]
Amiri, Helia [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Civil Engn Cent Excellence Fundamental Studi, Tehran 16844, Iran
关键词
unbalanced bidding; minimize maximum regret; minimize total regret;
D O I
10.1007/s12205-010-0972-0
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Unbalanced bidding is a method to benefit from uneven markup distribution among different items of project. As bidding process is applied for a project which is going to be done in future, most of parameters cannot be estimated accurately. Therefore, there are some uncertainties in bidding phase. Uncertainties in quantities of works play an important role for unit price determination in an unbalanced bidding model. Therefore, in this paper these uncertainties are considered, applying Minimize Maximum Regret (MMR) and Minimize Total Regret (MTR) approach in a discrete area where each scenario represents a set of possible quantities of works. Allocating interval scenario case for quantities of works seems to be more appropriate than discrete one. Thus, the unbalanced bidding model with interval quantities of works using MMR is proposed. To define manageable number of scenarios resulting from possible combinations of different unit prices in formulating the Min Max Regret (MMR) model as interval scenario case, a relaxation procedure is employed. In this approach, instead of considering all possible objective functions, a model which is called "Candidate Maximum Regret (CMR)" is applied to determine worst case scenarios. Models are applied to a hypothetical case example and the results are compared.
引用
收藏
页码:653 / 661
页数:9
相关论文
共 50 条
  • [31] Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem
    Furini, Fabio
    Iori, Manuel
    Martello, Silvano
    Yagiura, Mutsunori
    INFORMS JOURNAL ON COMPUTING, 2015, 27 (02) : 392 - 405
  • [32] Algorithms for the Min-max Regret Generalized Assignment Problem with Interval Data
    Wu, W.
    Iori, M.
    Martello, S.
    Yagiura, M.
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 734 - 738
  • [33] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
    Stephane Gaubert
    William M. McEneaney
    Applied Mathematics & Optimization, 2012, 65 : 315 - 348
  • [34] Robust min-max (regret) optimization using ordered weighted averaging
    Baak, Werner
    Goerigk, Marc
    Kasperski, Adam
    Zielinski, Pawel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 322 (01) : 171 - 181
  • [35] An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
    Wu, Wei
    Iori, Manuel
    Martello, Silvano
    Yagiura, Mutsunori
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (05) : 2523 - 2539
  • [36] A VISCOSITY METHOD FOR THE MIN-MAX CONSTRUCTION OF CLOSED GEODESICS
    Michelat, Alexis
    Riviere, Tristan
    ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS, 2016, 22 (04) : 1282 - 1324
  • [37] Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach
    Ng, K. K. H.
    Lee, C. K. M.
    Chan, Felix T. S.
    Qin, Yichen
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 106 : 115 - 136
  • [38] ON A MIN-MAX THEOREM
    CHEN FANGQI
    AppliedMathematics:AJournalofChineseUniversities(SeriesB), 1997, (03) : 43 - 48
  • [39] Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
    Wu, Wei
    Iori, Manuel
    Martello, Silvano
    Yagiura, Mutsunori
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 125 : 98 - 110
  • [40] Min-Max Propagation
    Srinivasa, Christopher
    Givoni, Inmar
    Ravanbakhsh, Siamak
    Frey, Brendan J.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30