Hiindex LOGO

Research Article

Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach


Author(s): S. Jegadeshwari , D. Jaisree
Affiliation: Faculty, MGR University, Chennai
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2014/article.php?page=597"><img src="http://www.hindex.org/sai.php/2014SCIA316F0597" alt="SAI"></a>


File:

http://www.hindex.org/2014/p597.pdf


Citation: S. Jegadeshwari, D. Jaisree. "Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach." International Journal of Computing Algorithm 3.1 (2014): 93-96.

Abstract:
This paper presents an heuristic Genetic Algorithm for solving 3-Dimensional Single container packing optimization problem. The 3D container loading problem consists of ‘n’ number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and inturn profit. Furthermore, various practical constraints like box orientation, stack priority, container stability, etc also applied. Boxes to be packed are of various sizes and of heterogeneous shapes. In this research work, several heuristic improvements were proposed over Genetic Algorithm (GA) to solve the container loading problem that significantly improves the search efficiency and to load most of heterogeneous boxes into a container along with the optimal position of loaded boxes, box orientation and boxes to be loaded by satisfying practical constraints.


Keywords Mingozzi,Genetic Algorithm (GA)


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{Heu1459799, author = {S. Jegadeshwari,D. Jaisree}, title = {Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] D.E. Goldberg, “Genetic Algorithm in Search, Optimization and Machine Learning”, Addison Wesley, 1988.
  • [2] M.Mitchell, “An Introduction to Genetic Algorithm”, MIT Press, 1996.
  • [3] E.Hopper and B. Turton, “Application of Genetic Algorithm to Packing Problems – A Review”, Springer Verlag, London, pp 279 -288, 1997.
  • [4] R. Korf, “A New Algorithm of Optimal Bin Packing”, In proc. AAAI, pages 731-736, 2002.
  • [5] R. Korf, “A Improved Algorithm for Optimal Bin Packing”, In proc. IJCAI, pages 1252 – 1258, 2003.
  • [6] D.Pisinger, “Heuristic for Container Loading Problem”, European Journal of Operation Research 141, 292 – 382, 2002.
  • [7] H.Gehring, A. Bortfeldt, “A Genetic Algorithm for Solving the Container Loading Problem”, International transactions in Operation Research, 44, pages 401 – 418, 1997.
  • [8] KA Dowsland, EA Herbet, “Using Tree Search Bounds To Enhance A Genetic Algorithm Approach Two Rectangle Packing Problems”, European Journal of Operation Research 168, 390-402, 2004.
  • [9] S. Martello, D. Pisinger, “The Three Dimensional Bin Packing Problem”, Operation research 48, 256-267, 2000.
  • [10] EE Bischoff, “Three Dimensional Packing of Items with Limited Load Bearing Strength”, European Journal of Operation Research 168, pages 952-966, 2004.Bortfeldt and H. Gehring, “A Hybrid Genetic Algorithm for Container Loading Problem”, European Journal of Operation Research 131, page 143 -161, 2001.
  • [11] SG. Christensen and D.M. Rousoe, “Container Loading with Multidrop Constraint”, masters thesis, Informatics and mathematical Modelling, Technical University of Denmark, DTU, Lyngby, 2007. http://www2.imm.dtu.dk/pubdb/p.php?5225.
  • [12] A.P. Davies and E.E. Bischoff, “Weight Distribution Considerations In Container Loading” European Journal of Operation Research 114, pages 509-527, 1999.
  • [13] John A George and Jennifer M George, “Packing Different Sized Circles into a Rectangular Container”, European Journal of Operation Research 84, pages 693-712, 1995.
  • [14] E.K. Burke, M.R. Hyde, “Evolving Bin Packing Heuristic with Genetic Programming”, School of computer science and information technology”, UK. http://cs.nott.ac.uk/~mvh.
  • [15] Dyckhoff H. A typology of cutting and packing problems. Eur J Oper Res 1990;44:145–59.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>1</issue> <startPage>93</startPage> <endPage>96</endPage> <documentType>article</documentType> <title language='eng'>Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach</title> <authors> <author> <name>S. Jegadeshwari</name> </author> </authors> <abstract language='eng'>This paper presents an heuristic Genetic Algorithm for solving 3-Dimensional Single container packing optimization problem. The 3D container loading problem consists of ‘n’ number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and inturn profit. Furthermore, various practical constraints like box orientation, stack priority, container stability, etc also applied. Boxes to be packed are of various sizes and of heterogeneous shapes. In this research work, several heuristic improvements were proposed over Genetic Algorithm (GA) to solve the container loading problem that significantly improves the search efficiency and to load most of heterogeneous boxes into a container along with the optimal position of loaded boxes, box orientation and boxes to be loaded by satisfying practical constraints.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p597.pdf</fullTextUrl> <keywords language='eng'> <keyword>Mingozzi,Genetic Algorithm (GA)</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=597", "name":"Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach", "author":[{"name":"S. Jegadeshwari "}], "datePublished":"2014", "description":"This paper presents an heuristic Genetic Algorithm for solving 3-Dimensional Single container packing optimization problem. The 3D container loading problem consists of ‘n’ number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and inturn profit. Furthermore, various practical constraints like box orientation, stack priority, container stability, etc also applied. Boxes to be packed are of various sizes and of heterogeneous shapes. In this research work, several heuristic improvements were proposed over Genetic Algorithm (GA) to solve the container loading problem that significantly improves the search efficiency and to load most of heterogeneous boxes into a container along with the optimal position of loaded boxes, box orientation and boxes to be loaded by satisfying practical constraints.", "keywords":["Mingozzi,Genetic Algorithm (GA)"], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>D. Jaisree</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>S. Jegadeshwari</dc:creator> <dc:date>2014</dc:date> <dc:description>This paper presents an heuristic Genetic Algorithm for solving 3-Dimensional Single container packing optimization problem. The 3D container loading problem consists of ‘n’ number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and inturn profit. Furthermore, various practical constraints like box orientation, stack priority, container stability, etc also applied. Boxes to be packed are of various sizes and of heterogeneous shapes. In this research work, several heuristic improvements were proposed over Genetic Algorithm (GA) to solve the container loading problem that significantly improves the search efficiency and to load most of heterogeneous boxes into a container along with the optimal position of loaded boxes, box orientation and boxes to be loaded by satisfying practical constraints.</dc:description> <dc:identifier>2014SCIA316F0597</dc:identifier> <dc:language>eng</dc:language> <dc:title>Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0597", "abstract": "This paper presents an heuristic Genetic Algorithm for solving 3-Dimensional Single container packing optimization problem. The 3D container loading problem consists of ‘n’ number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and inturn profit. Furthermore, various practical constraints like box orientation, stack priority, container stability, etc also applied. Boxes to be packed are of various sizes and of heterogeneous shapes. In this research work, several heuristic improvements were proposed over Genetic Algorithm (GA) to solve the container loading problem that significantly improves the search efficiency and to load most of heterogeneous boxes into a container along with the optimal position of loaded boxes, box orientation and boxes to be loaded by satisfying practical constraints.", "author": [ { "family": "S. Jegadeshwari,D. Jaisree" } ], "id": "597", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach", "type": "publication-article", "version": "3" }