dc.contributor.author
Torrent-Fontbona, Ferran
dc.contributor.author
Muñoz Solà, Víctor
dc.contributor.author
López Ibáñez, Beatriz
dc.date.accessioned
2024-06-18T14:38:18Z
dc.date.available
2024-06-18T14:38:18Z
dc.identifier
http://hdl.handle.net/10256/7310
dc.identifier.uri
http://hdl.handle.net/10256/7310
dc.description.abstract
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
application/pdf
dc.relation
info:eu-repo/semantics/altIdentifier/doi/10.3233/978-1-61499-139-7-163
dc.relation
info:eu-repo/semantics/altIdentifier/isbn/978-1-61499-138-0
dc.rights
Tots els drets reservats
dc.rights
info:eu-repo/semantics/openAccess
dc.source
© Frontiers in Artificial Intelligence and Applications, 2012, vol. 248
dc.source
Articles publicats (D-EEEiA)
dc.subject
Algorismes genètics -- Congressos
dc.subject
Optimització matemàtica -- Congressos
dc.subject
Control automàtic -- Congressos
dc.subject
Solució de problemes -- Congressos
dc.subject
Mathematical optimization -- Congresses
dc.subject
Computer algorithms -- Congresses
dc.subject
Automatic control -- Congresses
dc.subject
Problem solving -- Congresses
dc.title
Exploring Genetic Algorithms and Simulated Annealing for Immobile Location-Allocation Problem
dc.type
info:eu-repo/semantics/article
dc.type
info:eu-repo/semantics/acceptedVersion
