Home > Research > Researchers > Dr Ahmed Kheiri > Publications

Dr Ahmed Kheiri

Senior Lecturer in Management Science (Operations Research)

  1. 2015
  2. Published

    Erratum: Constructing constrained-version of magic squares using selection hyper-heuristics (Computer Journal (2014) 57:3 (469-479) DOI:10.1093/comjnl/bxt130)

    Kheiri, A. & Ozcan, E., 1/01/2015, In: Computer Journal. 58, 8, p. 1857 1 p.

    Research output: Contribution to Journal/MagazineComment/debatepeer-review

  3. Published

    Sequence analysis-based hyper-heuristics for water distribution network optimisation

    Kheiri, A., Keedwell, E., Gibson, M. J. & Savic, D., 2015, In: Procedia Engineering. 119, 1, p. 1269-1277 9 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  4. 2014
  5. Published

    Constructing constrained-version of magic squares using selection hyper-heuristics

    Kheiri, A. & Özcan, E., 1/03/2014, In: Computer Journal. 57, 3, p. 469-479 11 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  6. 2013
  7. Published

    Group decision making hyper-heuristics for function optimisation

    Ozcan, E., Misir, M. & Kheiri, A., 31/12/2013, 2013 13th UK Workshop on Computational Intelligence, UKCI 2013. IEEE, p. 327-333 7 p. 6651324

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  8. Published

    A greedy gradient-simulated annealing selection hyper-heuristic

    Kalender, M., Kheiri, A., Özcan, E. & Burke, E. K., 1/12/2013, In: Soft Computing. 17, 12, p. 2279-2292 14 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  9. Published

    A two stage approach for high school timetabling

    Shambour, M. H. D. K. Y., Khader, A. T., Kheiri, A. & Özcan, E., 1/12/2013, Neural Information Processing: International Conference on Neural Information Processing, ICONIP 2013. p. 66-73 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8226 LNCS, no. PART 1).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  10. Published

    A hyper-heuristic with a round robin neighbourhood selection

    Kheiri, A. & Özcan, E., 22/03/2013, Evolutionary Computation in Combinatorial Optimization: 13th European Conference, EvoCOP 2013, Proceedings. Springer, p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7832 LNCS).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  11. 2012
  12. Published

    A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem

    Kalender, M., Kheiri, A., Özcan, E. & Burke, E. K., 5/12/2012, 2012 12th UK Workshop on Computational Intelligence, UKCI 2012. IEEE, p. 1-8 8 p. 6335754

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  13. A hyper-heuristic based on random gradient, greedy and dominance

    Özcan, E. & Kheiri, A., 1/12/2012, Computer and Information Sciences II: 26th International Symposium on Computer and Information Sciences. Gelenbe, E., Lent, R. & Sakellari, G. (eds.). Springer, Vol. 2. p. 557-563 7 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  14. Published

    HYSST: Hyper-heuristic search strategies and timetabling

    Kheiri, A., Özcan, E. & Parkes, A. J., 29/08/2012, PATAT 2012 - Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling. Kjenstad, D., Riise, A., Nordlander, T. E., McCollum, B. & Burke, E. (eds.). SINTEF, p. 497-499 3 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Back to top