IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v12y2021i6d10.1007_s13198-021-01275-9.html
   My bibliography  Save this article

Optimization of plant location problem in interval domain via particle swarm optimization

Author

Listed:
  • Laxminarayan Sahoo

    (Raiganj University)

  • Asoke Kumar Bhunia

    (The University of Burdwan)

Abstract

This paper explores the concept of plant location problem in interval domain. In many formulations of plant location problem, it is assumed that parameters relating to the problems are precise valued, which is the traditional way to formulate the problem. Here, we consider all the parameters of the problem are imprecise and impreciseness has been represented by interval numbers. Now days, set up of different industries/plants as well as logistic centers plays an important role for developing the nation’s economy and also significantly contribute to the economic and social development of specified regions in which they are located. So setup of different industries/plants/logistic centers is a crucial measure and ensuring that such important industries/plants/logistic centers are both efficient and productive. This type of problem falls under the problem of production planning and distribution problems. To achieve this goal, optimization technique plays a vital role. Recently, different types of optimization techniques have been advanced rapidly and applied widely to solve production planning and distribution problems. Some of these are Genetic Algorithm, Particle swarm Optimization, Differential Evolution, Ant Colony Optimization etc. and these advancements are supported both by continuous updating progress of computer technologies and that of the optimization process for large scale system. In this paper, we have considered and solved plant location problem which is a most important optimization problem. The main goal of plant location problem is to setup a plant/industry in such a place that for which the total cost of transportations is minimum. In existing literature plant location problems have always been addressed in the deterministic domain i.e., all the parameters relating to the problems are fixed/precise. However, due to uncertainty/impreciseness, here we have presented the plant location problem in interval environment. New formulations in interval environment and solution methods based on Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) have been developed. Finally, a numerical example has been considered and solved for illustration purpose.

Suggested Citation

  • Laxminarayan Sahoo & Asoke Kumar Bhunia, 2021. "Optimization of plant location problem in interval domain via particle swarm optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1094-1105, December.
    • Handle: RePEc:spr:ijsaem:v:12:y:2021:i:6:d:10.1007_s13198-021-01275-9
    DOI: 10.1007/s13198-021-01275-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-021-01275-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-021-01275-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John D. Dillon, 1956. "Geographical Distribution of Production in Multiple Plant Operations," Management Science, INFORMS, vol. 2(4), pages 353-365, July.
    2. Luis Rios & Nikolaos Sahinidis, 2013. "Derivative-free optimization: a review of algorithms and comparison of software implementations," Journal of Global Optimization, Springer, vol. 56(3), pages 1247-1293, July.
    3. Korkel, Manfred, 1989. "On the exact solution of large-scale simple plant location problems," European Journal of Operational Research, Elsevier, vol. 39(2), pages 157-173, March.
    4. Cornuejols, G. & Sridharan, R. & Thizy, J. M., 1991. "A comparison of heuristics and relaxations for the capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 50(3), pages 280-297, February.
    5. Mohsen Afsharian, 2021. "A frontier-based facility location problem with a centralised view of measuring the performance of the network," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(5), pages 1058-1074, May.
    6. M. A. Efroymson & T. L. Ray, 1966. "A Branch-Bound Algorithm for Plant Location," Operations Research, INFORMS, vol. 14(3), pages 361-368, June.
    7. Krarup, Jakob & Pruzan, Peter Mark, 1983. "The simple plant location problem: Survey and synthesis," European Journal of Operational Research, Elsevier, vol. 12(1), pages 36-57, January.
    8. Margaret L. Brandeau & Samuel S. Chiu, 1989. "An Overview of Representative Problems in Location Research," Management Science, INFORMS, vol. 35(6), pages 645-674, June.
    9. Jack Brimberg & Charles ReVelle, 1998. "Solving the plant location problem on a line by linear programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 277-286, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nabaranjan Bhattacharyee & Nirmal Kumar & Sanat Kumar Mahato & Puja Supakar, 2022. "Reliability of the illumination of the darkroom with different scenario of the switching methods in uncertain environment," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(5), pages 2482-2499, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    2. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    4. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    5. Li‐Lian Gao & E. Powell Robinson, 1992. "A dual‐based optimization procedure for the two‐echelon uncapacitated facility location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 191-212, March.
    6. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    7. Farahani, Reza Zanjirani & Asgari, Nasrin, 2007. "Combination of MCDM and covering techniques in a hierarchical model for facility location: A case study," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1839-1858, February.
    8. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
    9. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    10. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    11. Bülent Çatay & Ş. Selçuk Erengüç & Asoo J. Vakharia, 2005. "Capacity allocation with machine duplication in semiconductor manufacturing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 659-667, October.
    12. Madadi, AliReza & Kurz, Mary E. & Mason, Scott J. & Taaffe, Kevin M., 2014. "Supply chain design under quality disruptions and tainted materials delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 67(C), pages 105-123.
    13. Daniel Serra & Charles Revelle, 1992. "The PQ-Median problem: Location and districting of hierarchical facilities. Part I," Economics Working Papers 12, Department of Economics and Business, Universitat Pompeu Fabra.
    14. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    15. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    16. Li, Jinfeng & Chu, Feng & Prins, Christian & Zhu, Zhanguo, 2014. "Lower and upper bounds for a two-stage capacitated facility location problem with handling costs," European Journal of Operational Research, Elsevier, vol. 236(3), pages 957-967.
    17. M. G. Speranza & W. Ukovich, 1996. "An algorithm for optimal shipments with given frequencies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 655-671, August.
    18. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.
    19. Myung, Young-Soo & Kim, Hu-gon & Tcha, Dong-wan, 1997. "A bi-objective uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 608-616, August.
    20. Chandra Ade Irawan & Dylan Jones, 2019. "Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities," Annals of Operations Research, Springer, vol. 272(1), pages 41-67, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:12:y:2021:i:6:d:10.1007_s13198-021-01275-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.