All Outputs (4)

UMTS base station location planning: A mathematical model and heuristic optimisation algorithms (2007)
Journal Article
Yang, J., Aydin, M. E., Zhang, J., & Maple, C. (2007). UMTS base station location planning: A mathematical model and heuristic optimisation algorithms. IET Communications, 1(5), 1007-1014. https://doi.org/10.1049/iet-com%3A20060495

Radio networks of universal mobile telecommunication system (UMTS) need accurate planning and optimisation, and many factors not seen in second generation (2G) networks must be considered. However, planning and optimisation of UMTS radio networks are... Read More about UMTS base station location planning: A mathematical model and heuristic optimisation algorithms.

Metaheuristic agent teams for job shop scheduling problems (2007)
Journal Article
Aydin, M. E. (2007). Metaheuristic agent teams for job shop scheduling problems. Lecture Notes in Artificial Intelligence, 4659, 185-194. https://doi.org/10.1007/978-3-540-74481-8_18

This paper addresses and introduces an overview on various multi-agent architectures applied to teams of metaheuristic agents for job shop scheduling applications, whose developed and examined on distributed problem solving environments. We reported... Read More about Metaheuristic agent teams for job shop scheduling problems.

Optimisation of WCDMA radio networks with consideration of link-level performance factors (2007)
Journal Article
Yang, J., Zhang, J., Aydin, M. E., & Wu, J. Y. (2007). Optimisation of WCDMA radio networks with consideration of link-level performance factors. International Journal of Mobile Network Design and Innovation, 2(1), 26-32. https://doi.org/10.1504/IJMNDI.2007.013801

Accuracy and the computational load are two important issues of Wideband Code-Division Multiple Access (WCDMA) network planning and optimisation. Link-level performance factors such as the impact of Soft Handover (SHO) and fast power control need to... Read More about Optimisation of WCDMA radio networks with consideration of link-level performance factors.

Parallel variable neighbourhood search algorithms for job shop scheduling problems (2007)
Journal Article
Sevkli, M., & Aydin, M. E. (2007). Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA Journal of Management Mathematics, 18(2), 117-133. https://doi.org/10.1093/imaman/dpm009

Variable neighbourhood search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood with a local search is carried out. However, as happens with other metaheu... Read More about Parallel variable neighbourhood search algorithms for job shop scheduling problems.