Item
Universitat de Girona. Escola PolitÃ¨cnica Superior  
TorrentFontbona, Ferran
MuÃ±oz SolÃ , VÃctor LÃ³pez IbÃ¡Ã±ez, Beatriz 

Immobile locationallocation (LA) problems is a type of LA problem that consists in determining the service each facility should offer in order to optimize some criterion (like the global demand), given the positions of the facilities and the customers. Due to the complexity of the problem, i.e. it is a combinatorial problem (where is the number of possible services and the number of facilities) with a nonconvex search space with several suboptimums, traditional methods cannot be applied directly to optimize this problem. Thus we proposed the use of clustering analysis to convert the initial problem into several smaller subproblems. By this way, we presented and analyzed the suitability of some clustering methods to partition the commented LA problem. Then we explored the use of some metaheuristic techniques such as genetic algorithms, simulated annealing or cuckoo search in order to solve the subproblems after the clustering analysis  
http://hdl.handle.net/2072/204337  
eng  
AttributionNonCommercialNoDerivs 3.0 Spain  
http://creativecommons.org/licenses/byncnd/3.0/es/  
Algorismes genÃ¨tics
Computer algorithms SoluciÃ³ de problemes Problem solving AnÃ lisi de conglomerats Cluster analysis OptimitzaciÃ³ matemÃ tica Mathematical optimization 

Decision Support Methods for Global Optomization  
info:eurepo/semantics/masterThesis  
Recercat 