Abstract
In this paper we have analysed the bin packing problem by applying Genetic Algorithm (GA). In this analysis we have represented the problem as an optimization problem and considered the objective function as fitness function for GA. The numerical results obtained from the GA indicate that the GA is robust and it yields better results when compared with the results obtained from other heuristics such as First Fit Decreasing (FFD) and Best Fit Decreasing (BFD)
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.
