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

Article, Preprint English OPEN
Aickelin, Uwe ; Dowsland, Kathryn (2002)

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.
  • References (18)
    18 references, page 1 of 2

    Aickelin U (1999). “Genetic Algorithms for Multiple-Choice Optimisation Problems.” PhD Dissertation, University of Wales, Swansea, United Kingdom.

    Aickelin U, Dowsland K (1999). “An indirect genetic algorithm approach to a nurse scheduling problem.” Submitted to Computers and Operational Research.

    Aickelin U, Dowsland K (2000). “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem.” Journal of Scheduling 3, 139-153.

    Bean J, Noon C, Ryan S, Salton G (1988), “Selecting Tenants in a Shopping Mall,” Interfaces 18, 1-9.

    Davis L (1985), “Adapting Operator Probabilities in Genetic Algorithms,” in Grefenstette J (editor), Proceedings of the First International Reference on Genetic Algorithms and their Applications, Lawrence Erlbaum Associates Publishers, Hillsdale New Jersey, 61-67.

    De Jong K (1993). “Genetic Algorithms are NOT Function Optimisers.” In Whitley D. Editor. Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann Publishers, 5-17.

    Deb K (1996). “Ge netic Algorithms for Function Optimisation.” Genetic Algorithms and Soft Computing, 4-31.

    Fogel D (1998). “Evolutionary Computation: The Fossil Record.” IEEE Press.

    Goldberg D, Lingle R (1985). “Alleles, Loci, and the Travelling Salesman Problem.” In Grefenstette J. editor. Proceedings of the First International Reference on Genetic Algorithms and their Applications, Hillsdale New Jersey: Lawrence Erlbaum Associates Publishers, 154-159.

    Hadj-Alouane A, Bean J (1997), “A Genetic Algorithm For The Multiple -Choice Integer Program,” INFORMS 45, 92-101.

  • Metrics
    No metrics available
Share - Bookmark