Solving large immobile location-allocation by affinity propagation and simulated annealing. Application to select which sporting event to watch

Authors:
F. Torrent-Fontbona;V. MuñOz;B. LóPez
Affiliations:
eXiT Research Group, Institute of Informatics and Applications, University of Girona, Campus Montilivi, Building P4, 17071 Girona, Spain;Newronia S.L., Parc Científic i Tecnològic, Building Narcís Montoriol, 17071 Girona, Spain;eXiT Research Group, Institute of Informatics and Applications, University of Girona, Campus Montilivi, Building P4, 17071 Girona, Spain
Venue:
Expert Systems with Applications: An International Journal
Year:
2013

Citing 2
Cited 0

Studies on the performance of a heuristic algorithm for static and transportation facility location allocation problem

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Genetic application in a facility location problem with random demand within queuing framework

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	12.05

Visualization

Abstract

Immobile Location-Allocation (ILA) is a combinatorial problem which consists in, given a set of facilities and a set of demand points, determining the optimal service each facility has to offer and allocating the demand to such facilities. The applicability of optimization methods is tied up to the dimensionality of the problem, but since the distance between data points is a key factor, clustering techniques to partition the data space can be applied, converting the large initial problem into several simpler ILA problems that can be solved separately. This paper presents a novel method that combines clustering and heuristic methods to solve an ILA problem, which reduces the elapsed time keeping the quality of the solution found compared with other heuristics methods.