A Jumping Gene Algorithm for Multiobjective Resource Management in Wideband CDMA Systems

Authors:
T. M. Chan;K. F. Man;K. S. Tang;S. Kwong
Affiliations:
Department of Electronic Engineering, City University of Hong Kong, Hong Kong;Department of Electronic Engineering, City University of Hong Kong, Hong Kong;Department of Electronic Engineering, City University of Hong Kong, Hong Kong;Department of Computer Science, City University of Hong Kong, 83, Tatchee Avenue, Kowloon, Hong Kong
Venue:
The Computer Journal
Year:
2005

Citing 0
Cited 5

Transgenetic algorithm: a new evolutionary perspective for heuristics design

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Gene transposon based clonal selection algorithm for clustering

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Multi-objective fuzzy clustering method for image segmentation based on variable-length intelligent optimization algorithm

ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
A jumping genes paradigm with fuzzy rules for optimizing digital IIR filters

ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II
Gene transposon based clone selection algorithm for automatic clustering

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a newly developed jumping genes evolutionary paradigm is proposed for optimizing the multiobjective resource management problem in direct sequence--wideband code division multiple access systems. This formulation enables both total transmission power and total transmission rate to be simultaneously optimized. Since these two objectives are conflicting in nature, a set of tradeoff non-dominated solutions could be obtained without violating the quality of service. This new algorithm has been statistically tested and compared with a number of various multiobjective evolutionary algorithms including the use of binary ε-indicator for classifying the capability in generating the quality of non-dominated solution sets. In addition, the capacity of finding a number of extreme solutions is an extra indication to show its ability to measure the diversity along the Pareto-optimal solution front in a unique fashion.