Skip to main content

A Scatter Search Approach for the Parallel Row Ordering Problem

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Abstract

In this work, we present a new approach for the Parallel Row Ordering Problem (PROP), based on the Scatter Search metaheuristic. The PROP focuses on minimizing the total weighted sum of all distances between each pair of facility centers in a linear layout. The proposed method is able to obtain all known optimal values in a fraction of the time required by the previous exact methods for the set of smaller instances, and it outperforms the current state of the art metaheuristic for the set of larger instances, spending a comparable computing time.

This work has been partially supported by the Spanish Ministerio de Ciencia, Innovación y Universidades (MCIU/AEI/FEDER, UE) under grant refs. PGC2018-095322-B-C22 and PID2021-126605NB-I00; and Comunidad de Madrid y Fondos Estructurales de la Unión Europea with grant ref. P2018/TCS-4566.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahmadi, A., Pishvaee, M.S., Jokar, M.R.A.: A survey on multi-floor facility layout problems. Comput. Ind. Eng. 107, 158–170 (2017)

    Article  Google Scholar 

  2. Amaral, A.R.: A parallel ordering problem in facilities layout. Comput. Oper. Res. 40(12), 2930–2939 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)

    Google Scholar 

  4. Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156–166 (1977)

    Article  Google Scholar 

  5. Gong, J., Zhang, Z., Liu, J., Guan, C., Liu, S.: Hybrid algorithm of harmony search for dynamic parallel row ordering problem. J. Manuf. Syst. 58, 159–175 (2021)

    Article  Google Scholar 

  6. López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Stützle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016). https://doi.org/10.1016/j.orp.2016.09.002

    Article  MathSciNet  Google Scholar 

  7. Maadi, M., Javidnia, M., Jamshidi, R.: Two strategies based on meta-heuristic algorithms for parallel row ordering problem (PROP). Iran. J. Manag. Stud. 10(2), 467–498 (2017)

    Google Scholar 

  8. Martí, R., Corberán, Á., Peiró, J.: Scatter search. In: Martí, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 717–740. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-07124-4_20

  9. Yang, X., Cheng, W., Smith, A.E., Amaral, A.R.S.: An improved model for the parallel row ordering problem. J. Oper. Res. Soc. 71(3), 475–490 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jose Manuel Colmenar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Martín-Santamaría, R., Colmenar, J.M., Duarte, A. (2023). A Scatter Search Approach for the Parallel Row Ordering Problem. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics