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

A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables

Author

Listed:
  • Deb, Kalyanmoy
  • Myburgh, Christie

Abstract

Among various complexities affecting the performance of an optimization algorithm, the search space dimension is a major factor. Another key complexity is the discreteness of the search space. When these two complexities are present in a single problem, optimization algorithms have been demonstrated to be inefficient, even in linear programming (LP) problems. In this paper, we consider a specific resource allocation problem constituting to an integer linear programming (ILP) problem which, although comes from a specific industry, is similar to other practical resource allocation and assignment problems. Based on a population based optimization approach, we present a computationally fast method to arrive at a near-optimal solution. Compared to two popular softwares (glpk,Makhorin, 2012 and CPLEX,Gay, 2015), which are not able to handle around 300 and 2000 integer variables while continuing to run for hours, respectively, our proposed method is able to find a near-optimal solution in less than second on the same computer. Moreover, the main highlight of this study is to propose a customized population based optimization algorithm that scales in almost a linear computational complexity in handling 50,000 to one billion (109) variables. We believe that this is the first time such a large-sized real-world constrained problem is ever handled using any optimization algorithm. We perform sensitivity studies of our method for different problem parameters and these studies clearly demonstrate the reasons for such a fast and scale-up application of the proposed method.

Suggested Citation

  • Deb, Kalyanmoy & Myburgh, Christie, 2017. "A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables," European Journal of Operational Research, Elsevier, vol. 261(2), pages 460-474.
    • Handle: RePEc:eee:ejores:v:261:y:2017:i:2:p:460-474
    DOI: 10.1016/j.ejor.2017.02.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717301212
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.02.015?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. Richard Bellman, 1954. "Some Applications of the Theory of Dynamic Programming---A Review," Operations Research, INFORMS, vol. 2(3), pages 275-288, August.
    2. Stelios H. Zanakis & James R. Evans, 1981. "Heuristic “Optimization”: Why, When, and How to Use It," Interfaces, INFORMS, vol. 11(5), pages 84-91, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andrea Ferigo & Giovanni Iacca, 2020. "A GPU-Enabled Compact Genetic Algorithm for Very Large-Scale Optimization Problems," Mathematics, MDPI, vol. 8(5), pages 1-26, May.
    2. Andrea Ponti & Antonio Candelieri & Ilaria Giordani & Francesco Archetti, 2023. "Intrusion Detection in Networks by Wasserstein Enabled Many-Objective Evolutionary Algorithms," Mathematics, MDPI, vol. 11(10), pages 1-14, May.
    3. Maskooki, Alaleh & Deb, Kalyanmoy & Kallio, Markku, 2022. "A customized genetic algorithm for bi-objective routing in a dynamic network," European Journal of Operational Research, Elsevier, vol. 297(2), pages 615-629.

    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. Xiaoyue Li & John M. Mulvey, 2023. "Optimal Portfolio Execution in a Regime-switching Market with Non-linear Impact Costs: Combining Dynamic Program and Neural Network," Papers 2306.08809, arXiv.org.
    2. Mahmoud Mahfouz & Angelos Filos & Cyrine Chtourou & Joshua Lockhart & Samuel Assefa & Manuela Veloso & Danilo Mandic & Tucker Balch, 2019. "On the Importance of Opponent Modeling in Auction Markets," Papers 1911.12816, arXiv.org.
    3. Boute, Robert N. & Gijsbrechts, Joren & van Jaarsveld, Willem & Vanvuchelen, Nathalie, 2022. "Deep reinforcement learning for inventory control: A roadmap," European Journal of Operational Research, Elsevier, vol. 298(2), pages 401-412.
    4. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    5. Dawei Chen & Fangxu Mo & Ye Chen & Jun Zhang & Xinyu You, 2022. "Optimization of Ramp Locations along Freeways: A Dynamic Programming Approach," Sustainability, MDPI, vol. 14(15), pages 1-13, August.
    6. Manfred Gilli & Enrico Schumann, 2012. "Heuristic optimisation in financial modelling," Annals of Operations Research, Springer, vol. 193(1), pages 129-158, March.
    7. Contreras, Mauricio & Pellicer, Rely & Villena, Marcelo, 2017. "Dynamic optimization and its relation to classical and quantum constrained systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 12-25.
    8. Harrold, Daniel J.B. & Cao, Jun & Fan, Zhong, 2022. "Data-driven battery operation for energy arbitrage using rainbow deep reinforcement learning," Energy, Elsevier, vol. 238(PC).
    9. T. D. Pol & S. Gabbert & H.-P. Weikard & E. C. Ierland & E. M. T. Hendrix, 2017. "A Minimax Regret Analysis of Flood Risk Management Strategies Under Climate Change Uncertainty and Emerging Information," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 68(4), pages 1087-1109, December.
    10. Bartłomiej Kocot & Paweł Czarnul & Jerzy Proficz, 2023. "Energy-Aware Scheduling for High-Performance Computing Systems: A Survey," Energies, MDPI, vol. 16(2), pages 1-28, January.
    11. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2021. "A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm," Mathematics, MDPI, vol. 9(13), pages 1-44, July.
    12. Wojdyła, Tomasz & Kimmel, Marek & Bobrowski, Adam, 2011. "Time to the MRCA of a sample in a Wright–Fisher model with variable population size," Theoretical Population Biology, Elsevier, vol. 80(4), pages 265-271.
    13. Peter Schober & Julian Valentin & Dirk Pflüger, 2022. "Solving High-Dimensional Dynamic Portfolio Choice Models with Hierarchical B-Splines on Sparse Grids," Computational Economics, Springer;Society for Computational Economics, vol. 59(1), pages 185-224, January.
    14. Matthias Breuer & David Windisch, 2019. "Investment Dynamics and Earnings‐Return Properties: A Structural Approach," Journal of Accounting Research, Wiley Blackwell, vol. 57(3), pages 639-674, June.
    15. Rodríguez, Beatriz & Molina, Julián & Pérez, Fátima & Caballero, Rafael, 2012. "Interactive design of personalised tourism routes," Tourism Management, Elsevier, vol. 33(4), pages 926-940.
    16. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    17. Michael J. Pennock & William B. Rouse & Diane L. Kollar, 2007. "Transforming the Acquisition Enterprise: A Framework for Analysis and a Case Study of Ship Acquisition," Systems Engineering, John Wiley & Sons, vol. 10(2), pages 99-117, June.
    18. Quetschlich, Mathias & Moetz, André & Otto, Boris, 2021. "Optimisation model for multi-item multi-echelon supply chains with nested multi-level products," European Journal of Operational Research, Elsevier, vol. 290(1), pages 144-158.
    19. Iman Ahmadianfar & Saeed Noshadian & Nadir Ahmed Elagib & Meysam Salarijazi, 2021. "Robust Diversity-based Sine-Cosine Algorithm for Optimizing Hydropower Multi-reservoir Systems," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 35(11), pages 3513-3538, September.
    20. Li, Yapeng & Tang, Xiaolin & Lin, Xianke & Grzesiak, Lech & Hu, Xiaosong, 2022. "The role and application of convex modeling and optimization in electrified vehicles," Renewable and Sustainable Energy Reviews, Elsevier, vol. 153(C).

    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:261:y:2017:i:2:p:460-474. 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.