Skip to main content

Research Repository

Advanced Search

All Outputs (4)

Genetic algorithms with dynamic mutation rates and their industrial applications (2008)
Journal Article
Chan, K. Y., Fogarty, T. C., Aydin, M. E., Ling, S. H., & Iu, H. H. (2008). Genetic algorithms with dynamic mutation rates and their industrial applications. International Journal of Computational Intelligence and Applications, 7(2), 103-128. https://doi.org/10.1142/S1469026808002211

This paper presents a method on how to estimate main effects of gene representation. This estimate can be used not only to understand the domination of genes in the representation but also to design the mutation rate in genetic algorithms (GAs). A ne... Read More about Genetic algorithms with dynamic mutation rates and their industrial applications.

A particle swarm optimization algorithm for multiuser scheduling in HSDPA (2008)
Conference Proceeding
Aydin, M. E., Kwan, R., Leung, C., & Zhang, J. (2008). A particle swarm optimization algorithm for multiuser scheduling in HSDPA. In Ant Colony Optimization and Swarm Intelligence (395-396). https://doi.org/10.1007/978-3-540-87527-7_42

This paper briefs the problem of optimal multiuser scheduling in HSDPA. The modulation and coding schemes (MCSs), numbers of multicodes and power levels for all users are jointly optimized at each scheduling period, given that only limited Channel Qu... Read More about A particle swarm optimization algorithm for multiuser scheduling in HSDPA.

Multiuser scheduling in HSDPA using simulated annealing (2008)
Conference Proceeding
Kwan, R., Aydin, M. E., Leung, C., & Zhang, J. (2008). Multiuser scheduling in HSDPA using simulated annealing. In 2008 International Wireless Communications and Mobile Computing Conference. , (236-241). https://doi.org/10.1109/IWCMC.2008.42

In this paper, the issue of multiuser scheduling in the context of the High Speed Downlink Packet Access (HSDPA) is addressed. Given limited radio resources at the base station, the main challenge is to assign these resources to multiple users at eac... Read More about Multiuser scheduling in HSDPA using simulated annealing.

Sequential and parallel variable neighborhood search algorithms for job shop scheduling (2008)
Book Chapter
Aydin, M. E., & Sevkli, M. (2008). Sequential and parallel variable neighborhood search algorithms for job shop scheduling. In F. Xhafa, & A. Abraham (Eds.), Metaheuristics for Scheduling in Industrial and Manufacturing Applications (125-144). Springer Verlag. https://doi.org/10.1007/978-3-540-78985-7_6

Variable Neighborhood Search (VNS) is a recently invented metaheuristic to use in solving combinatorial optimization problems in which a systematic change of neighborhood with a local search is carried out. However, as happens with other meta-heurist... Read More about Sequential and parallel variable neighborhood search algorithms for job shop scheduling.