Article ID: | iaor20117487 |
Volume: | 9 |
Issue: | 3 |
Start Page Number: | 328 |
End Page Number: | 350 |
Publication Date: | Jul 2011 |
Journal: | International Journal of Logistics Systems and Management |
Authors: | Manimaran P, Selladurai V, Yeh W C, Sivakumar M |
Keywords: | combinatorial optimization, programming: integer, management |
This work develops a mathematical model for a Multistage Supply Chain Network (MSCN) with a fixed charge for each route and proposes novel solution procedure based on Particle Swarm Optimisation (PSO). The MSCN problem involves selection of facilities to open, and the distribution network design must satisfy demand at minimum cost. The problem becomes Nondeterministic Polynomial‐time (NP) hard while considering fixed charges. The novel idea in this work is the adoption of fixed charges for each production flow between stages. Numerical results are presented and compared with approximate and lower bound values to demonstrate the effectiveness of the proposed approach.