Abstract
AbstractThe container loading problem (CLP) has been studied for maximising container space utilization as a method of lowering costs and increasing supply chain efficiency. This paper presents an approach to the CLP, in which a container is to be filled with a selection of cargoes from an available set so that the volume utilization of the container is maximized. By minimizing the outer volume of all the cargoes placed, tight arrangement of the cargoes can be achieved. Genetic algorithm (GA) with adaptive chromosome length formation has been used to find the optimum solution for the arranged cargoes to be placed with minimum space utilization. Two experiments have been conducted, to simulate the space optimization with fixed and unfixed number of cargoes. Our findings show that the GA with adaptive chromosome length proposes better arrangements of cargoes to give optimum space utilization for the container with 93.4% fitness difference percentage than the first generation’s fitness value.KeywordsSpace optimizationContainer loading problemGenetic algorithm
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
