Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

Yigit, Vecihi; Aydin, Mehmet Emin; Turkbey, Orhan

Abstract

Uncapacitated Facility Location (UFL) Problems are, in general, modelled as mixed integer programming problems, which are known as NP-hard problems. In recent years, a few publications have appeared on the metaheuristics for solving UFL problems, discussing the performance of particular implementations of metaheuristics for small and middle size UFL benchmarks. The large-scale problems remain untouched. The approach presented in this paper attempts to tackle them with a metaheuristics combining two well-known approaches. The idea is to enable algorithm searching through solution space by taking advantage of both underlying approaches in order to avoid local minima. The power of simulated annealing (SA) in local search and that of the evolutionary approach in global search have been brought together to obtain the desired solution quality within a shorter time.

• Journal Article Type: Article
• Publication Date: Nov 15, 2006
• Journal: International Journal of Production Research
• Print ISSN: 0020-7543
• Electronic ISSN: 1366-588X
• Publisher: Taylor & Francis
• Peer Reviewed: Peer Reviewed
• Volume: 44
• Issue: 22
• Pages: 4773-4791
• DOI: https://doi.org/10.1080/00207540600621003
• Keywords: simulated annealing, uncapacitated facility locations, evolutionary algorithms
• Public URL: https://uwe-repository.worktribe.com/output/1045726
• Publisher URL: http://dx.doi.org/10.1080/00207540600621003