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...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Gu, Wen
مؤلفون آخرون: Wang Lipo
التنسيق: Theses and Dissertations
منشور في: 2008
الموضوعات:
الوصول للمادة أونلاين:https://hdl.handle.net/10356/4328
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
id sg-ntu-dr.10356-4328
record_format dspace
spelling sg-ntu-dr.10356-43282023-07-04T17:18:31Z Solving channel assignment problem for mobile communication with soft computing Gu, Wen Wang Lipo School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems 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. MASTER OF ENGINEERING (EEE) 2008-09-17T09:49:20Z 2008-09-17T09:49:20Z 2005 2005 Thesis Gu, W. (2005). Solving channel assignment problem for mobile communication with soft computing. Master’s thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/4328 10.32657/10356/4328 Nanyang Technological University application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
topic DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Wireless communication systems
Gu, Wen
Solving channel assignment problem for mobile communication with soft computing
description 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.
author2 Wang Lipo
author_facet Wang Lipo
Gu, Wen
format Theses and Dissertations
author Gu, Wen
author_sort Gu, Wen
title Solving channel assignment problem for mobile communication with soft computing
title_short Solving channel assignment problem for mobile communication with soft computing
title_full Solving channel assignment problem for mobile communication with soft computing
title_fullStr Solving channel assignment problem for mobile communication with soft computing
title_full_unstemmed Solving channel assignment problem for mobile communication with soft computing
title_sort solving channel assignment problem for mobile communication with soft computing
publishDate 2008
url https://hdl.handle.net/10356/4328
_version_ 1772827254781378560