• DocumentCode
    3661531
  • Title

    Packing equal circles in a damaged square

  • Author

    Xinyi Zhuang; Ling Yan; Liang Chen

  • Author_Institution
    Department of Computer Science, University of Northern British Columbia, Prince George, Canada
  • fYear
    2015
  • fDate
    7/1/2015 12:00:00 AM
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    This paper proposes a Simulated Annealing enhanced Greed Vacancy Search Algorithm (eGVXSA) for solving packing equal circles in a damaged square. The damaged area is consisted of a number of small square regions that are randomly distributed within the container. The benefits present at its efficiency of consuming limited space. For this problem, Experiments have shown the efficiency over the original Greedy Vacancy Search Algorithm.
  • Keywords
    "Complexity theory","Annealing","Search problems"
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks (IJCNN), 2015 International Joint Conference on
  • Electronic_ISBN
    2161-4407
  • Type

    conf

  • DOI
    10.1109/IJCNN.2015.7280846
  • Filename
    7280846
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3661531