Two-dimensionalirregularpolygonspackingproblemisverydifficulttobesolvedintraditionaloptimalway.Simulatedannealing(SA)algorithmisastochasticoptimizationtechniquethatcanbeusedtosolvepackingproblems.ThewholeprocessofSAisintroducedfirstlyinthispaper.AnextendedneighborhoodsearchingmethodinSAismainlyanalyzed.AgeneralmoduleofSAalgorithmisgivenandusedtolayouttheirregularpolygons.Thejudgmentofintersectionandotherconstrainsofirregularpolygonsareanalyzed.ThenanexamplethatwasusedinthepaperofStefanJakobsislisted.ResultsshowthatthisSAalgorithmshortensthecomputationtimeandimprovesthesolution.
