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

Central European Journal of Operations Research - Tập 25 - Trang 303-323 - 2016
Yuichi Takano1, Nobuaki Ishii2, Masaaki Muraki3
1School of Network and Information, Senshu University, Kawasaki-shi, Japan
2Faculty of Information and Communications, Bunkyo University, Chigasaki-shi, Japan
3Department of Industrial Engineering and Management, Tokyo Institute of Technology, Tokyo, Japan

Tóm tắt

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.

Tài liệu tham khảo

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 Bretthauer KM, Shetty B, Syam S, Vokurka RJ (2006) Production and inventory management under multiple resource constraints. Math Comput Model 44:85–95 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 Chen CM, Zhu J (2011) Efficient resource allocation via efficiency bootstraps: an application to R&D project budgeting. Oper Res 59:729–741 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 Faniran OO, Love PE, Li H (1999) Optimal allocation of construction planning resources. J Constr Eng Manag 125:311–319 Fischer M, Albers S, Wagner N, Frie M (2011) Dynamic marketing budget allocation across countries, products, and marketing activities. Mark Sci 30:568–585 Friedman L (1956) A competitive-bidding strategy. Oper Res 4:104–112 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 Ibaraki T, Katoh N (1988) Resource allocation problems: algorithmic approaches. MIT Press, Cambridge 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 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 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 King M, Mercer A (1988) Recurrent competitive bidding. Eur J Oper Res 33:2–16 King M, Mercer A (1990) The optimum markup when bidding with uncertain costs. Eur J Oper Res 47:348–363 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 Patriksson M (2008) A survey on the continuous nonlinear resource allocation problem. Eur J Oper Res 185:1–46 Rothkopf MH, Harstad RM (1994) Modeling competitive bidding: a critical essay. Manag Sci 40:364–384 Sato T, Hirao M (2013) Optimum budget allocation method for projects with critical risks. Int J Proj Manag 31:126–135 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 Takano Y, Ishii N, Muraki M (2014) A sequential competitive bidding strategy considering inaccurate cost estimates. Omega 42:132–140 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 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 Towler G, Sinnott RK (2012) Chemical engineering design, 2nd edn. Butterworth-Heinemann, Waltham Venkatesan R, Kumar V (2004) A customer lifetime value framework for customer selection and resource allocation strategy. J Mark 68:106–125 Ventura JA, Klein CM (1988) A note on multi-item inventory systems with limited capacity. Oper Res Lett 7:71–75 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 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 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 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