IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v306y2023i3p1170-1185.html
   My bibliography  Save this article

Resource allocation problems with expensive function evaluations

Author

Listed:
  • ten Eikelder, S.C.M.
  • van Amerongen, J.H.M.

Abstract

The resource allocation problem is among the classical problems in operations research, and has been studied extensively for decades. However, current solution approaches are not able to efficiently handle problems with expensive function evaluations, which can occur in a variety of applications. We study the integer resource allocation problem with expensive function evaluations, for both convex and non-convex separable cost functions. We present several solution methods, both heuristics and exact methods, that aim to limit the number of function evaluations. The methods are compared in numerical experiments using both randomly generated instances and instances from two resource allocation problems occurring in radiation therapy planning. Results show that the presented solution methods compare favorably against existing derivative free optimization solvers.

Suggested Citation

  • ten Eikelder, S.C.M. & van Amerongen, J.H.M., 2023. "Resource allocation problems with expensive function evaluations," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1170-1185.
    • Handle: RePEc:eee:ejores:v:306:y:2023:i:3:p:1170-1185
    DOI: 10.1016/j.ejor.2022.07.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172200618X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.07.048?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Brekelmans, Ruud & Driessen, Lonneke & Hamers, Herbert & den Hertog, Dick, 2005. "Constrained optimization involving expensive function evaluations: A sequential approach," European Journal of Operational Research, Elsevier, vol. 160(1), pages 121-138, January.
    2. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    3. Bernard O. Koopman, 1953. "The Optimum Distribution of Effort," Operations Research, INFORMS, vol. 1(2), pages 52-63, February.
    4. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    5. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    6. A. Y. D. Siem & D. den Hertog & A. L. Hoffmann, 2011. "A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 591-604, November.
    7. Carel Eijgenraam & Jarl Kind & Carlijn Bak & Ruud Brekelmans & Dick den Hertog & Matthijs Duits & Kees Roos & Pieter Vermeer & Wim Kuijken, 2014. "Economically Efficient Standards to Protect the Netherlands Against Flooding," Interfaces, INFORMS, vol. 44(1), pages 7-21, February.
    8. Jeffrey Larson & Sven Leyffer & Prashant Palkar & Stefan M. Wild, 2021. "A method for convex black-box integer global optimization," Journal of Global Optimization, Springer, vol. 80(2), pages 439-477, June.
    9. Lotty E. Duijzer & Willem L. van Jaarsveld & Jacco Wallinga & Rommert Dekker, 2018. "Dose†Optimal Vaccine Allocation over Multiple Populations," Production and Operations Management, Production and Operations Management Society, vol. 27(1), pages 143-159, January.
    10. Dorit Hochbaum, 2007. "Complexity and algorithms for nonlinear optimization problems," Annals of Operations Research, Springer, vol. 153(1), pages 257-296, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bueno, L.F. & Haeser, G. & Kolossoski, O., 2024. "On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1217-1222.
    2. Torrealba, E.M.R. & Silva, J.G. & Matioli, L.C. & Kolossoski, O. & Santos, P.S.M., 2022. "Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 46-59.
    3. Hoto, R.S.V. & Matioli, L.C. & Santos, P.S.M., 2020. "A penalty algorithm for solving convex separable knapsack problems," Applied Mathematics and Computation, Elsevier, vol. 387(C).
    4. Zeyang Wu & Kameng Nip & Qie He, 2021. "A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1197-1212, July.
    5. Jungho Park & Hadi El-Amine & Nevin Mutlu, 2021. "An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1213-1228, July.
    6. Sathaye, Nakul & Madanat, Samer, 2011. "A bottom-up solution for the multi-facility optimal pavement resurfacing problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1004-1017, August.
    7. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    8. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    9. Friedrich, Ulf & Münnich, Ralf & de Vries, Sven & Wagner, Matthias, 2015. "Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 92(C), pages 1-12.
    10. Chernonog, Tatyana & Goldberg, Noam, 2018. "On the multi-product newsvendor with bounded demand distributions," International Journal of Production Economics, Elsevier, vol. 203(C), pages 38-47.
    11. Thijs Klauw & Marco E. T. Gerards & Johann L. Hurink, 2017. "Resource allocation problems in decentralized energy management," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 749-773, July.
    12. Jamie Fravel & Robert Hildebrand & Laurel Travis, 2024. "Continuous Equality Knapsack with Probit-Style Objectives," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1060-1076, September.
    13. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    14. Hsin-Min Sun & Ruey-Lin Sheu, 2019. "Minimum variance allocation among constrained intervals," Journal of Global Optimization, Springer, vol. 74(1), pages 21-44, May.
    15. Marco E. T. Gerards & Johann L. Hurink, 2016. "Robust Peak-Shaving for a Neighborhood with Electric Vehicles," Energies, MDPI, vol. 9(8), pages 1-16, July.
    16. Weiyang Ding & Michael K. Ng & Wenxing Zhang, 2024. "A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression," Journal of Global Optimization, Springer, vol. 90(3), pages 727-753, November.
    17. Erdoğan, Güneş & Yücel, Eda & Kiavash, Parinaz & Salman, F. Sibel, 2024. "Fair and effective vaccine allocation during a pandemic," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    18. Tang, Lianhua & Li, Yantong & Bai, Danyu & Liu, Tao & Coelho, Leandro C., 2022. "Bi-objective optimization for a multi-period COVID-19 vaccination planning problem," Omega, Elsevier, vol. 110(C).
    19. Postek, Krzysztof & den Hertog, Dick & Kind, J. & Pustjens, Chris, 2016. "Adjustable Robust Strategies for Flood Protection," Discussion Paper 2016-038, Tilburg University, Center for Economic Research.
    20. Vahideh Sadat Abedi, 2017. "Allocation of advertising budget between multiple channels to support sales in multiple markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 134-146, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:306:y:2023:i:3:p:1170-1185. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.