Show simple item record

dc.contributor.authorAlbrecht, A.
dc.contributor.authorCheung, S.K.
dc.contributor.authorLeung, K.S.
dc.contributor.authorWong, C.K.
dc.date.accessioned2011-02-21T09:18:58Z
dc.date.available2011-02-21T09:18:58Z
dc.date.issued2001
dc.identifier.citationAlbrecht , A , Cheung , S K , Leung , K S & Wong , C K 2001 , ' On the convergence of inhomogeneous Markov chains : Approximating equilibrium placements of flexible objects ' , Computational Optimization and Applications , vol. 19 , no. 2 , pp. 179-208 . https://doi.org/10.1023/A:1011241620180
dc.identifier.issn0926-6003
dc.identifier.otherPURE: 99184
dc.identifier.otherPURE UUID: 722e0cfe-6633-4192-ac5b-025f8febe020
dc.identifier.otherdspace: 2299/5350
dc.identifier.otherScopus: 0035398517
dc.identifier.urihttp://hdl.handle.net/2299/5350
dc.descriptionThe original publication is available at www.springerlink.com Copyright Springer [Full text of this article is not available in the UHRA]
dc.description.abstractThis paper deals with the minimization of local forces in two-dimensional placements of flexible objects within rigid boundaries. The objects are disks of the same size but, in general, of different materials. Potential applications include the design of new amorphous polymeric and related granular materials as well as the design of package cushioning systems. The problem is considered on a grid structure with a fixed step size w and for a fixed diameter of the discs, i.e., the number of placed disks may increase as the size of the placement region increases. The near-equilibrium configurations have to be calculated from uniformly distributed random initial placements. The final arrangements of disks must ensure that any particular object is deformed only within the limits of elasticity of the material. The main result concerns -approximations of the probability distribution on the set of equilibrium placements. Under a natural assumption about the configuration space, we prove that a run-time of n+logO(1)(1/} is sufficient to approach with probability 1 – the minimum value of the objective function, where depends on the maximum of the escape depth of local minima within the underlying energy landscape. The result is derived from a careful analysis of the interaction among probabilities assigned to configurations from adjacent distance levels to minimum placements. The overall approach for estimating the convergence rate is relatively independent of the particular placement problem and can be applied to various optimization problems with similar properties of the associated landscape of the objective function.en
dc.language.isoeng
dc.relation.ispartofComputational Optimization and Applications
dc.subjectMarkov chains
dc.subjectplacement problems
dc.subjectflexible objects
dc.subjectstochastic algorithms
dc.subjectsimulated annealing
dc.subjectcomposite materials
dc.titleOn the convergence of inhomogeneous Markov chains : Approximating equilibrium placements of flexible objectsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.description.statusPeer reviewed
rioxxterms.versionofrecordhttps://doi.org/10.1023/A:1011241620180
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record