KUET Institutional Repository

Population Based Heuristics Approaches for Packing Circles in a Circular Container

Show simple item record

dc.contributor.advisor Jamali, Prof. Dr. A. R. M Jalal Uddin
dc.contributor.author Alam, Md. Asadul
dc.date.accessioned 2018-08-14T04:17:20Z
dc.date.available 2018-08-14T04:17:20Z
dc.date.copyright 2014
dc.date.issued 2014-01
dc.identifier.other ID 1051553
dc.identifier.uri http://hdl.handle.net/20.500.12228/383
dc.description This thesis is submitted to the Department of Mathematics, Khulna University of Engineering & Technology in partial fulfillment of the requirements for the degree of Master of Philosophy in Mathematics, January 2014. en_US
dc.description Cataloged from PDF Version of Thesis.
dc.description Includes bibliographical references (pages 62-67).
dc.description.abstract In this Thesis we mainly deal with packing problems. Packing problems have mathematical as well as practical application point of interest. Population based heuristic algorithms like Evolutionary algorithm, Genetic algorithms etc. frequently used for such Non Polynomial (NP) hard problems. But packing circles into a circular container is relatively new. Here, we present Population based Basin Hopping (PBH) rather than Monotonic heuristic search approach like Monotonic Basin Hopping (MBH) to solve the problem of packing identical circles within a minimum size of circular container. For the evolution among the population we will also present two dissimilarity measures. Extensive computational experiments have been performed for analyzing the problem as well as for choosing an appropriate way the parameter values for the proposed methods. From the experiments, It is observed that the population based basin hopping approach is comparable for solving packing problem. Moreover when the problem has many narrow basin, then population based basin hopping may perform better than MBH approach. Also several improvements with respect to the best results reported in the literature have been detected. It is worthwhile to mention here that MBH heuristic approaches are successfully implemented for solving equal circles problems. For the presence of combinatorial part, due to unequal radii, simple extension of MBH approach is not the appropriate way to co-opt the problem of packing nonidentical circles within a smallest circular container. Here, we present a modified Monotonic Basin Hopping heuristic approach to solve the problem. As well as some new perturbation moves are proposed which are suitable for the case of unequal circles packing problems. Several improvements with respect to the best results reported in the literature have been detected. en_US
dc.description.statementofresponsibility Md. Asadul Alam
dc.format.extent 67 pages
dc.language.iso en_US en_US
dc.publisher Khulna University of Engineering & Technology (KUET), Khulna, Bangladesh. en_US
dc.rights Khulna University of Engineering & Technology (KUET) thesis/dissertation/internship reports are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subject Packing Circles en_US
dc.subject Circular Container en_US
dc.subject Non Polynomial (NP) Hard Problems en_US
dc.title Population Based Heuristics Approaches for Packing Circles in a Circular Container en_US
dc.type Thesis en_US
dc.description.degree Master of Philosophy in Mathematics
dc.contributor.department Department of Mathematics


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search KUET IR


Advanced Search

Browse

My Account

Statistics