GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS

DOI10.1142/S1469026808002211zbMath1178.68534OpenAlexW1976256492MaRDI QIDQ3631235

Kit Yan Chan, M. Emin Aydin, Terence C. Fogarty, Herbert Ho Ching Iu, Sai Ho Ling

Publication date: 5 June 2009

Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1469026808002211

zbMATH Keywords

genetic algorithmsevolutionary algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Genetic Algorithm and Direct Search Toolbox

Cites Work

• Unnamed Item
• Adapting polyhedral properties from facility to hub location problems
• Genetic algorithms and traveling salesman problems
• A genetic algorithm for the set covering problem
• A genetic algorithm for the generalised assignment problem
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
• Obtaining test problems via Internet
• Solving the simple plant location problem by genetic algorithm
• Multi-period international facilities location: An algorithm and application
• A genetic algorithm for the generalised assignment problem
• Feature Article—Genetic Algorithms for the Operations Researcher
• The Uncapacitated Facility Location Problem with Client Matching

This page was built for publication: GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS