Abstract
Consider a marketplace operated by a buyer who wishes to procure large quantities of several heterogeneous products. Suppliers submit price curves for each of the commodities indicating the price charged as a function of the supplied quantity. The total amount paid to a supplier is the sum of the prices charged for the individual commodities. It is assumed that the submitted supply curves are piecewise linear as they often are in practice. The bid evaluation problem faced by the procurer is to determine how much of each commodity to buy from each of the suppliers so as to minimize the total purchase price. In addition to meeting the demand, the buyer may impose additional business requirements that restrict which contracts suppliers may be awarded. These requirements may result in interdependencies between the commodities which lead to suboptimal results if the commodities are traded in independent auctions rather than simultaneously. Even without the additional business constraints the bid evaluation problem is NP-hard. The main contribution of our study is a flexible column generation based heuristics that provides near-optimal solutions to the procurer’s bid evaluation problem. Our method scales very well due to the Branch-and-Price technology it is built on. We employ sophisticated rounding and local improvement heuristics to obtain quality solutions. We also developed a test data generator that produces realistic problems and allows control over the difficulty level of the problems using parameters.
Similar content being viewed by others
References
Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance. (1998). “Branch-and-Price: Column Generation for Huge Integer Programs.” Operations Research 46(3), 316–329.
“COIN-OR: Common Optimization Interface for Operations Research,” http://www.coin-or.org.
Davenport, A. and J. Kalagnanam. (2002). “Price negotiations for procurement of direct inputs.” Brenda Dietrich and Rakesh V. Vohra, eds., In Proceedings of the IMA Workshop Mathematics of the Internet: e-Auctions and Markets. Springers, New York City, NY.
De Vries, S. and R. Vohra. (2003). “Combinatorial Auctions: A Survey.” INFORMS Journal on Computing 15(3), 284–309.
(2001). “B2B Exchanges: Time to Rebuild.” The Economist, 55–56.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman.
ILOG. (1999). ILOG CPLEX 6.5 User’s Manual.
Ladanyi, L., J.J. Forrest, and J. Kalagnanam. (2001). “A Column Generation Approach to the Multiple Knapsack Problem with Color Contraints.” IBM Research Report RC 22013.
Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. New York: John Wiley & Sons.
Mehlhorn, K. and S. Näher. (1999) LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press.
Sandholm, T. and S. Suri. (2001). “Market Clearability. IJCAI-01.” In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Seattle, Washington, pp. 1145–1151.
Savelsbergh, M.W.P. (1997). “A Branch-and-Price Algorithm for the Generalized Assignment Problem.” Operations Research 45, 831–841.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eso, M., Ghosh, S., Kalagnanam, J. et al. Bid Evaluation in Procurement Auctions with Piecewise Linear Supply Curves. J Heuristics 11, 147–173 (2005). https://doi.org/10.1007/s10732-005-0389-y
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-005-0389-y