Evolutionary simulated annealing algorithms for uncapacitated facility location problems
Özet
Simulated annealing (SA) is one of the potentially powerful probabilistic metaheuristics to solve large-scale combinatorial optimisation problems. The main drawback with this metaheuristic is its time consuming nature, although it gives more confidence to reach the global optimum. The aim of this paper is to examine an evolutionary approach to simulated annealing for Uncapacitated Facility Location (UFL) problems with some useful comparisons with the latest genetic algorithm approach by Jaramillo et al [17]. The approach presented in this paper seeks to combine the power of both SA and the evolutionary approach to get a desirable quality of solution within a shorter time. For this purpose, SA is incorporated with evolutionary approach in order to cut down the processing time needed.
Atıf için künye
Yiğit, V., Aydin, M., & Turkbey, O. (2004). Evolutionary simulated annealing algorithms for uncapacitated facility location problems. 6th Evolutionary/Adaptive Computing Conference, Bristol (ss. 185–194). https://doi.org/10.1007/978-0-85729-338-1_16
BibTeX
@inproceedings{yigit2004-182502,
author = {Yiğit, Vecihi and Aydin, ME and Turkbey, O},
title = {Evolutionary simulated annealing algorithms for uncapacitated facility location problems},
booktitle = {6th Evolutionary/Adaptive Computing Conference},
address = {Bristol},
year = {2004},
pages = {185--194},
doi = {10.1007/978-0-85729-338-1_16},
url = {https://akademik.atauni.edu.tr/yayinlar/182502-evolutionary-simulated-annealing-algorithms-for-uncapacitated-facility-location}
}