Skip to main content
SpringerLink
Log in

Solving Multi-objective Two Dimensional Rectangle Packing Problem

  • Conference paper
  • First Online:
Book cover Proceedings of Sixth International Conference on Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 547))

Abstract

The work presented here solves rectangular packing problem in which rectangular items are packed on a rectangular stock sheet. Multiple objectives have been considered which are optimized using rectangle packing algorithm with different heuristics. A mathematical formulation has been presented to solve the problem. Computational experiments have been conducted to find the best packing layout for the problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Yang, H.H., Lin, C.L.: On genetic algorithms for shoe making nesting. A Taiwan Case Expert Syst. Appl. 36(2), 1134–1141 (2009)

    Article  Google Scholar 

  2. Selow, R., Junior, F.N., Heitor, S., Lopes, H.S.: Genetic algorithms for the nesting problem in the packing industry. In: The International Multi Conference of Engineers and Computer Scientists (IMECS), pp. 1–6 (2007)

    Google Scholar 

  3. Yaodong, C., Yiping, L.: Heuristic algorithm for a cutting stock problem in the steel bridge construction. Comput. Oper. Res. 36, 612–622 (2009)

    Article  MATH  Google Scholar 

  4. Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)

    MATH  Google Scholar 

  5. Hopper, E., Turton, B.C.H.: A review of the application of metaheuristic algorithms to 2D strip packing problems. Artif. Intell. Rev. 16, 257–300 (2001)

    Article  MATH  Google Scholar 

  6. Liu, H.Y., He, Y.J.: Algorithm for 2D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center principle. J. Zhejiang Univ.–Sci. 7(4), 570–576 (2006)

    Article  MATH  Google Scholar 

  7. Singh, K., Jain, L.: Optimal solution for 2-D Rectangle Packing Problem. Int. J. Appl. Eng. Res. 4, 2203–2222 (2009)

    Google Scholar 

  8. Leung, T.W., Yung, C.H., Troutt, M.D.: Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput. Ind. Eng. 40, 201–214 (2001)

    Article  Google Scholar 

  9. Wascher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)

    Article  MATH  Google Scholar 

  10. Uday, A., Goodman, E.D., Debnath, A.A.: Nesting of irregular shapes using feature matching and parallel genetic algorithms. In: Genetic and Evolutionary Computation Conference Late Breaking Papers, San Francisco, California, USA, pp. 429–434 (2001)

    Google Scholar 

  11. Bennell, J.A., Lee. L.S., Potts, C.N.: A genetic algorithm for two-dimensional bin packing with due dates. Int. J. Prod. Econ. 145(2), 547–560 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sri Guru Granth Sahib World University, Fatehgarh Sahib, India

    Amandeep Kaur Virk

  2. University Computer Centre, Punjabi University, Patiala, India

    Kawaljeet Singh

Authors
  1. Amandeep Kaur Virk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kawaljeet Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amandeep Kaur Virk .

Editor information

Editors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India

    Kusum Deep

  2. Department of Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  3. Department of Mathematics, National Institute of Technology, Silchar, Silchar, Assam, India

    Kedar Nath Das

  4. School of Mathematics, Thapar Institute of Engineering and Technology University, Patiala, Punjab, India

    Arvind Kumar Lal

  5. School of Mathematics, Thapar Institute of Engineering and Technology University, Patiala, Punjab, India

    Harish Garg

  6. Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya K. Nagar

  7. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Virk, A.K., Singh, K. (2017). Solving Multi-objective Two Dimensional Rectangle Packing Problem. In: Deep, K., et al. Proceedings of Sixth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 547. Springer, Singapore. https://doi.org/10.1007/978-981-10-3325-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3325-4_19

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3324-7

  • Online ISBN: 978-981-10-3325-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation