Solving channel assignment problem for mobile communication with soft computing

In industry, agriculture and economy, we often encounter constrained optimization problems. One common way to deal with these problems is to transform the constrained optimization problems into unconstrained ones by introducing a penalty function, which is controlled by a number of penalty coefficie...

全面介紹

Saved in:
書目詳細資料
主要作者: Gu, Wen
其他作者: Wang Lipo
格式: Theses and Dissertations
出版: 2008
主題:
在線閱讀:https://hdl.handle.net/10356/4328
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
實物特徵
總結:In industry, agriculture and economy, we often encounter constrained optimization problems. One common way to deal with these problems is to transform the constrained optimization problems into unconstrained ones by introducing a penalty function, which is controlled by a number of penalty coefficients into the objective function.. However, how to set the penally coefficients turns out to be a difficult problem itself [16]! Stochastic ranking is a novel constraint-handling technique proposed by P.T. Runarsson and Xin Yao. Applying this technique for constrained evolutionary make us do not need to determine the hard-setting penalty coefficients. We demonstrate this novel approach with one difficult combinatorial optimization problem, i.e., the channel assignment problem for cellular mobile communications.