IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/11436.html
   My bibliography  Save this paper

Path Relinking for Single Row Facility Layout

Author

Listed:
  • Kothari, Ravi
  • Ghosh, Diptesh

Abstract

The single row facility layout problem is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper we present path relinking algorithms to solve large sized instances of the problem. We use three different metaheuristics to generate sets of good quality initial solutions and subject the solutions in these sets to path relinking. We present our computational experience on 43 benchmark instances with up to 110 facilities.

Suggested Citation

  • Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:11436
    as

    Download full text from publisher

    File URL: https://www.iima.ac.in/sites/default/files/rnpfiles/6038336162012-05-01.pdf
    File Function: English Version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Datta, Dilip & Amaral, André R.S. & Figueira, José Rui, 2011. "Single row facility layout problem using a permutation-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 213(2), pages 388-394, September.
    2. Miguel F. Anjos & Anthony Vannelli, 2008. "Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 611-617, November.
    3. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    4. Jean-Claude Picard & Maurice Queyranne, 1981. "On the One-Dimensional Space Allocation Problem," Operations Research, INFORMS, vol. 29(2), pages 371-391, April.
    5. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    6. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
    7. Sunderesh S. Heragu & Andrew Kusiak, 1988. "Machine Layout Problem in Flexible Manufacturing Systems," Operations Research, INFORMS, vol. 36(2), pages 258-268, April.
    8. Donald M. Simmons, 1969. "One-Dimensional Space Allocation: An Ordering Algorithm," Operations Research, INFORMS, vol. 17(5), pages 812-826, October.
    9. Amaral, Andre R.S., 2006. "On the exact solution of a facility layout problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 508-518, September.
    10. Kothari, Ravi & Ghosh, Diptesh, 2012. "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    11. Heragu, Sunderesh S. & Alfa, Attahiru Sule, 1992. "Experimental analysis of simulated annealing based algorithms for the layout problem," European Journal of Operational Research, Elsevier, vol. 57(2), pages 190-202, March.
    12. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    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. Parveen Sharma & Sandeep Singhal, 2017. "Analysis of facility layout alternatives using proposed integrated approach," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 1-20, March.
    2. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    3. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.

    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. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    2. Kothari, Ravi & Ghosh, Diptesh, 2012. "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    4. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    5. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    6. Uma Kothari & Diptesh Ghosh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," Working Papers id:4915, eSocialSciences.
    7. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
    8. Ramazan Şahin & Sadegh Niroomand & Esra Duygu Durmaz & Saber Molla-Alizadeh-Zavardehi, 2020. "Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem," Annals of Operations Research, Springer, vol. 295(1), pages 313-336, December.
    9. Guan, Jian & Lin, Geng, 2016. "Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 899-909.
    10. Kothari, Ravi & Ghosh, Diptesh, 2012. "Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood," IIMA Working Papers WP2012-02-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    11. Kothari, Ravi & Ghosh, Diptesh, 2011. "The Single Row Facility Layout Problem: State of the Art," IIMA Working Papers WP2011-12-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. A. R. S. Amaral, 2022. "A heuristic approach for the double row layout problem," Annals of Operations Research, Springer, vol. 316(2), pages 1-36, September.
    13. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    14. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    15. Ghosh, Diptesh, 2011. "An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem," IIMA Working Papers WP2011-08-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Datta, Dilip & Amaral, André R.S. & Figueira, José Rui, 2011. "Single row facility layout problem using a permutation-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 213(2), pages 388-394, September.
    17. Samarghandi, Hamed & Eshghi, Kourosh, 2010. "An efficient tabu algorithm for the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 98-105, August.
    18. Dahlbeck, Mirko, 2021. "A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem," European Journal of Operational Research, Elsevier, vol. 295(2), pages 443-462.
    19. Ahonen, H. & de Alvarenga, A.G. & Amaral, A.R.S., 2014. "Simulated annealing and tabu search approaches for the Corridor Allocation Problem," European Journal of Operational Research, Elsevier, vol. 232(1), pages 221-233.
    20. Ghosh, Diptesh & Kothari, Ravi, 2012. "Population Heuristics for the Corridor Allocation Problem," IIMA Working Papers WP2012-09-02, Indian Institute of Management Ahmedabad, Research and Publication Department.

    More about this item

    Statistics

    Access and download statistics

    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:iim:iimawp:11436. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .

    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.