Metaheuristic approach to design and address multi-echelon seafood closed-loop supply chain network
Overview & Synopsis
In recent years, global demand for fish and seafood has significantly increased, underscoring the importance of fish protein as a primary animal protein source in many regions worldwide. Seafood is increasingly recognized as critical for addressing future food security challenges. However, the seafood industry generates substantial waste, creating significant management challenges. To address this, the present study introduces an efficient multi-echelon Seafood Supply Chain Network (SSCN) designed to manage seafood industry by-products. These by-products can be effectively utilized by recycling industries, promoting environmental sustainability. This study employs a mixed-integer linear programming (MILP) model to solve the locationallocation problem inherent in SSCN design. Given the computational complexity of this problem, it is classified as NP-hard. To tackle this complexity, a Modified Simulated Annealing (MSA) algorithm is implemented. The algorithm's control parameters are optimized using the Taguchi method. Results indicate that the proposed methodology effectively handles large-scale problem instances.
hal.science)
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Metaheuristic approach to design and address multi-echelon seafood closed-loop supply chain network |
|---|---|
| Author / Organization | Hamza Chokri, Issam Nouaouri, Hamid Allaoui, Frida Ben Rais Lasram |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2025 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-163800 |
| Original Source Link | Visit Source Page on hal.science » |