Density based problem space search for the capacitated clustering p-median problem

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Ahmadi, Samad en
dc.contributor.author Osman, Ibrahim H. en
dc.date.accessioned 2008-11-24T13:57:18Z
dc.date.available 2008-11-24T13:57:18Z
dc.date.issued 2004-10-01 en
dc.identifier.citation Ahmadi, 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.issn 1572-9338 en
dc.identifier.uri http://hdl.handle.net/2086/256
dc.description This 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.iso en en
dc.publisher Springer Verlag en
dc.subject RAE 2008
dc.subject UoA 23 Computer Science and Informatics
dc.subject greedy density search
dc.subject metaheuristics
dc.title Density based problem space search for the capacitated clustering p-median problem en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.1023/B:ANOR.0000039511.61195.21 en
dc.researchgroup Software Technology Research Laboratory (STRL)


Files in this item

This item appears in the following Collection(s)

Show simple item record