DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorPlastria, Franken
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:57Z-
dc.date.available2020-05-01T20:13:57Z-
dc.date.issued2005-01-01en
dc.identifier.issn0305-0548en
dc.description.abstractSeveral years ago classical Euclidean geometry problems of densest packing of circles in the plane have been formulated as nonconvex optimization problems, allowing to find heuristic solutions by using any available NLP solver. In this paper we try to improve this procedure. The faster NLP solvers use first order information only, so stop in a stationary point. A simple switch from Cartesian coordinates to polar or vice versa, may destroy this stationarity and allow the solver to descend further. Such formulation switches may of course be iterated. For densest packing of equal circles into a unit circle, this simple feature turns out to yield results close to the best known, while beating second order methods by a time-factor well over 100. This technique is formalized as a general reformulation descent (RD) heuristic, which iterates among several formulations of the same problem until local searches obtain no further improvement. We also briefly discuss how RD might be used within other metaheuristic schemes.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Sciences, Project 1583-
dc.relation.ispartofComputers and Operations Researchen
dc.subjectCircle packing | Global optimization | Metaheuristics | Minos | Reformulation descenten
dc.titleReformulation descent applied to circle packing problemsen
dc.typeArticleen
dc.identifier.doi10.1016/j.cor.2004.03.010en
dc.identifier.scopus2-s2.0-12344328686en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage2419en
dc.relation.lastpage2434en
dc.relation.issue9en
dc.relation.volume32en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

67
checked on Nov 28, 2022

Page view(s)

32
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.