Main Effect Fine-tuning of the Mutation Operator and the Neighbourhood Function for Uncapacitated Facility Location Problems

Authors:
Kit Yan Chan;M. Emin Aydin;Terence C. Fogarty
Affiliations:
Faculty of Business, Computing and Information Management, London South Bank University, 103 Borough Road, SE1 0AA, London, UK;Faculty of Business, Computing and Information Management, London South Bank University, 103 Borough Road, SE1 0AA, London, UK;Faculty of Business, Computing and Information Management, London South Bank University, 103 Borough Road, SE1 0AA, London, UK
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2006

Citing 0
Cited 5

Annealing-based particle swarm optimization to solve the redundant reliability problem with multiple component choices

Applied Soft Computing
A hybrid intelligent model for order allocation planning in make-to-order manufacturing

Applied Soft Computing
Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm

Applied Soft Computing
Self-Optimization module for Scheduling using Case-based Reasoning

Applied Soft Computing
Social-Based Algorithm (SBA)

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 performing mutation. The rate of selection of genes can be called mutation rate. However, randomly selecting genes may not be the best way for both algorithms. This paper describes how to estimate the main effect in genes representation. The resulting estimates cannot only be used to understand the domination of gene representation, but also employed to fine-tune the mutation rate in both the mutation operator in the GA and the neighborhood function in the SA. It has been demonstrated the use of the proposed methods for solving uncapacitated facility location problems and discuss the examination of the proposed methods with some useful comparisons with both the latest developed GA and SA for solving this problem. For many well-known benchmark problems, the proposed methods yield better results in solution quality than the previously used methods.