A min-max regret approach to unbalanced bidding in construction

被引:0
|
作者
Abbas Afshar
Helia Amiri
机构
[1] Iran University of Science and Technology,Dept. of Civil Engineering, Central Excellence for Fundamental Studies and Structural Mechanics
来源
关键词
unbalanced bidding; minimize maximum regret; minimize total regret;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:8
相关论文
共 50 条
  • [1] A min-max regret approach to unbalanced bidding in construction
    Afshar, Abbas
    Amiri, Helia
    [J]. KSCE JOURNAL OF CIVIL ENGINEERING, 2010, 14 (05) : 653 - 661
  • [2] Complexity of the min-max and min-max regret assignment problems
    Aissi, H
    Bazgan, C
    Vanderpooten, D
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 634 - 640
  • [3] Min-Max Regret Bidding Strategy for Thermal Generator Considering Price Uncertainty
    Fan, Lei
    Wang, Jianhui
    Jiang, Ruiwei
    Guan, Yongpei
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2014, 29 (05) : 2169 - 2179
  • [4] Min-max and min-max regret versions of combinatorial optimization problems: A survey
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
  • [5] Pseudo-polynomial algorithms for min-max and min-max regret problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    [J]. Operations Research and Its Applications, 2005, 5 : 171 - 178
  • [6] Min-max and min-max (relative) regret approaches to representatives selection problem
    Dolgui, Alexandre
    Kovalev, Sergey
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
  • [7] Energy crop supply in France:: a min-max regret approach
    Kazakci, A. O.
    Rozakis, S.
    Vanderpooten, D.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (11) : 1470 - 1479
  • [8] Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems
    Aissi H.
    [J]. 4OR, 2006, 4 (4) : 347 - 350
  • [9] Approximation of min-max and min-max regret versions of some combinatorial optimization problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 281 - 290
  • [10] Robust min-max regret covering problems
    Coco, Amadeu A.
    Santos, Andrea Cynthia
    Noronha, Thiago F.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (01) : 111 - 141