Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem

Aickelin, Uwe and Dowsland, Kathryn (2002) Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem. Journal of Heuristics, 8 (5). pp. 503-514.

Warning
There is a more recent version of this item available.
[thumbnail of 02heur_igamall.pdf] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (234kB)

Abstract

During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance between being an optimiser in its own right and finding feasible solutions. Previously this balance was achieved manually. Here we extend this by presenting an automated approach where the genetic algorithm itself, simultaneously to solving the problem, sets weights to balance the components out. Subsequently we were able to solve a complex and non-linear scheduling problem better than with a standard direct genetic algorithm implementation.

Item Type: Article
Additional Information: The original publication is available at www.springerlink.com
Keywords: Genetic algorithms, combinatorial optimisation, heuristics, scheduling
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Aickelin, Professor Uwe
Date Deposited: 09 Nov 2007 10:28
Last Modified: 31 May 2021 14:47
URI: https://eprints.nottingham.ac.uk/id/eprint/615

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View