Cheung S.K.Prof. LEUNG Kwong SakAlbrecht A.Wong C.K.2023-03-302023-03-301998Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1998, vol. 1498 LNCS, pp. 968 - 9773540650784978-354065078-203029743http://hdl.handle.net/20.500.11861/7679This paper deals with the computation of equilibrium states for the placement of flexible objects within a rigid boundary. The equilibrium states have to be calculated from uniformly distributed random initial placements. The final placements must ensure that any particular object is deformed only within the limit of elasticity of the material. A simulated annealing approach has been proposed and implemented in [2] to solve the problem. In this study, an adaptive simulated annealing algorithm is proposed with time complexity upper bounded by 0(n·ln2n). The general approach is to determine at a given temperature and a given grid size whether the optimization has achieved a stable state, which will be defined later. The temperature and the grid size are then decreased adaptively. In terms of both run-time and final force of the placement, better results are obtained when compared with those obtained in [2].enSimulated AnnealingGrid SizeGrid NodeResultant ForceSimulated Annealing AlgorithmPeer Reviewed Journal Article10.1007/bfb0056938