All Outputs (6)

Mathematical modelling and comparisons of four heuristic optimization algorithms for WCDMA radio network planning (2006)
Conference Proceeding
Zhang, J., Yang, J., Aydin, M. E., & Wu, J. Y. (2006). Mathematical modelling and comparisons of four heuristic optimization algorithms for WCDMA radio network planning. In 2006 International Conference on Transparent Optical Networks (253-257). https://doi.org/10.1109/ICTON.2006.248446

In order to obtain accurate and reliable network planning and optimization results. The characteristics of WCDMA networks such as power control, soft handover (SHO) and the strong couplings between coverage and capacity have to be modelled accurately... Read More about Mathematical modelling and comparisons of four heuristic optimization algorithms for WCDMA radio network planning.

Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (2006)
Journal Article
Yigit, V., Aydin, M. E., & Turkbey, O. (2006). Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing. International Journal of Production Research, 44(22), 4773-4791. https://doi.org/10.1080/00207540600621003

Uncapacitated Facility Location (UFL) Problems are, in general, modelled as mixed integer programming problems, which are known as NP-hard problems. In recent years, a few publications have appeared on the metaheuristics for solving UFL problems, dis... Read More about Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing.

An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing (2006)
Journal Article
Kwong, C. K., Chan, K. Y., Aydin, M. E., & Fogarty, T. C. (2006). An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing. International Journal of Production Research, 44(22), 4815-4836. https://doi.org/10.1080/00207540600620880

Fluid dispensing is a popular process in the semiconductor manufacturing industry, commonly being used in die-bonding as well as microchip encapsulation of electronic packaging. Modelling the fluid dispensing process is important to understanding the... Read More about An orthogonal array based genetic algorithm for developing neural network based process models of fluid dispensing.

Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems (2006)
Journal Article
Chan, K. Y., Aydin, M. E., & Fogarty, T. C. (2006). Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems. Soft Computing, 10(11), 1075-1090. https://doi.org/10.1007/s00500-005-0044-4

In both genetic algorithms (GAs) and simulated annealing (SA), solutions can be represented by gene representation. Mutation operator in GA and neighborhood function in SA are used to explore the solution space. They usually select genes for performi... Read More about Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems.

A variable neighbourhood search algorithm for job shop scheduling problems (2006)
Journal Article
Sevkli, M., & Aydin, M. E. (2006). A variable neighbourhood search algorithm for job shop scheduling problems. Lecture Notes in Artificial Intelligence, 3906 LNCS, 261-271. https://doi.org/10.1007/11730095_22

Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood within a local search is carried out. In this paper, a variable neighbourh... Read More about A variable neighbourhood search algorithm for job shop scheduling problems.

Variable neighbourhood search for job shop scheduling problems (2006)
Journal Article
Sevkli, M., & Aydin, M. E. (2006). Variable neighbourhood search for job shop scheduling problems. Journal of Software, 1(2), 34-39. https://doi.org/10.4304/jsw.1.2.34-39

Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried out. In this paper, an investigation on implementing VNS for job shop... Read More about Variable neighbourhood search for job shop scheduling problems.