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 条
  • [11] Robust min-max regret covering problems
    Amadeu A. Coco
    Andréa Cynthia Santos
    Thiago F. Noronha
    Computational Optimization and Applications, 2022, 83 : 111 - 141
  • [12] Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty
    T. Assavapokee
    M. J. Realff
    J. C. Ammons
    Journal of Optimization Theory and Applications, 2008, 137 : 297 - 316
  • [13] Min-max regret robust optimization approach on interval data uncertainty
    Assavapokee, T.
    Realff, M. J.
    Ammons, J. C.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2008, 137 (02) : 297 - 316
  • [14] Complexity of the min-max (regret) versions of min cut problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    DISCRETE OPTIMIZATION, 2008, 5 (01) : 66 - 73
  • [15] Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
    Assavapokee, Tiravat
    Realff, Matthew J.
    Ammons, Jane C.
    Hong, I-Hsuan
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (06) : 2093 - 2102
  • [16] Complexity of the min-max (regret) versions of cut problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 789 - 798
  • [17] A min-max regret approach to maximum likelihood inference under incomplete data
    Guillaume, Romain
    Dubois, Didier
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 121 : 135 - 149
  • [18] Approximating the min-max (regret) selecting items problem
    Kasperski, Adam
    Kurpisz, Adam
    Zielinski, Pawel
    INFORMATION PROCESSING LETTERS, 2013, 113 (1-2) : 23 - 29
  • [19] An Iterated Dual Substitution Approach for the Min-Max Regret Multidimensional Knapsack Problem
    Wu, W.
    Iori, M.
    Martello, S.
    Yagiura, M.
    2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 726 - 730
  • [20] Climate policies under climate model uncertainty: Max-min and min-max regret
    Rezai, Armon
    van der Ploeg, Frederick
    ENERGY ECONOMICS, 2017, 68 : 4 - 16