Particle swarm optimisation for multi stage supply chain network associated with fixed charges
P. Manimaran and
V. Selladurai
International Journal of Operational Research, 2014, vol. 21, issue 1, 100-122
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.
Keywords: particle swarm optimisation; PSO; supply chain management; SCM; multi-stage networks; fixed costs. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=64024 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:21:y:2014:i:1:p:100-122
Access Statistics for this article
More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().