Particle swarm optimisation for multi stage supply chain network associated with fixed charges Online publication date: Sat, 30-Aug-2014
by P. Manimaran; V. Selladurai
International Journal of Operational Research (IJOR), Vol. 21, No. 1, 2014
Abstract: This paper develops a particle swarm optimisation (PSO) algorithm for the multi stage supply chain network problem associated with the fixed charges. In many distribution problems, the transportation cost consists of fixed costs, that are independent of the quantities transported and variable costs, which are proportional to the quantities transported. The objective of this paper is to select the optimum set of suppliers, plants, distribution centres (DCs) to be opened and determine the quantities to be supplied to satisfy the customer demand with minimum total distribution cost. The problem chosen goes beyond the traditional mathematical programming and it becomes a non-polynomial (NP) hard while considering the fixed costs. The performance of PSO is compared in terms of total distribution cost with spanning tree-based genetic algorithm (st-GA), improved Prüfer number encoding-based genetic algorithm (IPEGA) and with LINGO. Computational results showed that the proposed PSO is capable of producing good quality solutions.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook