Article: A review and classification of heuristic algorithms for the inventory routing problem Journal: International Journal of Operational Research (IJOR) 2021 Vol.41 No.2 pp.282 - 298 Abstract: The inventory routing problem (IRP) is an integration of vehicle routing and inventory management problems. In the recent years, it has increasingly drawn the attention of the researchers because of its potentially significant practical value. The IRP is classified as NP-hard problem since it subsumes the vehicle routing problem (VRP). This fact led to the development of many heuristic or metaheuristic approaches, although a small number of exact methods have been introduced recently. Heuristic methods offer the advantage of shorter time scales, i.e., greater computational efficiency, on the expense of course of the accuracy of the results. The immediate trigger for this study is our concern about results validation, which has been debatable in early papers, and only recently a systematic effort to create a set of optimally solved benchmark instances has been made. This article presents the heuristic methods for solving the basic variants of IRP found in the literature, stressing the computational results and the solution verification approach, rather than the methodology of the algorithms. The paper concludes with a discussion on the quality of the performance assessment of the proposed algorithms. Inderscience Publishers - linking academia, business and industry through research

Title: A review and classification of heuristic algorithms for the inventory routing problem

Authors: Stella Sofianopoulou; Ioannis Mitsopoulos

Addresses: Business School, University of Sunderland, St. Peter's Campus, Sunderland, SR6-0DD, UK; Department of Industrial Management and Technology, University of Piraeus, 80 Karaoli and Dimitriou St., 185-34 Piraeus, Greece ' Department of Industrial Management and Technology, University of Piraeus, 80 Karaoli and Dimitriou St., 185-34 Piraeus, Greece

Abstract: The inventory routing problem (IRP) is an integration of vehicle routing and inventory management problems. In the recent years, it has increasingly drawn the attention of the researchers because of its potentially significant practical value. The IRP is classified as NP-hard problem since it subsumes the vehicle routing problem (VRP). This fact led to the development of many heuristic or metaheuristic approaches, although a small number of exact methods have been introduced recently. Heuristic methods offer the advantage of shorter time scales, i.e., greater computational efficiency, on the expense of course of the accuracy of the results. The immediate trigger for this study is our concern about results validation, which has been debatable in early papers, and only recently a systematic effort to create a set of optimally solved benchmark instances has been made. This article presents the heuristic methods for solving the basic variants of IRP found in the literature, stressing the computational results and the solution verification approach, rather than the methodology of the algorithms. The paper concludes with a discussion on the quality of the performance assessment of the proposed algorithms.

Keywords: heuristic algorithms; literature review; results validation; inventory routing problem; IRP.

DOI: 10.1504/IJOR.2021.115630

International Journal of Operational Research, 2021 Vol.41 No.2, pp.282 - 298

Received: 07 Mar 2018
Accepted: 14 Oct 2018
Published online: 15 Jun 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: A review and classification of heuristic algorithms for the inventory routing problem

Keep up-to-date