IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v56y2022i4p1044-1057.html
   My bibliography  Save this article

An Effective Matheuristic for the Multivehicle Inventory Routing Problem

Author

Listed:
  • Oğuz Solyalı

    (Business Administration Program, Middle East Technical University Northern Cyprus Campus, Kalkanli 99738, Turkey)

  • Haldun Süral

    (Department of Industrial Engineering, Middle East Technical University, Ankara 06800, Turkey)

Abstract

This study considers the multivehicle inventory routing problem in which a supplier has to build a distribution plan over a discrete time horizon to replenish a set of customers that faces a given demand. Transportation costs as well as inventory costs at the supplier and at the customers are to be minimized. A matheuristic algorithm is proposed that is based on sequentially solving different mixed integer linear programs. The algorithm merges the advantage of being easy to design and implement, as it is mainly based on the problem formulation, with the benefit of providing high-quality solutions. A computational study is performed on benchmark test instances by comparing the results with the ones obtained from previous algorithms proposed in the literature. The results show that the matheuristic algorithm outperforms the existing heuristic algorithms and finds a significant number of new best solutions in both small and large instances.

Suggested Citation

  • Oğuz Solyalı & Haldun Süral, 2022. "An Effective Matheuristic for the Multivehicle Inventory Routing Problem," Transportation Science, INFORMS, vol. 56(4), pages 1044-1057, July.
    • Handle: RePEc:inm:ortrsc:v:56:y:2022:i:4:p:1044-1057
    DOI: 10.1287/trsc.2021.1123
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1123
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1123?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
    ---><---

    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:inm:ortrsc:v:56:y:2022:i:4:p:1044-1057. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.