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 search 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. 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.
    4. 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.
    5. 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.
    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)

    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. Miriam Kießling & Sascha Kurz & Jörg Rambau, 2021. "An exact column-generation approach for the lot-type design problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 741-780, October.
    3. 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.
    4. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    5. 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.
    6. 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.
    7. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2022. "Integral Column Generation for Set Partitioning Problems with Side Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2313-2331, July.
    8. 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.
    9. Massimo De Mauri & Joris Gillis & Jan Swevers & Goele Pipeleers, 2020. "A proximal-point outer approximation algorithm," Computational Optimization and Applications, Springer, vol. 77(3), pages 755-777, December.
    10. 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.
    11. Hou, Zhisong & Liu, Sanyang, 2023. "A spatial branch-reduction-bound algorithm for solving generalized linear fractional problems globally," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    12. Babak Akbarzadeh & Ghasem Moslehi & Mohammad Reisi-Nafchi & Broos Maenhout, 2020. "A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering," Journal of Scheduling, Springer, vol. 23(2), pages 265-288, April.
    13. Martinovic, J. & Strasdat, N. & Valério de Carvalho, J. & Furini, F., 2023. "A combinatorial flow-based formulation for temporal bin packing problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 554-574.
    14. Tonbari, Mohamed El & Ahmed, Shabbir, 2023. "Consensus-based Dantzig-Wolfe decomposition," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1441-1456.
    15. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    16. Ma, Cheng & Zhang, Liansheng, 2015. "On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 642-656.
    17. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2022. "Weighted iterated local branching for mathematical programming problems with binary variables," Journal of Heuristics, Springer, vol. 28(3), pages 329-350, June.
    18. 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.
    19. Irvin Lustig & Patricia Randall & Robert Randall, 2021. "Formulation Matters: Reciprocating Integer Programming for Birchbox Product Assortment," Interfaces, INFORMS, vol. 51(5), pages 347-360, September.
    20. S. M. Mirhadi & S. A. MirHassani, 2022. "A solution approach for cardinality minimization problem based on fractional programming," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 583-602, August.

    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.