Skip to main content

2017 | OriginalPaper | Buchkapitel

Solving Multi-objective Two Dimensional Rectangle Packing Problem

verfasst von : Amandeep Kaur Virk, Kawaljeet Singh

Erschienen in: Proceedings of Sixth International Conference on Soft Computing for Problem Solving

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Yang, H.H., Lin, C.L.: On genetic algorithms for shoe making nesting. A Taiwan Case Expert Syst. Appl. 36(2), 1134–1141 (2009)CrossRef Yang, H.H., Lin, C.L.: On genetic algorithms for shoe making nesting. A Taiwan Case Expert Syst. Appl. 36(2), 1134–1141 (2009)CrossRef
2.
Zurück zum Zitat 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) 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)
3.
Zurück zum Zitat Yaodong, C., Yiping, L.: Heuristic algorithm for a cutting stock problem in the steel bridge construction. Comput. Oper. Res. 36, 612–622 (2009)CrossRefMATH Yaodong, C., Yiping, L.: Heuristic algorithm for a cutting stock problem in the steel bridge construction. Comput. Oper. Res. 36, 612–622 (2009)CrossRefMATH
4.
Zurück zum Zitat Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)MATH Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)MATH
5.
Zurück zum Zitat 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)CrossRefMATH 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)CrossRefMATH
6.
Zurück zum Zitat 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)CrossRefMATH 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)CrossRefMATH
7.
Zurück zum Zitat Singh, K., Jain, L.: Optimal solution for 2-D Rectangle Packing Problem. Int. J. Appl. Eng. Res. 4, 2203–2222 (2009) Singh, K., Jain, L.: Optimal solution for 2-D Rectangle Packing Problem. Int. J. Appl. Eng. Res. 4, 2203–2222 (2009)
8.
Zurück zum Zitat 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)CrossRef 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)CrossRef
9.
Zurück zum Zitat Wascher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)CrossRefMATH Wascher, G., Hausner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)CrossRefMATH
10.
Zurück zum Zitat 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) 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)
11.
Zurück zum Zitat 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)CrossRef 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)CrossRef
Metadaten
Titel
Solving Multi-objective Two Dimensional Rectangle Packing Problem
verfasst von
Amandeep Kaur Virk
Kawaljeet Singh
Copyright-Jahr
2017
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-3325-4_19