Skip to main content
SpringerLink
Log in

A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The double row layout problem (DRLP) occurs in automated manufacturing environments, where a material-handling device transports materials among machines arranged in a double-row layout, i.e. a layout in which the machines are located on either side of a straight line corridor. The DRLP is how to minimize the total cost of transporting materials between machines. The problem is NP-Hard and one great challenge nowadays is how to solve problem instances in reasonable computational times. In this paper, we give a new mixed-integer programming model of the DRLP, which is based on a linear extension of a partial order. In addition, we propose a reformulation of this model, which yields stronger results. The new models have the least number of 0–1 variables in comparison with previous models in the literature. Computational experiments demonstrate that the proposed models obtain optimal solutions faster than previously published ones.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Ahonen, H., de Alvarenga, A.G., Amaral, A.R.S.: Simulated annealing and tabu search approaches for the corridor allocation problem. Eur. J. Oper. Res. 232(1), 221–233 (2014). https://doi.org/10.1016/j.ejor.2013.07.01

    Article  MathSciNet  MATH  Google Scholar 

  2. Amaral, A.R.S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508–518 (2006). https://doi.org/10.1016/j.ejor.2004.12.021

    Article  MathSciNet  MATH  Google Scholar 

  3. Amaral, A.R.S.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026–1033 (2008). https://doi.org/10.1287/opre.1080.0548

    Article  MathSciNet  MATH  Google Scholar 

  4. Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discret. Appl. Math. 157(1), 183–190 (2009). https://doi.org/10.1016/j.dam.2008.06.002

    Article  MathSciNet  MATH  Google Scholar 

  5. Amaral, A.R.S.: On duplex arrangement of vertices. Tech. rep., Universidade Federal do Espírito Santo, Brazil (2011)

  6. Amaral, A.R.S.: The corridor allocation problem. Comput. Oper. Res. 39(12), 3325–3330 (2012). https://doi.org/10.1016/j.cor.2012.04.016

    Article  MATH  Google Scholar 

  7. Amaral, A.R.S.: Optimal solutions for the double row layout problem. Optim. Lett. 7, 407–413 (2013a). https://doi.org/10.1007/s11590-011-0426-8

    Article  MathSciNet  MATH  Google Scholar 

  8. Amaral, A.R.S.: A parallel ordering problem in facilities layout. Comput. Oper. Res. 40(12), 2930–2939 (2013b). https://doi.org/10.1016/j.cor.2013.07.003

    Article  MathSciNet  MATH  Google Scholar 

  9. Amaral, A.R.S.: A mixed-integer programming formulation for the double row layout of machines in manufacturing systems. Int. J. Prod. Res. 1–14 (2018)

  10. Amaral, A.R.S.: Applying the Amaral–Secchin’s reformulation to a recent MIP model of the double row layout problem. Working paper, Universidade Federal do Espírito Santo, Brazil (2020a)

  11. Amaral, A.R.S.: A heuristic approach for the double row layout problem. Ann. Oper. Res. (2020b). https://doi.org/10.1007/s10479-020-03617-5

    Article  Google Scholar 

  12. Amaral, A.R.S., Letchford, A.N.: A polyhedral approach to the single row facility layout problem. Math. Program. 141(1–2), 453–477 (2013). https://doi.org/10.1007/s10107-012-0533-z

    Article  MathSciNet  MATH  Google Scholar 

  13. Andrade, R.C., Ferreira, M.S. Problema de ordenação de departamentos em linhas simples. In: Annals of the XLIX SBPO—Simpósio Brasileiro de Pesquisa Operacional, Blumenau-SC, Brazil, pp. 2874–2879 (2017). http://www.sbpo2017.iltc.br/pdf/168752.pdf

  14. Anjos, M.F., Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611–617 (2008). https://doi.org/10.1287/ijoc.1080.0270

    Article  MathSciNet  MATH  Google Scholar 

  15. Anjos, M.F., Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4), 805–817 (2009)

    Article  MathSciNet  Google Scholar 

  16. Anjos, M.F., Kennings, A., Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discret. Optim. 2(2), 113–122 (2005). https://doi.org/10.1016/j.disopt.2005.03.001

    Article  MathSciNet  MATH  Google Scholar 

  17. Anjos, M.F., Fischer, A., Hungerländer, P.: Solution approaches for the double-row equidistant facility layout problem. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds.) Operations Research Proceedings 2014, pp. 17–23. Springer, Cham (2016)

    Chapter  Google Scholar 

  18. Bracht, U., Dahlbeck, M., Fischer, A., Krüger, T.: Combining simulation and optimization for extended double row facility layout problems in factory planning. In: Baum, M., Brenner, G., Grabowski, J., Hanschke, T., Hartmann, S., Schöbel, A. (eds.) Simulation Science, pp. 39–59. Springer, Cham (2018)

    Chapter  Google Scholar 

  19. Chae, J., Regan, A.C.: Layout design problems with heterogeneous area constraints. Comput. Ind. Eng. 102, 198–207 (2016). https://doi.org/10.1016/j.cie.2016.10.016

    Article  Google Scholar 

  20. Chae, J., Regan, A.C.: A mixed integer programming model for a double row layout problem. Comput. Ind. Eng. 140, 106244 (2020). https://doi.org/10.1016/j.cie.2019.106244

    Article  Google Scholar 

  21. Chung, J., Tanchoco, J.M.A.: The double row layout problem. Int. J. Prod. Res. 48(3), 709–727 (2010). https://doi.org/10.1080/00207540802192126

    Article  MATH  Google Scholar 

  22. Dahlbeck, M., Fischer, A., Fischer, F.: Decorous combinatorial lower bounds for row layout problems. Eur. J. Oper. Res. 286(3), 929–944 (2020). https://doi.org/10.1016/j.ejor.2020.04.010

    Article  MathSciNet  MATH  Google Scholar 

  23. Drira, A., Pierreval, H., Hajri-Gabouj, S.: Facility layout problems: a survey. Ann. Rev. Control 31(2), 255–267 (2007). https://doi.org/10.1016/j.arcontrol.2007.04.001

    Article  Google Scholar 

  24. Ficko, M., Brezocnik, M., Balic, J.: Designing the layout of single- and multiple-rows flexible manufacturing system by genetic algorithms. J. Mater. Process. Technol. 157–158, 150–158 (2004). https://doi.org/10.1016/j.jmatprotec.2004.09.012

    Article  Google Scholar 

  25. Fischer, A., Fischer, F., Hungerländer, P.: New exact approaches to row layout problems. Math. Program. Comput. 11(4), 703–754 (2019). https://doi.org/10.1007/s12532-019-00162-6

    Article  MathSciNet  MATH  Google Scholar 

  26. Gen, M., Ida, K., Cheng, C.: Multirow machine layout problem in fuzzy environment using genetic algorithms. Comput. Ind. Eng. 29(1), 519–523 (1995). https://doi.org/10.1016/0360-8352(95)00127-M

    Article  Google Scholar 

  27. Grötschel, M., Jünger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Program. 33(1), 43–60 (1985). https://doi.org/10.1007/BF01582010

    Article  MathSciNet  MATH  Google Scholar 

  28. Guan, J., Lin, G., Feng, H.B., Ruan, Z.Q.: A decomposition-based algorithm for the double row layout problem. Appl. Math. Model. 77, 963–979 (2020). https://doi.org/10.1016/j.apm.2019.08.015

    Article  MathSciNet  MATH  Google Scholar 

  29. Gülsen, M., Murray, C.C., Smith, A.E.: Double-row facility layout with replicate machines and split flows. Comput. Oper. Res. 108, 20–32 (2019). https://doi.org/10.1016/j.cor.2019.03.009

    Article  MathSciNet  MATH  Google Scholar 

  30. Heragu, S.S., Alfa, A.S.: Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57(2), 190–202 (1992). https://doi.org/10.1016/0377-2217(92)90042-8

    Article  MATH  Google Scholar 

  31. Heragu, S.S., Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258–268 (1988). https://doi.org/10.1287/opre.36.2.258

    Article  Google Scholar 

  32. Heragu, S.S., Kusiak, A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53(1), 1–13 (1991). https://doi.org/10.1016/0377-2217(91)90088-D

    Article  MATH  Google Scholar 

  33. Hungerländer, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 5, 1–20 (2012). https://doi.org/10.1007/s10589-012-9505-8

    Article  MathSciNet  MATH  Google Scholar 

  34. Keller, B., Buscher, U.: Single row layout models. Eur. J. Oper. Res. 245(3), 629–644 (2015). https://doi.org/10.1016/j.ejor.2015.03.016

    Article  MathSciNet  MATH  Google Scholar 

  35. Kothari, R., Ghosh, D.: The single row facility layout problem: state of the art. OPSEARCH 49, 442–462 (2012). https://doi.org/10.1007/s12597-012-0091-4

    Article  MathSciNet  MATH  Google Scholar 

  36. Kouvelis, P.: Design and planning problems in flexible manufacturing systems: a critical review. J. Intell. Manuf. 3(2), 75–99 (1992). https://doi.org/10.1007/BF01474748

    Article  Google Scholar 

  37. Love, R.F., Wong, J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139–143 (1976)

    MATH  Google Scholar 

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

    Google Scholar 

  39. Murray, C.C., Smith, A.E., Zhang, Z.: An efficient local search heuristic for the double row layout problem with asymmetric material flow. Int. J. Prod. Res. 51(20), 6129–6139 (2013). https://doi.org/10.1080/00207543.2013.803168

    Article  Google Scholar 

  40. Secchin, L., Amaral, A.R.S.: An improved mixed-integer programming model for the double row layout of facilities. Optim. Lett. 1–7 (2018)

  41. Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17(5), 812–826 (1969). https://doi.org/10.1287/opre.17.5.812

    Article  MathSciNet  MATH  Google Scholar 

  42. Tang, L., Zuo, X., Wang, C., Zhao, X.: A MOEA/D based approach for solving robust double row layout problem. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 1966–1973 (2015)

  43. Tubaileh, A., Siam, J.: Single and multi-row layout design for flexible manufacturing systems. Int. J. Comput. Integr. Manuf. (2017). https://doi.org/10.1080/0951192X.2017.1314013

    Article  Google Scholar 

  44. Wang, S., Zuo, X., Liu, X., Zhao, X., Li, J.: Solving dynamic double row layout problem via combining simulated annealing and mathematical programming. Appl. Soft Comput. 37, 303–310 (2015). https://doi.org/10.1016/j.asoc.2015.08.023

    Article  Google Scholar 

  45. Yang, X., Cheng, W., Smith, A., Amaral, A.R.S.: An improved model for the parallel row ordering problem. J. Oper. Res. Soc. 1–26 (2018). https://doi.org/10.1080/01605682.2018.1556570

  46. Zhang, Z., Murray, C.C.: A corrected formulation for the double row layout problem. Int. J. Prod. Res. 50(15), 4220–4223 (2012). https://doi.org/10.1080/00207543.2011.603371

    Article  Google Scholar 

  47. Zuo, X., Murray, C.C., Smith, A.E.: Solving an extended double row layout problem using multiobjective tabu search and linear programming. IEEE Trans. Autom. Sci. Eng. 11(4), 1122–1132 (2014)

    Article  Google Scholar 

  48. Zuo, X., Murray, C., Smith, A.: Sharing clearances to improve machine layout. Int. J. Prod. Res. 54(14), 4272–4285 (2016). https://doi.org/10.1080/00207543.2016.1142134

    Article  Google Scholar 

  49. Zuo, X., Liu, X., Zhang, Q., Li, W., Wan, X., Zhao, X.: MOEA/D with linear programming for double row layout problem with center-islands. IEEE Trans. Cybern. 1–13 (2019)

Download references

Acknowledgements

This study was financed in part by Coordenação de Aperfeiçoamento de Pessoal de Nível Superior—Brasil (CAPES)—Finance Code 001; and in part by Fundação de Amparo à Pesquisa e Inovação do Espírito Santo (FAPES).

Author information

Authors and Affiliations

  1. Graduate School of Computer Science (PPGI), Federal University of Espírito Santo, UFES, Vitória, 29075-910, Brazil

    André R. S. Amaral

Authors
  1. André R. S. Amaral
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to André R. S. Amaral.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Amaral, A.R.S. A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order. Optim Lett 15, 1407–1423 (2021). https://doi.org/10.1007/s11590-020-01651-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-020-01651-7

Keywords

Search

Navigation