Wong Y.C.Prof. LEUNG Kwong SakWong C.K.2023-03-292023-03-292000IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, 2000, vol. 30 ( 4), pp. 506 - 51610946977http://hdl.handle.net/20.500.11861/7662Simulated annealing is a robust and easy-to-implement algorithm for material simulation. However, it consumes a huge amount of computational time, especially on the studies of percolation networks. To reduce the running time, we parallelize the simulated annealing algorithm in our studies of the thermoelastic scaling behavior of percolation networks. The critical properties of the thermoelastic moduli of percolation networks near the threshold pc are investigated by constructing a square percolation network. The properties are tested by simulations of a series of two-dimensional (2-D) percolation networks near pc. The simulations are performed using a novel parallelizing scheme on the simulated annealing algorithm. To further accelerate the computational speed, we also propose a new conjectural method to generate better initial configurations, which speeds up the simulation significantly. Preliminary simulation results show surprisingly that the percolating phenomenon of thermal expansion does exist under certain conditions. The behavior seems to be governed by the elastic properties of a percolation network.enSimulated AlgorithmConjectureParallelizationThermal ExpansionNetwork PropertiesSimulated AnnealingSimulated Annealing AlgorithmPercolation NetworkObjective FunctionYoung’s ModulusProbability Density FunctionResults In CasesAnnealing TemperatureGrid PointsPoisson’s RatioThermal CoefficientNetwork ConfigurationValue of NodeBond NetworkLinker LengthSquare LatticeDifferent Kinds of MaterialsInternal StressNodal CoordinatesPseudo-Random NumberStress ComponentsHigh-Quality ResultsChain LengthParallel AlgorithmPeer Reviewed Journal Article10.1109/5326.897077