All Outputs (4)

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.

Variable neighbourhood search for job shop scheduling problems (2006)
Journal Article

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.