Optimization of vehicle routing with inventory allocation problems in Cold Supply Chain Logistics. (April 2020)

• Record Type: Journal Article
• Authors: Al Theeb, Nader; Smadi, Hazem J.; Al-Hawari, Tarek H.; Aljarrah, Manar H.
• Is Part Of: Computers & industrial engineering. Volume 142(2020)
• Publication Date: 2020-04
• Subjects: Integer programming -- Cold supply chain -- Vehicle routing -- Inventory allocation; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2020.106341
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: This study proposes an optimization model to optimize the cold supply chain. A competitive solution approach is developed to solve the proposed model. The solution approach solves the data sets in short processing times. The solution approach provides results with low gaps relative to CPLEX A saving by 9.25% of total distribution cost is achieved in a case study. Abstract: In this research, a new comprehensive mixed integer optimization model combining inventory allocation problem, vehicle routing problem, and cold supply chain (CSC) is formulated, denoted as IVRPCSC Model, to minimize the total cost paid for CSC, including the transportation and inventory costs. As the proposed model is NP-hard, a multi-phases solution approach is developed to solve the model in reasonable computational effort. Results of the proposed solution approach show that it is able to provide solutions with low gaps for the data-sets with different scales in very short computational time compared with the solutions for the same sets provided by commercial solvers, such as CPLEX. At the end, a real case study is solved by the proposed model, and the results show a saving of 9.25% of total distribution cost compared with the current cost paid by the organization.