Journal of Heuristics

, Volume 8, Issue 5, pp 503–514 | Cite as

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

  • Uwe Aickelin
  • Kathryn A. Dowsland
Article

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.

genetic algorithms combinatorial optimisation heuristics scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aickelin, U. (1999). “Genetic Algorithms for Multiple-Choice Optimisation Problems.” Ph.D. Dissertation, University of Wales, Swansea, United Kingdom.Google Scholar
  2. Aickelin, U. and K. Dowsland. (2000). “Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem.” Journal of Scheduling 3, 139–153.Google Scholar
  3. Bean, J., C. Noon, S. Ryan, and G. Salton. (1988). “Selecting Tenants in a Shopping Mall.” Interfaces 18, 1–9.Google Scholar
  4. Davis, L. (1985). “Adapting Operator Probabilities in Genetic Algorithms.” In J. Grefenstette (ed.), Proceedings of the First International Reference on Genetic Algorithms and their Applications. Hillsdale, NJ: Erlbaum, pp. 61–67.Google Scholar
  5. De Jong, K. (1993). “Genetic Algorithms are NOT Function Optimisers.” In D. Whitley (ed.), Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann, pp. 5–17.Google Scholar
  6. Deb, K. (1996). “Genetic Algorithms for Function Optimisation.” Genetic Algorithms and Soft Computing 8, 4–31.Google Scholar
  7. Fogel, D. (1998). Evolutionary Computation: The Fossil Record. New York: IEEE Press, Physica-Verlag.Google Scholar
  8. Goldberg, D. and R. Lingle. (1985). “Alleles, Loci, and the Travelling Salesman Problem.” In J. Grefenstette (ed.), Proceedings of the First International Reference on Genetic Algorithms and their Applications. Hillsdale, NJ: Erlbaum, pp. 154–159.Google Scholar
  9. Hadj-Alouane, A. and J. Bean. (1997). “A Genetic Algorithm For The Multiple-Choice Integer Program.” INFORMS 45, 92–101.Google Scholar
  10. Holland, J. (1976). Adaption in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.Google Scholar
  11. Reeves, C. (1996). “Hybrid Genetic Algorithms for Bin-Packing and Related Problems.” Annals of OR 63, 371–396.Google Scholar
  12. Reeves, C. (1997). “Genetic Algorithms for the Operations Researcher.” INFORMS 45, 231–250.Google Scholar
  13. Smith, A. and D. Tate. (1993). “Genetic Optimization Using a Penalty Function.” In S. Forrest (ed.), Proceedings of the Fifth International Reference on Genetic Algorithms. San Mateo: Morgan Kaufmann, pp. 499–505.Google Scholar
  14. Syswerda, G. (1996). “Schedule Optimisation Using Genetic Algorithms.” In L. Davis (ed.), Handbook of Genetic Algorithms. London: International Thomson Computer Press, pp. 335–349.Google Scholar
  15. Tuson, A. and P. Ross. (1998). “Adapting Operator Settings in Genetic Algorithms.” Evolutionary Computation 6(2), 161–184.Google Scholar
  16. Yeralan, S. and C.-S. Lin. (1994). “Genetic SearchWith Dynamic Operating Disciples.” Computers and Operations Research 21, 941–954.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Uwe Aickelin
    • 1
  • Kathryn A. Dowsland
    • 2
  1. 1.University of the West of EnglandBristolUK
  2. 2.European Business Management SchoolUniversity of Wales SwanseaSwanseaUK

Personalised recommendations