Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Multi-period resource allocation for estimating project costs in competitive bidding

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In competitive bidding for project contracts, contractors estimate the cost of completing a project and then determine the bid price. Accordingly, the bid price is markedly affected by the inaccuracies in the estimated cost. To establish a profit-making strategy in competitive bidding, it is crucial for contractors to estimate project costs accurately. Although allocating a large amount of resources to cost estimates allows contractors to prepare more accurate estimates, there is usually a limit to available resources in practice. To the best of our knowledge, however, none of the existing studies have addressed the resource allocation problem for estimating project costs in competitive bidding. To maximize a contractor’s expected profit, this paper develops a multi-period resource allocation method for estimating project costs in a sequential competitive bidding situation. Our resource allocation model is posed as a mixed integer linear programming problem by making piecewise linear approximations of the expected profit functions. Numerical experiments examine the characteristics of the optimal resource allocation and demonstrate the effectiveness of our resource allocation method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Beale EML, Tomlin JA (1970) Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Proceedings of the 5th international conference on operations research, pp 447–454

  • Beloglazov A, Abawajy J, Buyya R (2012) Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing. Future Gen Comput Syst 28:755–768

    Article  Google Scholar 

  • Bretthauer KM, Shetty B, Syam S, Vokurka RJ (2006) Production and inventory management under multiple resource constraints. Math Comput Model 44:85–95

    Article  Google Scholar 

  • Carr PG (2005) Investigation of bid price competition measured through prebid project estimates, actual bid prices, and number of bidders. J Constr Eng Manag 131:1165–1172

    Article  Google Scholar 

  • Chen CM, Zhu J (2011) Efficient resource allocation via efficiency bootstraps: an application to R&D project budgeting. Oper Res 59:729–741

    Article  Google Scholar 

  • Christensen P, Dysert LR (1997) Cost estimate classification system. In: AACE international recommended practice 17R–97

  • Engelbrecht-Wiggans R (1980) Auctions and bidding models: a survey. Manag Sci 26:119–142

    Article  Google Scholar 

  • Faniran OO, Love PE, Li H (1999) Optimal allocation of construction planning resources. J Constr Eng Manag 125:311–319

    Article  Google Scholar 

  • Fischer M, Albers S, Wagner N, Frie M (2011) Dynamic marketing budget allocation across countries, products, and marketing activities. Mark Sci 30:568–585

    Article  Google Scholar 

  • Friedman L (1956) A competitive-bidding strategy. Oper Res 4:104–112

    Article  Google Scholar 

  • Heidenberger K, Stummer C (1999) Research and development project selection and resource allocation: a review of quantitative modelling approaches. Int J Manag Rev 1:197–224

    Article  Google Scholar 

  • Ibaraki T, Katoh N (1988) Resource allocation problems: algorithmic approaches. MIT Press, Cambridge

    Google Scholar 

  • Ishii N, Takano Y, Muraki M (2014) An order acceptance strategy under limited engineering man-hours for cost estimation in engineering-procurement-construction projects. Int J Proj Manag 32:519–528

    Article  Google Scholar 

  • Ishii N, Takano Y, Muraki M (2015) A heuristic bidding price decision algorithm based on cost estimation accuracy under limited engineering man-hours in EPC projects. In: Obaidat MS, Koziel S, Kacprzyk J, Leifsson L, Ören T (eds) Simulation and modeling methodologies, technologies and applications. Springer, Cham, pp 101–118

    Google Scholar 

  • Karande C, Mehta A, Srikant R (2013) Optimizing budget constrained spend in search advertising. In: Proceedings of the 6th ACM international conference on web wearch and data mining, pp 697–706

  • Katoh N, Shioura A, Ibaraki T (2013) Resource allocation problems. In: Pardalos P, Du D-Z, Graham RL (eds) Handbook of combinatorial optimization, 2nd edn. Springer, New York, pp 2897–2988

    Chapter  Google Scholar 

  • King M, Mercer A (1988) Recurrent competitive bidding. Eur J Oper Res 33:2–16

    Article  Google Scholar 

  • King M, Mercer A (1990) The optimum markup when bidding with uncertain costs. Eur J Oper Res 47:348–363

    Article  Google Scholar 

  • Li H, Womer K (2006) Project scheduling in decision-theoretic competitive bidding. In: Proceedings of the 2006 IEEE congress on evolutionary computation, pp 3042–3049

  • Naert PA, Weverbergh M (1978) Cost uncertainty in competitive bidding models. J Oper Res Soc 29:361–372

    Article  Google Scholar 

  • Patriksson M (2008) A survey on the continuous nonlinear resource allocation problem. Eur J Oper Res 185:1–46

    Article  Google Scholar 

  • Rothkopf MH, Harstad RM (1994) Modeling competitive bidding: a critical essay. Manag Sci 40:364–384

    Article  Google Scholar 

  • Sato T, Hirao M (2013) Optimum budget allocation method for projects with critical risks. Int J Proj Manag 31:126–135

    Article  Google Scholar 

  • Soma T, Kakimura N, Inaba K, Kawarabayashi K (2014) Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of the 31st international conference on machine learning, pp 351–359

  • Stark RM, Rothkopf MH (1979) Competitive bidding: a comprehensive bibliography. Oper Res 27:364–390

    Article  Google Scholar 

  • Takano Y, Ishii N, Muraki M (2014) A sequential competitive bidding strategy considering inaccurate cost estimates. Omega 42:132–140

    Article  Google Scholar 

  • Takano Y, Nanjo K, Sukegawa N, Mizuno S (2015) Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs. Comput Manag Sci 12:319–340

    Article  Google Scholar 

  • Taylor BW III, Moore LJ, Clayton ER (1982) R&D project selection and manpower allocation with integer nonlinear goal programming. Manag Sci 28:1149–1158

    Article  Google Scholar 

  • Towler G, Sinnott RK (2012) Chemical engineering design, 2nd edn. Butterworth-Heinemann, Waltham

    Google Scholar 

  • Venkatesan R, Kumar V (2004) A customer lifetime value framework for customer selection and resource allocation strategy. J Mark 68:106–125

    Article  Google Scholar 

  • Ventura JA, Klein CM (1988) A note on multi-item inventory systems with limited capacity. Oper Res Lett 7:71–75

    Article  Google Scholar 

  • Wei G, Vasilakos AV, Zheng Y, Xiong N (2010) A game-theoretic method of fair resource allocation for cloud computing services. J Supercomput 54:252–269

    Article  Google Scholar 

  • Xiao Z, Song W, Chen Q (2013) Dynamic resource allocation using virtual machines for cloud computing environment. IEEE Trans Parallel Distrib Syst 24:1107–1117

    Article  Google Scholar 

  • Yang Y, Zhang J, Qin R, Li J, Wang FY, Qi W (2012) A budget optimization framework for search advertisements across markets. IEEE Trans Syst Man Cybern A Syst Hum 42:1141–1151

    Article  Google Scholar 

  • Zhang W, Zhang Y, Gao B, Yu Y, Yuan K, Liu TY (2012) Joint optimization of bid and budget allocation in sponsored search. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1177–1185

  • Ziegler H (1982) Solving certain singly constrained convex optimization problems in production planning. Oper Res Lett 1:246–252

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by Grant-in-Aid for Scientific Research (C) 25350455 by the Japan Society for the Promotion of Science.

