4.7 Article

An improved genetic algorithm for optimizing total supply chain cost in inventory location routing problem

Journal

AIN SHAMS ENGINEERING JOURNAL
Volume 10, Issue 1, Pages 63-76

Publisher

ELSEVIER
DOI: 10.1016/j.asej.2018.09.002

Keywords

Inventory location routing problem; Genetic algorithms; Vehicle capacity; Supply chain cost

Ask authors/readers for more resources

Integrating inventory, location, and routing decisions in supply chains may considerably impact their performance. In this paper, the Inventory Location Routing Problem (ILRP) is considered while adopting the Vendor Managed Inventory (VMI) strategy. A mathematical model is formulated to minimize the total supply chain cost. Being NP-hard, an Improved Genetic Algorithm (IGA) is designed and used to solve the problem. Two instances (10 and 30 customers) are solved; to study the effect of the total vehicles capacity (number of available vehicles per depot and vehicle capacity), on the total supply chain cost. The results show that, the IGA outperforms the GA in reaching lower cost, especially for high number of customers. The superiority of the obtained solution performance is basically achieved on the expense of computational time. For the considered problem, the total cost decreases with the increase of vehicle capacity due to the usage of fewer depots. (C) 2019 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Ain Shams University.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available