IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v23y2023i3d10.1007_s12351-023-00777-7.html
   My bibliography  Save this article

A heuristic method to find a quick feasible solution based on the ratio programming

Author

Listed:
  • M. N. Yarahmadi

    (Amirkabir University of Technology (Tehran Polytechnic))

  • S. A. MirHassani

    (Amirkabir University of Technology (Tehran Polytechnic))

  • F. Hooshmand

    (Amirkabir University of Technology (Tehran Polytechnic))

Abstract

The feasibility pump is a successful rounding-based heuristic to find a feasible solution to mixed-integer programming (MIP) problems. This paper presents a novel method to find a high-quality feasible solution to 0–1 MIPs in a reasonable time. This method is based on a ratio programming model, which we refer to as a feasible-finder model (FFM). It proves that the optimal solution to FFM is feasible for the original MIP problem. An efficient ratio programming method is adopted to solve FFM by solving a sequence of linear programming problems. Then, to improve the quality of the feasible solution, a quality-controlling cut is generated and added in each iteration. Computational results over instances of CORAL and MIPLIB confirm the effectiveness of our method.

Suggested Citation

  • M. N. Yarahmadi & S. A. MirHassani & F. Hooshmand, 2023. "A heuristic method to find a quick feasible solution based on the ratio programming," Operational Research, Springer, vol. 23(3), pages 1-19, September.
    • Handle: RePEc:spr:operea:v:23:y:2023:i:3:d:10.1007_s12351-023-00777-7
    DOI: 10.1007/s12351-023-00777-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-023-00777-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-023-00777-7?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2013. "A new class of functions for measuring solution integrality in the Feasibility Pump approach: Complete Results," DIAG Technical Reports 2013-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. H. P. Benson, 2010. "Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 1-18, July.
    3. YongJin Kim & YunChol Jong & JinWon Yu, 2021. "A parametric solution method for a generalized fractional programming problem," Indian Journal of Pure and Applied Mathematics, Springer, vol. 52(4), pages 971-989, December.
    4. X. Liu & Y.L. Gao & B. Zhang & F.P. Tian, 2019. "A New Global Optimization Algorithm for a Class of Linear Fractional Programming," Mathematics, MDPI, vol. 7(9), pages 1-21, September.
    5. Yuelin Gao & Siqiao Jin, 2013. "A Global Optimization Algorithm for Sum of Linear Ratios Problem," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-7, June.
    6. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
    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. Mohammad Nasir Yarahmadi & Seyed Ali MirHassani & Farnaz Hooshmand, 2025. "Fractional Programming-Based Heuristic: An Efficient Method for Marine Inventory Routing Problem," SN Operations Research Forum, Springer, vol. 6(2), pages 1-19, June.

    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. Jiao, Hongwei & Ma, Junqiao, 2022. "An efficient algorithm and complexity result for solving the sum of general affine ratios problem," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    2. Griset, Rodolphe & Bendotti, Pascale & Detienne, Boris & Porcheron, Marc & Şen, Halil & Vanderbeck, François, 2022. "Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1067-1083.
    3. Yaohua Hu & Carisa Kwok Wai Yu & Xiaoqi Yang, 2019. "Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions," Journal of Global Optimization, Springer, vol. 75(4), pages 1003-1028, December.
    4. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    5. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    6. Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang, 2022. "An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 830-855, March.
    7. Akbarzadeh, Babak & Maenhout, Broos, 2025. "A dedicated branch-price-and-cut algorithm for advance patient planning and surgeon scheduling," European Journal of Operational Research, Elsevier, vol. 322(2), pages 448-466.
    8. Tonbari, Mohamed El & Ahmed, Shabbir, 2023. "Consensus-based Dantzig-Wolfe decomposition," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1441-1456.
    9. Bingdi Huang & Peiping Shen, 2025. "An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule," Computational Optimization and Applications, Springer, vol. 91(3), pages 1339-1371, July.
    10. Meersman, Tine & Maenhout, Broos & Van Herck, Koen, 2023. "A nested Benders decomposition-based algorithm to solve the three-stage stochastic optimisation problem modeling population-based breast cancer screening," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1273-1293.
    11. Clautiaux, François & Ljubić, Ivana, 2025. "Last fifty years of integer linear programming: A focus on recent practical advances," European Journal of Operational Research, Elsevier, vol. 324(3), pages 707-731.
    12. Shaurya Sharma & Brage Knudsen & Bjarne Grimstad, 2016. "Towards an objective feasibility pump for convex MINLPs," Computational Optimization and Applications, Springer, vol. 63(3), pages 737-753, April.
    13. Hezhi Luo & Youmin Xu & Huixian Wu & Guoqiang Wang, 2025. "A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation," Computational Optimization and Applications, Springer, vol. 90(1), pages 257-301, January.
    14. Delle Donne, Diego & Santini, Alberto & Archetti, Claudia, 2025. "Integrating public transport in sustainable last-mile delivery: Column generation approaches," European Journal of Operational Research, Elsevier, vol. 324(1), pages 75-91.
    15. Orlando Rivera Letelier & François Clautiaux & Ruslan Sadykov, 2022. "Bin Packing Problem with Time Lags," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2249-2270, July.
    16. Yao, Zhiyuan & Nie, Lei & Fu, Huiling, 2024. "Railway line planning with passenger routing: Direct-service network representations and a two-phase solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    17. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
    18. Quentin Cappart & David Bergman & Louis-Martin Rousseau & Isabeau Prémont-Schwarz & Augustin Parjadis, 2022. "Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2552-2570, September.
    19. François Clautiaux & Ruslan Sadykov & François Vanderbeck & Quentin Viaud, 2019. "Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 265-297, September.
    20. Justkowiak, Jan-Erik & Pesch, Erwin, 2023. "A column generation driven heuristic for order-scheduling and rack-sequencing in robotic mobile fulfillment systems," Omega, Elsevier, vol. 120(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:operea:v:23:y:2023:i:3:d:10.1007_s12351-023-00777-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.