Outputs (101)

A novel programming model and optimisation algorithms for WCDMA networks (2007)
Presentation / Conference Contribution

To obtain a good trade-off between accuracy and the computational load of WCDMA (wideband code-division multiple access) network planning and optimisation, link-level performance factors such as the impact of soft handover and fast power control need... Read More about A novel programming model and optimisation algorithms for WCDMA networks.

Optimisation of WCDMA radio networks with consideration of link-level performance factors (2007)
Journal Article

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.

A study on programming model and heuristic optimization algorithms for WCDMA radio networks (2007)
Presentation / Conference Contribution

The 3 Generation (3G) cellular networks, such as WCDMA (wideband code-division multiple access) networks, require accurate network planning and optimization. However, the planning and optimization of WCDMA radio network, which is a highly dynamic an... Read More about A study on programming model and heuristic optimization algorithms for WCDMA radio networks.

Parallel variable neighbourhood search algorithms for job shop scheduling problems (2007)
Presentation / Conference Contribution

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.

A comparative investigation on heuristic optimization of WCDMA radio networks (2007)
Presentation / Conference Contribution

The planning and optimization of WCDMA (wideband code-division multiple access)radio network issues remain vital, and are carried out using static snapshot-based simulation. To improve the accuracy of the static simulation, link-level performance fac... Read More about A comparative investigation on heuristic optimization of WCDMA radio networks.

Mathematical modelling and comparisons of four heuristic optimization algorithms for WCDMA radio network planning (2006)
Presentation / Conference Contribution

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

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

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

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)
Presentation / Conference Contribution

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.