DocumentCode
2669887
Title
Model and solution for capacitated facility location problem
Author
Yu, Hongtao ; Gao, Liqun ; Lei, Yanhua
Author_Institution
Autom. Eng., Shenyang Inst. of Eng., Shenyang, China
fYear
2012
fDate
23-25 May 2012
Firstpage
1773
Lastpage
1776
Abstract
This paper presents a new model for capacitated facility location problem, where serve radius and economic benefit are considered. In the new model, the objective is to maximize the total return investment. However, the objective for multiple knapsack problem is to maximize the total profit. So the capacitated facility location problem can be translated into multiple knapsack problem. Because this problem is difficult to solve, we propose a hybrid harmony search algorithm, which incorporates harmony search algorithm with greedy algorithm. Numerical results from computational experiments are presented and analyzed.
Keywords
facility location; greedy algorithms; investment; knapsack problems; search problems; capacitated facility location problem; economic benefit; greedy algorithm; hybrid harmony search algorithm; multiple knapsack problem; serve radius; total return investment; Computers; Greedy algorithms; Investments; Optimization; Search problems; Transportation; Vectors; Capacitated; Facility location; Harmony search algorithm; Knapsack problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (CCDC), 2012 24th Chinese
Conference_Location
Taiyuan
Print_ISBN
978-1-4577-2073-4
Type
conf
DOI
10.1109/CCDC.2012.6244284
Filename
6244284
Link To Document