Title: Multiobjective capacitated plant location problem

Authors: Sudha Arora, S.R. Arora

Addresses: Department of Mathematics, Deen Dayal Upadhyaya College, University of Delhi, Shivaji Marg, Karampura, Delhi 110015, India. ' Department of Mathematics, Hansraj College, University of Delhi, Delhi 110007, India

Abstract: Multicriteria decision-making is a field which is expanding rapidly. There has been increasing recognition that there is a practical need to explicitly consider several criteria simultaneously. It has been observed that most of the problems on facility location are in reality multicriteria problems. Fernandez, E. and Presto, J. (2003) have discussed the multiobjective uncapacitated plant location problem. In practice, facilities may have constraining capacities on the amount of demand they can serve. To bridge this gap between theory and practice, we have considered the multiobjective capacitated plant location problem. The multiobjective plant location problem is decomposed into two sub-problems. The allocation of plants to the clients when the capacities are restricted has been discussed in detail. Two algorithms are presented to solve the allocation problem. The method used by Fernandez and Puerto (2003) has been modified to solve this problem. It is illustrated with the help of examples.

Keywords: capacitated plant location; multiobjective plant location; optimisation; multicriteria decision making; MCDM.

DOI: 10.1504/IJOR.2010.032423

International Journal of Operational Research, 2010 Vol.7 No.4, pp.487 - 505

Available online: 02 Apr 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article