An Effective Matheuristic for the Multivehicle Inventory Routing Problem

Solyalı O., SÜRAL H.

Transportation Science, cilt.56, sa.4, ss.1044-1057, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 56 Sayı: 4
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1287/trsc.2021.1123
  • Dergi Adı: Transportation Science
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, Academic Search Premier, International Bibliography of Social Sciences, ABI/INFORM, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Compendex, Computer & Applied Sciences, zbMATH
  • Sayfa Sayıları: ss.1044-1057
  • Anahtar Kelimeler: inventory routing, mixed integer linear programming, matheuristic, CUT ALGORITHM, LOCAL SEARCH
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

Copyright: © 2022 INFORMS.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.