Cargando…

Proposing a new model for location - routing problem of perishable raw material suppliers with using meta-heuristic algorithms

In the last three decades, an integrated approach to optimize logistics system is considered as one of the most important aspects of optimizing supply chain management. This approach involves the ties between locations of facility, allocation of suppliers/customers, structure of transportation route...

Descripción completa

Detalles Bibliográficos
Autores principales: Yaghoubi, Ali, Akrami, Farideh
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6920202/
https://www.ncbi.nlm.nih.gov/pubmed/31879714
http://dx.doi.org/10.1016/j.heliyon.2019.e03020
Descripción
Sumario:In the last three decades, an integrated approach to optimize logistics system is considered as one of the most important aspects of optimizing supply chain management. This approach involves the ties between locations of facility, allocation of suppliers/customers, structure of transportation routes and inventory control. The aim of this paper is to investigate the ordering planning of a supply chain with multi supplier, multi distribution center, multi customer and one perishable raw material. This paper provides a mathematical model taking in consideration the limitation of raw material corruptibility (perishable material) which belongs to the category of NP-hard problems. To solve the proposed model, the Ant Colony Optimization algorithm (ACO) and Particle Swarm Optimization algorithm (PSO) are employed. In order to improve performances of ACO and PSO parameters, a Taguchi experimental design method was applied to set their proper values. Besides, to evaluate the performance of the proposed model, an example of the dairy industry is analyzed by using MATLAB R 2015a. To validate the proposed meta-heuristic algorithms, the results of them were compared with together. The results of the comparison show that ACO is greater than PSO in speed convergence rate and the number of solutions iterations.