Author information

Authors and Affiliations

  1. School of Network and Information, Senshu University, 2-1-1 Higashimita, Tama-ku, Kawasaki-shi, Kanagawa, 214-8580, Japan

    Yuichi Takano

  2. Faculty of Information and Communications, Bunkyo University, 1100 Namegaya, Chigasaki-shi, Kanagawa, 253-8550, Japan

    Nobuaki Ishii

  3. Department of Industrial Engineering and Management, Tokyo Institute of Technology, 2-12-1-W9-73 Ookayama, Meguro-ku, Tokyo, 152-8552, Japan

    Masaaki Muraki

Authors
  1. Yuichi Takano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nobuaki Ishii
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masaaki Muraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuichi Takano.

Appendix: Probability of winning

Appendix: Probability of winning

The function \({\mathcal {P}}_i\), i.e., the probability of winning a contract i is necessary to calculate the expected profit (1). By following Takano et al. (2014), this “Appendix” describes the formula for computing the probability of winning derived by Friedman (1956), who assumes that the number of competitors follows a Poisson distribution and their bid prices follow identical gamma distributions.

Let us suppose that the bid prices of the competitors for contract i have the same probability density function:

$$\begin{aligned} {\mathcal {F}}_i(y) = y^{\kappa _i - 1}\frac{\exp (-y/\theta _i)}{(\kappa _i - 1)!\,\theta _i^{\kappa _i}},~y \ge 0, \end{aligned}$$
(12)

where y is the bid price, \(\kappa _i\,(\ge \)1) is a shape parameter, and \(\theta _i\,(>\)0) is a scale parameter. The mean and variance of the gamma distribution (12) are \(\kappa _i \theta _i\) and \(\kappa _i \theta _i^2\), respectively. Moreover, suppose that the number of competitors who bid for contract i has the following probability mass function:

$$\begin{aligned} {\mathcal {G}}_i(k) = \frac{\lambda _i^k}{k !}\exp (-\lambda _i),~k=0,1,2,\ldots , \end{aligned}$$
(13)

where k is the number of competitors who bid for contract i, and \(\lambda _i\,(>\)0) is a parameter which represents both the mean and variance of the Poisson distribution (13). It then follows from Friedman (1956) that

$$\begin{aligned} {\mathcal {P}}_i [b]= & {} \sum \limits _{k=0}^{\infty } {\mathcal {G}}_i(k) \left( \int _{b}^{\infty } {\mathcal {F}}_i(y)\,\text{ d }y \right) ^{k}\nonumber \\= & {} \exp \left( -\lambda _i \left( 1 - \exp \left( - \frac{b}{\theta _i} \right) \sum \limits _{\ell =0}^{\kappa _i - 1} \frac{1}{\ell !} \left( \frac{b}{\theta _i} \right) ^{\ell } \right) \right) , \end{aligned}$$
(14)

where b is a contractor’s bid price.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Takano, Y., Ishii, N. & Muraki, M. Multi-period resource allocation for estimating project costs in competitive bidding. Cent Eur J Oper Res 25, 303–323 (2017). https://doi.org/10.1007/s10100-016-0438-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-016-0438-7

Keywords

Search

Navigation