Mohd. Lokoman, Mardziah and Zainuddin, Zaitul Marlizawati and Mohamad, Mohd. Sham (2008) Solving obnoxious facility location problem using simulated annealing. Jurnal Karya Asli Lorekan Ahli Matematik (KALAM) , 1 (1). pp. 127-137. ISSN 1985-5222
Full text not available from this repository.
Obnoxious (undesirable) location models is a class of location problems in which customers no longer consider the facility desirable, but instead avoid the facility and stay away from it. In these problems the objective is to maximize the distance between the facility and a set of input points. Such facilities include chemical plants, garbage disposal sites, nuclear power stations, plants for treatment of residual waters, airports, etc. In this research, we will concentrate on solving uncapacitated discrete obnoxious facility location problems by using Simulated Annealing (SA). SA is distinguished to allow hill-climbing moves to help the local search escape from local minimum which has the flexibility of accepting non-improving moves with a certain probability. Tabu Search procedure is used in the SA algorithm in order to avoid taking the same point as the location of obnoxious facilities. SA implementation on the 50-fixed point problems taken from Eilon et al. (1971) is done by using Excel 2003.
|Uncontrolled Keywords:||simulated annealing, obnoxious facilities, tabu search|
|Subjects:||Q Science > Q Science (General)|
|Deposited By:||Norshiela Buyamin|
|Deposited On:||14 May 2009 09:35|
|Last Modified:||14 Feb 2017 08:33|
Repository Staff Only: item control page