DUGiDocsExploring Genetic Algorithms and Simulated Annealing for Immobile Location-Allocation Problem
dc.contributor.author
dc.date.accessioned
2012-11-28T10:55:51Z
dc.date.available
2012-11-28T10:55:51Z
dc.date.issued
2012
dc.identifier.isbn
978-1-61499-138-0
dc.identifier.uri
dc.description
Artificial Intelligence Research and Development - Proceedings of the 15th International Conference of the Catalan Association for Artificial Intelligence
dc.description.abstract
In this paper we introduce a new kind of immobile Location-Allocation problem that consists in determining the service each facility has to offer in order to maximize the covered demand given the positions of the customers and their service requirements and the positions of the immobile facilities. First, we provide a formalization of the problem and then we tackle the problem using two heuristic methods, genetic algorithms and simulated annealing, comparing the performance of both algorithms
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
IOS Press
dc.relation.isformatof
Versió postprint del document publicat a: http://dx.doi.org/10.3233/978-1-61499-139-7-163
dc.relation.ispartof
© Frontiers in Artificial Intelligence and Applications, 2012, vol. 248
dc.relation.ispartofseries
Articles publicats (D-EEEiA)
dc.rights
Tots els drets reservats
dc.subject
dc.title
Exploring Genetic Algorithms and Simulated Annealing for Immobile Location-Allocation Problem
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.type.version
info:eu-repo/semantics/acceptedVersion
dc.identifier.doi