IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v6y2025i2d10.1007_s43069-025-00454-9.html
   My bibliography  Save this article

Fractional Programming-Based Heuristic: An Efficient Method for Marine Inventory Routing Problem

Author

Listed:
  • Mohammad Nasir Yarahmadi

    (Amirkabir University of Technology (Tehran Polytechnic))

  • Seyed Ali MirHassani

    (Amirkabir University of Technology (Tehran Polytechnic))

  • Farnaz Hooshmand

    (Amirkabir University of Technology (Tehran Polytechnic))

Abstract

This study investigates a specific category of Marine Inventory Routing Problems (MIRPs), which involves the supply and demand management of a port inventory under vessel routing constraints. MIRP is typically formulated as mixed-integer linear programming models which present computational challenges when employing existing solvers. To address the computational difficulties of the MIRP, researchers have explored numerous approximation, decomposition, and heuristic approaches to generate effective and practical solutions. Given that the feasibility pump method (FPM) can find feasible solutions for MILP models, this paper seeks to adopt a recently addressed version of FPM to find feasible solutions for MIRP. We refer to our approach as a heuristic method based on fractional programming (HBFP) and, through computational experiments, show its superiority over the FPM when tackling large-scale instances of MIRP.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:snopef:v:6:y:2025:i:2:d:10.1007_s43069-025-00454-9
    DOI: 10.1007/s43069-025-00454-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-025-00454-9
    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/s43069-025-00454-9?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.

    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:snopef:v:6:y:2025:i:2:d:10.1007_s43069-025-00454-9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.