SpringerLink
Log in

Efficient multi-objective simulated annealing algorithm for interactive layout problems

  • Original Paper
  • Published:
International Journal on Interactive Design and Manufacturing (IJIDeM) Aims and scope Submit manuscript

Abstract

This paper presents an efficient simulated annealing algorithm for solving multi-objective layout problems where several rectangular components are placed, respecting non-overlap and non-protrusion constraints in the given space. Resolving layout problems can be very hard in some industrial cases because problems are over-constrained and computing feasible optimal layout designs are time consuming. In most practical problems, both real and virtual components exist. The virtual components represent the required accessible space allowing the user to access to the component. The virtual components can overlap with each other, while the overlap is not allowed for the real components. Considering the limited layout design space, the capacity of the layout problem is analyzed using constructive placing techniques. To explore the feasible layout space, a hybrid simulated annealing is proposed to determine the order of placement; then, a constructive placing strategy based on empty maximal space is developed. What’s more, an interactive visualization environment is introduced between the optimization and expert. The proposed algorithm is the first attempt to search feasible space of multi-objective layout design by constructive placing method.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Thailand)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Bénabès, J., Guédas, B., Poirson, E., Bennis, F.: Indicator of feasibility for layout problems. In: International Design Engineering Technical Conferences (IDETC) and Computers and Information in Engineering Conference (CIE), pp. 727–734. Chicago (2012)

  2. Bénabès, J., Poirson, E., Bennis, F., Ravaut, Y.: Interactive modular optimization strategy for layout problems. In: International Design Engineering Technical Conferences (IDETC) and Computers and Information in Engineering Conference (CIE), pp. 553–562. Washington, DC (2011)

  3. Bénabès, J., Bennis, F., Poirson, E., Ravaut, Y.: Interactive optimization strategies for layout problems. Int. J. Interact. Des. Manuf. 4, 181–190 (2010). https://doi.org/10.1007/s12008-010-0100-x

    Article  Google Scholar 

  4. Bénabès, J., Poirson, E., Bennis, F.: Integrated and interactive method for solving layout optimization problems. Expert Syst. Appl. 40, 5796–5803 (2013). https://doi.org/10.1016/j.eswa.2013.03.045

    Article  Google Scholar 

  5. Chankong, V., Haimes, Y.Y.: Multiobjective Decision Making: Theory and Methodology. Courier Dover Publications (2008)

  6. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE. Trans. Evol. Comput. 6, 182–197 (2002). https://doi.org/10.1109/4235.996017

    Article  Google Scholar 

  7. Delahaye, D., Chaimatanan, S., Mongeau, M.: Simulated annealing: from basics to applications. pp. 1–35. ISBN 978-3-319-91085-7. Springer (2019). https://doi.org/10.1007/978-3-319-91086-4_1

  8. Foulds, L.R., Hamacher, H.W.: Facilities Layout Problems, pp. 975–979. Springer, Boston (2009). https://doi.org/10.1007/978-0-387-74759-0_171

    Book  Google Scholar 

  9. Freund, R.M.: Penalty and barrier methods for constrained optimization. Lecture Notes, Massachusetts Institute of Technology (2004)

  10. Gonçalves, J.F., Resende, M.G.: A biased random-key genetic algorithm for the unequal area facility layout problem. Eur. J. Oper. Res. 246, 86–107 (2015)

    Article  MathSciNet  Google Scholar 

  11. Hanafi, R., Kozan, E.: A hybrid constructive heuristic and simulated annealing for railway crew scheduling. Comput. Ind. Eng. (2014). https://doi.org/10.1016/j.cie.2014.01.002

    Article  Google Scholar 

  12. Hasda, R., Bhattacharjya, R., Bennis, F.: Modified genetic algorithms for solving facility layout problems. Int. J. Interact. Des. Manuf. 11, 713–725 (2016). https://doi.org/10.1007/s12008-016-0362-z

    Article  Google Scholar 

  13. Hosseini Nasab, H., Fereidouni, S., Ghomi, S., Fakhrzad, M.: Classification of facility layout problems: a review study. Int. J. Adv. Manuf. Technol. 94, 957–977 (2018). https://doi.org/10.1007/s00170-017-0895-8

    Article  Google Scholar 

  14. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  15. Lai, K., Chan, J.W.: Develo** a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32, 115–127 (1997)

    Article  Google Scholar 

  16. Li, X., Zhao, Z., Zhang, K.: A genetic algorithm for the three-dimensional bin packing problem with heterogeneous bins. In: IIE. Annual. Conf. and Expo., pp. 2039–2048 (2014)

  17. Mariem, B., Marc, Z., Affonso, R., Masmoudi, F., Haddar, M.: A methodology for solving facility layout problem considering barriers—genetic algorithm coupled with A* search. J. Intell. Manuf. 31, 615–640 (2019). https://doi.org/10.1007/s10845-019-01468-x

    Article  Google Scholar 

  18. Méndez, M., Rossit, D.A., González, B., Frutos, M.: Proposal and comparative study of evolutionary algorithms for optimum design of a gear system. IEEE Access 8, 3482–3497 (2020)

    Article  Google Scholar 

  19. Pllana, S., Memeti, S., Kolodziej, J.: Customizing Pareto Simulated Annealing for Multi-objective Optimization of Control Cabinet Layout. In: Proceedings of the 22nd International Conference on Control Systems and Computer Science (CSCS), pp. 78–85 (2019). https://doi.org/10.1109/CSCS.2019.00021

  20. Ripon, K.S.N., Glette, K., Khan, K.N., Hovin, M., Torresen, J.: Adaptive variable neighborhood search for solving multi-objective facility layout problems with unequal area facilities. Swarm Evol. Comput. 8, 1–12 (2013). https://doi.org/10.1016/j.swevo.2012.07.003

    Article  Google Scholar 

  21. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007). https://doi.org/10.1016/j.ejor.2005.12.047

    Article  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to acknowledge THALES for the application study.

Author information

Authors and Affiliations

  1. ECN, UMR 6004, Laboratoire des sciences du numérique de Nantes (LS2N), 44321, Nantes, France

    **aoxiao Song, Emilie Poirson & Fouad Bennis

  2. Thales Communications, 49300, Cholet, France

    Yannick Ravaut

Authors
  1. **aoxiao Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emilie Poirson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yannick Ravaut
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fouad Bennis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to **aoxiao Song.

Additional information

Publisher's Note

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

This work was supported by China Scholarship Council.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, X., Poirson, E., Ravaut, Y. et al. Efficient multi-objective simulated annealing algorithm for interactive layout problems. Int J Interact Des Manuf 15, 441–451 (2021). https://doi.org/10.1007/s12008-021-00773-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12008-021-00773-1

Keywords

Search

Navigation