Designing a Food Supply Chain Network under Uncertainty and Solving by Multi-Objective Metaheuristics

Short life cycle products, especially food products, require a certain type of supply chain management due to their particular specifications such as perishability. On the other hand, the food distribution also requires special considerations and imparts more complexity compared with the distributio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of supply and operations management Ročník 7; číslo 4; s. 350 - 372
Hlavní autoři: Hassanpour, Hossein Ali, Taheri, Mohammad Reza, Rezanezhad, Reza
Médium: Journal Article
Jazyk:angličtina
Vydáno: Tehran Kharazmi University 01.11.2020
Témata:
Algorithms
augmented epsilon-constraint
Customer satisfaction
Food
Food supply
foodstuffs
Heuristic methods
Mathematical models
metaheuristic
Multiple objective analysis
Operating costs
perishable goods
supply chain
Supply chain management
Supply chains
Transportation
Travel time
Uncertainty
ISSN:2383-1359, 2383-2525
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Short life cycle products, especially food products, require a certain type of supply chain management due to their particular specifications such as perishability. On the other hand, the food distribution also requires special considerations and imparts more complexity compared with the distribution of other goods because in food distribution the quality of the food delivered to the customer should be considered as well as transportation costs. Therefore, in this paper, a new mathematical model is developed for integrating decisions regarding food supply and distribution under conditions of uncertainty (vehicles' travel time) with aims to minimize purchase and transportation costs and maximize customer satisfaction. Customer satisfaction relies upon the quality of the food delivered to the customers. The multi-objective model proposed in this paper is NP-hard. Hence, a developed version of NSGA-II called Multi-Objective Time Travel to History (MOTTH) algorithm, inspired from the idea of traveling through history, is proposed to solve the problem. In order to validate the performance of the proposed algorithm, the results of MOTTH algorithm are compared with the results obtained from an exact augmented epsilon-constraint method. Furthermore, a comparison is provided between the NSGA-II and MOTTH algorithms, the results of which indicate the superiority of the MOTTH metaheuristic algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2383-1359
2383-2525
DOI:10.22034/IJSOM.2020.4.5