Show simple item record

dc.contributor.authorAhmadi, Samaden
dc.contributor.authorOsman, Ibrahim H.en
dc.date.accessioned2008-11-24T13:57:18Z
dc.date.available2008-11-24T13:57:18Z
dc.date.issued2004-10-01en
dc.identifier.citationAhmadi, S. and Osman, I.H. (2004) Density based problem space search for the capacitated clustering p-median problem. Annals of Operations Research, 131(1-4), pp. 21-43.
dc.identifier.issn1572-9338en
dc.identifier.urihttp://hdl.handle.net/2086/256
dc.descriptionThis paper proposes a clever and efficient constructive algorithm for the Capacitated Clustering Problem and a new search space for this problem based on perturbation vectors to the data vectors. Our density constructive algorithm finds 7 optimal solutions for benchmarks from the literature. Our problem space search extends the Storers problem space search idea to provide an alternative search space for the problem which is generated by applying our high quality constructive algorithm to the perturbated data. We also propose a general framework for building efficient heuristics, by adding elements of adaptive computation and periodic construction-deconstruction concepts within the constructive heuristics.en
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.subjectRAE 2008
dc.subjectUoA 23 Computer Science and Informatics
dc.subjectgreedy density search
dc.subjectmetaheuristics
dc.titleDensity based problem space search for the capacitated clustering p-median problemen
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1023/B:ANOR.0000039511.61195.21en
dc.researchgroupSoftware Technology Research Laboratory (STRL)


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