@article{ART001004992},
author={Junha Hwang},
title={Neighborhood Search Algorithms for the Maximal Covering Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2006},
volume={11},
number={1},
pages={129-138}
TY - JOUR
AU - Junha Hwang
TI - Neighborhood Search Algorithms for the Maximal Covering Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2006
VL - 11
IS - 1
PB - The Korean Society Of Computer And Information
SP - 129
EP - 138
SN - 1598-849X
AB - Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.
KW - neighborhood search(이웃해 탐색);hill-climbing search(언덕오르기 탐색);simulated annealing(시뮬레이티드 어닐링);maximal covering problem(maximal covering 문제)
DO -
UR -
ER -
Junha Hwang. (2006). Neighborhood Search Algorithms for the Maximal Covering Problem. Journal of The Korea Society of Computer and Information, 11(1), 129-138.
Junha Hwang. 2006, "Neighborhood Search Algorithms for the Maximal Covering Problem", Journal of The Korea Society of Computer and Information, vol.11, no.1 pp.129-138.
Junha Hwang "Neighborhood Search Algorithms for the Maximal Covering Problem" Journal of The Korea Society of Computer and Information 11.1 pp.129-138 (2006) : 129.
Junha Hwang. Neighborhood Search Algorithms for the Maximal Covering Problem. 2006; 11(1), 129-138.
Junha Hwang. "Neighborhood Search Algorithms for the Maximal Covering Problem" Journal of The Korea Society of Computer and Information 11, no.1 (2006) : 129-138.
Junha Hwang. Neighborhood Search Algorithms for the Maximal Covering Problem. Journal of The Korea Society of Computer and Information, 11(1), 129-138.
Junha Hwang. Neighborhood Search Algorithms for the Maximal Covering Problem. Journal of The Korea Society of Computer and Information. 2006; 11(1) 129-138.
Junha Hwang. Neighborhood Search Algorithms for the Maximal Covering Problem. 2006; 11(1), 129-138.
Junha Hwang. "Neighborhood Search Algorithms for the Maximal Covering Problem" Journal of The Korea Society of Computer and Information 11, no.1 (2006) : 129-138.
