Title :
A Simulated Annealing Algorithm for Bi-Objective Noxious Network Location Problem Considering Dispersion and Total Cost
Author :
Bashiri, M. ; Hajfathaliha, A. ; Hejazi, Taha H.
Author_Institution :
Dept. of Ind. Eng., Shahed Univ., Tehran, Iran
Abstract :
This paper develops a model for determining locations of capacitated facilities on a network when the model is multicommodity. It is formulated as bi-objective since the problem of locating facilities faces many conflicting criteria. The objectives which used are related to total cost and dispersion of located facilities. Since these models are categorized in NP hard model, a simulated annealing (SA) algorithm was applied to solve problem. Also for converting bi-objective model to single objective a global criterion (GC) method was applied. At the end an example of model with numerical results are shown.
Keywords :
facility location; simulated annealing; NP hard model; biobjective noxious network location problem; capacitated facility location; global criterion method; multicommodity network model; simulated annealing; Computational modeling; Computer networks; Computer simulation; Costs; Hazardous materials; Industrial engineering; Numerical models; Simulated annealing; Space exploration; Supply chains; Capacitated Noxious network location problem; Global Criterion; Multi-objective programming; Multicommodity network model; Simulated Annealing;
Conference_Titel :
Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-1-4244-5642-0
Electronic_ISBN :
978-1-4244-5643-7
DOI :
10.1109/ICCMS.2010.414
