IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v263y2015icp287-301.html
   My bibliography  Save this article

Fast simulated annealing for single-row equidistant facility layout

Author

Listed:
  • Palubeckis, Gintaras

Abstract

Given n facilities and a flow matrix, the single-row equidistant facility layout problem (SREFLP) is to find a one-to-one assignment of n facilities to n locations equally spaced along a straight line so as to minimize the sum of the products of the flows and distances between facilities. We develop a simulated annealing (SA) algorithm for solving this problem. The algorithm provides a possibility to employ either merely pairwise interchanges of facilities or merely insertion moves or both of them. It incorporates an innovative method for computing gains of both types of moves. Experimental analysis shows that this method is significantly faster than traditional approaches. To further speed up SA, we propose a two-mode technique when for high temperatures, at each iteration, only the required gain is calculated and, for lower temperatures, the gains of all possible moves are maintained from iteration to iteration. We experimentally compare SA against the iterated tabu search (ITS) algorithm from the literature. Computational results are reported for SREFLP instances with up to 300 facilities. The results show that the performance of our SA implementation is dramatically better than that of the ITS heuristic.

Suggested Citation

  • Palubeckis, Gintaras, 2015. "Fast simulated annealing for single-row equidistant facility layout," Applied Mathematics and Computation, Elsevier, vol. 263(C), pages 287-301.
  • Handle: RePEc:eee:apmaco:v:263:y:2015:i:c:p:287-301
    DOI: 10.1016/j.amc.2015.04.073
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315005354
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.04.073?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. Adams, Warren P. & Guignard, Monique & Hahn, Peter M. & Hightower, William L., 2007. "A level-2 reformulation-linearization technique bound for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 983-996, August.
    2. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    3. 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.
    4. Burkard, R. E. & Rendl, F., 1984. "A thermodynamically motivated simulation procedure for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 17(2), pages 169-174, August.
    5. Yu, Junfang & Sarker, Bhaba R., 2003. "Directional decomposition heuristic for a linear machine-cell location problem," European Journal of Operational Research, Elsevier, vol. 149(1), pages 142-184, August.
    6. Jean-Claude Picard & Maurice Queyranne, 1981. "On the One-Dimensional Space Allocation Problem," Operations Research, INFORMS, vol. 29(2), pages 371-391, April.
    7. Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L., 1998. "One-dimensional machine location problems in a multi-product flowline with equidistant locations," European Journal of Operational Research, Elsevier, vol. 105(3), pages 401-426, March.
    8. Peter M. Hahn & Yi-Rong Zhu & Monique Guignard & William L. Hightower & Matthew J. Saltzman, 2012. "A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 202-209, May.
    9. James, Tabitha & Rego, Cesar & Glover, Fred, 2009. "A cooperative parallel tabu search algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 810-826, June.
    10. Kothari, Ravi & Ghosh, Diptesh, 2012. "Sensitivity Analysis for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    11. 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.
    12. 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.
    13. 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.
    14. Jadranka Skorin-Kapov, 1990. "Tabu Search Applied to the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 33-45, February.
    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. Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
    2. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank, 2020. "Decorous combinatorial lower bounds for row layout problems," European Journal of Operational Research, Elsevier, vol. 286(3), pages 929-944.
    3. Jerzy Grobelny & Rafal Michalski, 2017. "A novel version of simulated annealing based on linguistic patterns for solving facility layout problems," WORking papers in Management Science (WORMS) WORMS/17/07, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.

    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. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    2. 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.
    3. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    4. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank, 2020. "Decorous combinatorial lower bounds for row layout problems," European Journal of Operational Research, Elsevier, vol. 286(3), pages 929-944.
    5. Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
    6. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    7. 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.
    8. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    9. Anjos, Miguel F. & Fischer, Anja & Hungerländer, Philipp, 2018. "Improved exact approaches for row layout problems with departments of equal length," European Journal of Operational Research, Elsevier, vol. 270(2), pages 514-529.
    10. 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.
    11. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    12. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
    13. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    14. Jiming Peng & Tao Zhu & Hezhi Luo & Kim-Chuan Toh, 2015. "Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting," Computational Optimization and Applications, Springer, vol. 60(1), pages 171-198, January.
    15. 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.
    16. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    17. Alexandre Domingues Gonçalves & Artur Alves Pessoa & Cristiana Bentes & Ricardo Farias & Lúcia Maria de A. Drummond, 2017. "A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 676-687, November.
    18. Nihal Berktaş & Hande Yaman, 2021. "A Branch-and-Bound Algorithm for Team Formation on Social Networks," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1162-1176, July.
    19. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
    20. Monique Guignard, 2020. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints," Annals of Operations Research, Springer, vol. 286(1), pages 173-200, March.

    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:eee:apmaco:v:263:y:2015:i:c:p:287-301. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.