Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/24696

Title: Optimization of heterogeneous Bin packing using adaptive genetic algorithm
Authors: Sridhar, R.
Chandrasekaran, M.
Sriramya, C.
Page, Tom
Issue Date: 2017
Publisher: © The Authors. Published by the Institute of Physics (IOP)
Citation: SRIDHAR, R. ...et al., 2017. Optimization of heterogeneous Bin packing using adaptive genetic algorithm. IOP Conference Series: Materials Science and Engineering, 183(2017): 012026.
Abstract: This research is concentrates on a very interesting work, the bin packing using hybrid genetic approach. The optimal and feasible packing of goods for transportation and distribution to various locations by satisfying the practical constraints are the key points in this project work. As the number of boxes for packing can not be predicted in advance and the boxes may not be of same category always. It also involves many practical constraints that are why the optimal packing makes much importance to the industries. This work presents a combinational of heuristic Genetic Algorithm (HGA) for solving Three Dimensional (3D) Single container arbitrary sized rectangular prismatic bin packing optimization problem by considering most of the practical constraints facing in logistic industries. This goal was achieved in this research by optimizing the empty volume inside the container using genetic approach. Feasible packing pattern was achieved by satisfying various practical constraints like box orientation, stack priority, container stability, weight constraint, overlapping constraint, shipment placement constraint. 3D bin packing 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 in-turn profit. Furthermore, Boxes to be packed may be of arbitrary sizes. The user input data are the number of bins, its size, shape, weight, and constraints if any along with standard container dimension. This user input were stored in the database and encoded to string (chromosomes) format which were normally acceptable by GA. GA operators were allowed to act over these encoded strings for finding the best solution.
Description: This is an Open Access Article. It is published by Institute of Physics (IOP) under the Creative Commons Attribution 3.0 Unported Licence (CC BY). Full details of this licence are available at: http://creativecommons.org/licenses/by/3.0/
Version: Published
DOI: 10.1088/1757-899X/183/1/012026
URI: https://dspace.lboro.ac.uk/2134/24696
Publisher Link: http://dx.doi.org/10.1088/1757-899X/183/1/012026
ISSN: 1757-8981
Appears in Collections:Published Articles (Design School)

Files associated with this item:

File Description SizeFormat
Sridhar_2017_IOP_Conf._Ser_pdfPublished version716.22 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.