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 条
  • [21] Pinpointing the complexity of the interval min-max regret knapsack problem
    Deineko, Vladimir G.
    Woeginger, Gerhard J.
    DISCRETE OPTIMIZATION, 2010, 7 (04) : 191 - 196
  • [22] Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness
    Assayakh, Imad
    Kacem, Imed
    Lucarelli, Giorgio
    COMBINATORIAL ALGORITHMS, IWOCA 2023, 2023, 13889 : 49 - 61
  • [23] Min-max relative regret for scheduling to minimize maximum lateness
    Assayakh, Imad
    Kacem, Imed
    Lucarelli, Giorgio
    ANNALS OF OPERATIONS RESEARCH, 2024,
  • [24] Approximating min-max (regret) versions of some polynomial problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 428 - 438
  • [25] A MIN-MAX APPROACH TO RESERVOIR MANAGEMENT
    ORLOVSKI, S
    RINALDI, S
    SONCINISESSA, R
    WATER RESOURCES RESEARCH, 1984, 20 (11) : 1506 - 1514
  • [26] The bounds of min-max pair heap construction
    Chowdhury, RA
    Rahman, MZ
    Kaykobad, M
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2002, 43 (6-7) : 911 - 916
  • [27] The scenario based regret and Min-max regret approach for location-allocation model of distribution center, with uncertain parameters
    Bashiri, Mahdi
    Moslemi, Amir
    2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2011, : 1103 - 1107
  • [28] Min-Max Spaces and Complexity Reduction in Min-Max Expansions
    Gaubert, Stephane
    McEneaney, William M.
    APPLIED MATHEMATICS AND OPTIMIZATION, 2012, 65 (03): : 315 - 348
  • [29] A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem
    Godinho, Noe
    Paquete, Luis
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 69 - 81
  • [30] The interval min-max regret knapsack packing-delivery problem
    Wang, Shijin
    Cui, Wenli
    Chu, Feng
    Yu, Jianbo
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (18) : 5661 - 5677