Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Predicting 30-Day Emergency Readmission Risk Read chapter Read first chapter

2017 | OriginalPaper | Chapter

An Instance Generator for the Multi-Objective 3D Packing Problem

Authors : Yanira González, Gara Miranda, Coromoto León

Published in: International Joint Conference SOCO’16-CISIS’16-ICEUTE’16

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Cutting and packing problems have important applications to the transportation of cargo. Many algorithms have been proposed for solving the 2D/3D cutting stock problems but most of them consider single objective optimization. The goal of the problem here proposed is to load the boxes that would provide the highest total volume and weight to the container, without exceeding the container limits. These two objectives are conflicting because the volume of a box is usually not proportional to its weight. This work deals with a multi-objective formulation of the 3D Packing Problem (3DPP). We propose to apply multi-objective evolutionary algorithms in order to obtain a set of non-dominated solutions, from which the final users would choose the one to be definitely carried out. For doing an extensive study, it would be necessary to use more problem instances. Instances to deal with the multi-objective 3DPP are non-existent. For this purpose, we have implemented an instance generator.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

inform now

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!

inform now

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!

inform now
previous chapter Detecting Existence of Cycles in Petri Nets
next chapter Solving Repetitive Production Planning Problems. An Approach Based on Activity-oriented Petri Nets
Literature
1.
Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.: Loading pallets with non-identical items. Eur. J. Oper. Res. 84(3), 681–692 (1995)CrossRefMATH
2.
Bischoff, E., Ratcliff, M.: Issues in the development of approaches to container loading. Omega 23(4), 377–390 (1995)CrossRef
3.
Bortfeldt, A., Gehring, H.: A tabu search algorithm for weakly heterogeneous container loading problems. OR Spectr. 20(4), 237–250 (1998)MATH
4.
Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131(1), 143–161 (2001)CrossRefMATH
5.
Bortfeldt, A., Wäscher, G.: Container loading problems - a state-of-the-art review. In: Working Paper 1, Otto-von-Guericke-Universität Magdeburg, April 2012
6.
Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automating the packing heuristic design process with genetic programming. Evol. Comput. 20(1), 63–89 (2012)CrossRef
7.
Davies, A., Bischoff, E.E.: Weight distribution considerations in container loading. Eur. J. Oper. Res. 114(3), 509–527 (1999)CrossRefMATH
8.
Dereli, T., Das, S.G.: A hybrid simulated annealing algorithm for solving multi-objective container loading problems. Appl. Artif. Intell. Int. J. 24(5), 463–486 (2010)CrossRef
9.
Ding, X., Han, Y., Zhang, X.: A discussion of adaptive genetic algorithm solving container-loading problem. Periodical Ocean Univ. China 34(5), 844–848 (2004)
10.
11.
12.
Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 4(5–6), 401–418 (1997)CrossRefMATH
13.
Gonalves, J.F., Resende, M.G.: A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput. Oper. Res. 39(2), 179–190 (2012)MathSciNetCrossRefMATH
14.
González, Y., Miranda, G., León, C.: A multi-level filling heuristic for the multi-objective container loading problem. In: International Joint Conference SOCO 2013-CISIS 2013-ICEUTE 2013 - Salamanca, Spain, Proceedings, pp. 11–20, 11–13 September 2013
15.
He, K., Huang, W.: An efficient placement heuristic for three-dimensional rectangular packing. Comput. Oper. Res. 38, 227–233 (2011)CrossRefMATH
16.
Hifi, M.: Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Comput. Oper. Res. 31, 657–674 (2004)CrossRefMATH
17.
18.
Ivancic, N., Mathur, K., Mohanty, B.B.: An integer programming based heuristic approach to the three-dimensional packing problem. J. Manuf. Oper. Manage. 2, 268–289 (1989)MathSciNet
19.
Jin, Z., Ohno, K., Du, J.: An efficient approach for the three dimensional container packing problem with practical constraints. Asia Pac. J. Oper. Res. 21(3), 279–295 (2004)CrossRefMATH
20.
21.
Kang, K., Moon, I., Wang, H.: A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem. Appl. Math. Comput. 219(3), 1287–1299 (2012)MathSciNetMATH
22.
León, C., Miranda, G., Segura, C.: METCO: a parallel plugin-based framework for multi-objective optimization. Int. J. Artif. Intell. Tools 18(4), 569–588 (2009)CrossRef
23.
Liu, J., Yue, Y., Dong, Z., Maple, C., Keech, M.: A novel hybrid tabu search approach to container loading. Comput. Oper. Res. 38, 797–807 (2011)MathSciNetCrossRefMATH
24.
Loh, T.H., Nee, A.Y.C.: A packing algorithm for hexahedral boxes, pp. 115–126 (1992)
25.
Moura, A., Oliveira, J.F.: A GRASP approach to the container-loading problem. IEEE Intell. Syst. 20(4), 50–57 (2005)CrossRef
26.
Parreño, F., Alvarez-Valdes, R., Oliveira, J.F., Tamarit, J.M.: Neighborhood structures for the container loading problem: a VNS implementation. J. Heuristics 16(1), 1–22 (2010)CrossRefMATH
27.
28.
Ren, J., Tian, Y., Sawaragi, T.: A tree search method for the container loading problem with shipment priority. Eur. J. Oper. Res. 214(3), 526–535 (2011)CrossRefMATH
29.
Scheithauer, G.: Algorithms for the container loading problem. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds.) Operations Research Proceedings 1991, vol. 1991, pp. 445–452. Springer, Heidelberg (1992)CrossRef
30.
Zhao, X., Bennell, J., Bektas, T., Dowsland, K.: A comparative review of 3d container loading algorithms, April 2014
Metadata
Title
An Instance Generator for the Multi-Objective 3D Packing Problem
Authors
Yanira González
Gara Miranda
Coromoto León
Copyright Year
2017
Book
International Joint Conference SOCO’16-CISIS’16-ICEUTE’16

Print ISBN: 978-3-319-47363-5

Electronic ISBN: 978-3-319-47364-2

Copyright Year: 2017

DOI
https://doi.org/10.1007/978-3-319-47364-2_37

Premium Partner

    Image Credits