Skip to main content

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

Buy Article:

$55.00 plus tax (Refund Policy)

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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: Evolutionary algorithms; Simulated annealing; Uncapacitated facility locations

Document Type: Research Article

Affiliations: 1: Department of Industrial Engineering, Ataturk University, Erzurum, Turkey 2: Faculty of Business, Computing and Information Management, London South Bank University, London, UK 3: Department of Industrial Engineering, Gazi University, Ankara, Turkey

Publication date: 2006-11-15

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more