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

A fast local search based memetic algorithm for the parallel row ordering problem

Author

Listed:
  • Palubeckis, Gintaras

Abstract

The parallel row ordering problem (PROP) is concerned with arranging two groups of facilities along two parallel lines with the goal of minimizing the sum of the flow cost-weighted distances between the pairs of facilities. As the main result of this paper, we show that the insertion neighborhood for the PROP can be explored in optimal time Θ(n2) by providing an O(n2)-time procedure for performing this task, where n is the number of facilities. As a case study, we incorporate this procedure in a memetic algorithm (MA) for solving the PROP. We report on numerical experiments that we conducted with MA on PROP instances with up to 500 facilities. The experimental results demonstrate that the MA is superior to the adaptive iterated local search algorithm and the parallel hyper heuristic method, which are state-of-the-art for the PROP. Remarkably, our algorithm improved best known solutions for six largest instances in the literature. We conjecture that the time complexity of exploring the interchange neighborhood for the PROP is Θ(n2), exactly as in the case of insertion operation.

Suggested Citation

  • Palubeckis, Gintaras, 2025. "A fast local search based memetic algorithm for the parallel row ordering problem," Applied Mathematics and Computation, Elsevier, vol. 486(C).
  • Handle: RePEc:eee:apmaco:v:486:y:2025:i:c:s0096300324005010
    DOI: 10.1016/j.amc.2024.129040
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2024.129040?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. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
    2. Silu Liu & Zeqiang Zhang & Chao Guan & Lixia Zhu & Min Zhang & Peng Guo, 2021. "An improved fireworks algorithm for the constrained single-row facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 59(8), pages 2309-2327, April.
    3. 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.
    4. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    5. X.Q. Zuo & C.C. Murray & A.E. Smith, 2016. "Sharing clearances to improve machine layout," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4272-4285, July.
    6. Xiu Ning & Pingke Li, 2018. "A cross-entropy approach to the single row facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 56(11), pages 3781-3794, June.
    7. Nearchou, Andreas C., 2006. "Meta-heuristics from nature for the loop layout design problem," International Journal of Production Economics, Elsevier, vol. 101(2), pages 312-328, June.
    8. 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.
    9. 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.
    10. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.
    11. 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.
    12. 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.
    13. Junqi Liu & Zeqiang Zhang & Feng Chen & Silu Liu & Lixia Zhu, 2022. "A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 953-972, April.
    14. 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.
    15. Xing Wan & Xingquan Zuo & Xiaodong Li & Xinchao Zhao, 2022. "A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances," International Journal of Production Research, Taylor & Francis Journals, vol. 60(3), pages 957-976, February.
    16. Kerstin Maier & Veronika Taferner, 2023. "Solving the constrained Single-Row Facility Layout Problem with Integer Linear Programming," International Journal of Production Research, Taylor & Francis Journals, vol. 61(6), pages 1882-1897, March.
    17. Chao Guan & Zeqiang Zhang & Yunpeng Li, 2019. "A flower pollination algorithm for the double-floor corridor allocation problem," International Journal of Production Research, Taylor & Francis Journals, vol. 57(20), pages 6506-6527, October.
    18. 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.
    19. 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.
    20. Xuhong Yang & Wenming Cheng & Alice E. Smith & André R. S. Amaral, 2020. "An improved model for the parallel row ordering problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(3), pages 475-490, March.
    21. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    22. 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.
    23. 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.
    24. 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.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.
    3. 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.
    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. Junqi Liu & Zeqiang Zhang & Feng Chen & Silu Liu & Lixia Zhu, 2022. "A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 953-972, April.
    6. 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.
    7. Wu, Song & Yang, Wei & Hanafi, Saïd & Wilbaut, Christophe & Wang, Yang, 2024. "Iterated local search with ejection chains for the space-free multi-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 873-886.
    8. 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.
    9. Palubeckis, Gintaras, 2015. "Fast local search for single row facility layout," European Journal of Operational Research, Elsevier, vol. 246(3), pages 800-814.
    10. 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.
    11. 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.
    12. Weckenborg, Christian & Schumacher, Patrick & Thies, Christian & Spengler, Thomas S., 2024. "Flexibility in manufacturing system design: A review of recent approaches from Operations Research," European Journal of Operational Research, Elsevier, vol. 315(2), pages 413-441.
    13. 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.
    14. 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.
    15. Xing Wan & Xing-Quan Zuo & Xin-Chao Zhao, 2021. "A Surrogate Model-Based Hybrid Approach for Stochastic Robust Double Row Layout Problem," Mathematics, MDPI, vol. 9(15), pages 1-18, July.
    16. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    17. Zhongwei Zhang & Lihui Wu & Zhaoyun Wu & Wenqiang Zhang & Shun Jia & Tao Peng, 2022. "Energy-Saving Oriented Manufacturing Workshop Facility Layout: A Solution Approach Using Multi-Objective Particle Swarm Optimization," Sustainability, MDPI, vol. 14(5), pages 1-28, February.
    18. 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.
    19. 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.
    20. 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.

    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:486:y:2025:i:c:s0096300324005010. 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.