Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 841748, 16 pages
http://dx.doi.org/10.1155/2015/841748
Research Article

Modifying Regeneration Mutation and Hybridising Clonal Selection for Evolutionary Algorithms Based Timetabling Tool

1Faculty of Industrial Technology, Pibulsongkram Rajabhat University, Phitsanulok 65000, Thailand
2Industrial Engineering Department, Centre of Operations Research and Industrial Applications (CORIA), Faculty of Engineering, Naresuan University, Phitsanulok 65000, Thailand
3Newcastle University Business School, Newcastle University, Newcastle upon Tyne NE1 7RU, UK

Received 19 September 2014; Accepted 16 December 2014

Academic Editor: Yudong Zhang

Copyright © 2015 Thatchai Thepphakorn et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. H. Osman and G. Laporte, “Metaheuristics: a bibliography,” Annals of Operations Research, vol. 63, pp. 513–623, 1996. View at Google Scholar · View at Scopus
  2. R. Lewis, “A survey of metaheuristic-based techniques for university timetabling problems,” OR Spectrum, vol. 30, no. 1, pp. 167–190, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. E.-G. Talbi, Metaheuristics: From Design to Implementation, John Wiley & Sons, 2009.
  4. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: overview and conceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, 2003. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Salcedo-Sanz, “A survey of repair methods used as constraint handling techniques in evolutionary algorithms,” Computer Science Review, vol. 3, no. 3, pp. 175–192, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, New York, NY, USA, 1997.
  7. S. S. Chaudhry and W. Luo, “Application of genetic algorithms in production and operations management: a review,” International Journal of Production Research, vol. 43, no. 19, pp. 4083–4101, 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. P. Pongcharoen, C. Hicks, and P. M. Braiden, “The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure,” European Journal of Operational Research, vol. 152, no. 1, pp. 215–225, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. P. Pongcharoen, W. Promtet, P. Yenradee, and C. Hicks, “Stochastic optimisation timetabling tool for university course scheduling,” International Journal of Production Economics, vol. 112, no. 2, pp. 903–918, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. Z. N. Azimi, “Hybrid heuristics for examination timetabling problem,” Applied Mathematics and Computation, vol. 163, no. 2, pp. 705–733, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. P. Thapatsuwan, P. Pongcharoen, C. Hicks, and W. Chainate, “Development of a stochastic optimisation tool for solving the multiple container packing problems,” International Journal of Production Economics, vol. 140, no. 2, pp. 737–748, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. P. Pongcharoen, W. Chainate, and S. Pongcharoen, “Improving artificial immune system performance: inductive bias and alternative mutations,” in Artificial Immune Systems, vol. 5132 of Lecture Notes in Computer Science, pp. 220–231, Springer, 2008. View at Google Scholar
  13. Y. Zhang, S. Wang, and G. Ji, “A rule-based model for bankruptcy prediction based on an improved genetic ant colony algorithm,” Mathematical Problems in Engineering, vol. 2013, Article ID 753251, 10 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  14. S. Vitayasak and P. Pongcharoen, “Machine selection rules for designing multi-row rotatable machine layout considering rectangular-to-square ratio,” Journal of Applied Operational Research, vol. 5, no. 2, pp. 48–55, 2013. View at Google Scholar
  15. E. K. Burke and J. D. Landa Silva, “The design of memetic algorithms for scheduling and timetabling problems,” in Recent Advances in Memetic Algorithms, W. Hart, J. E. Smith, and N. Krasnogor, Eds., pp. 289–311, Springer, Berlin, Germany, 2005. View at Google Scholar
  16. J.-H. Yang, L. Sun, H. P. Lee, Y. Qian, and Y.-C. Liang, “Clonal selection based memetic algorithm for job shop scheduling problems,” Journal of Bionic Engineering, vol. 5, no. 2, pp. 111–119, 2008. View at Publisher · View at Google Scholar · View at Scopus
  17. R. Tavakkoli-Moghaddam, A. R. Saremi, and M. S. Ziaee, “A memetic algorithm for a vehicle routing problem with backhauls,” Applied Mathematics and Computation, vol. 181, no. 2, pp. 1049–1060, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. S. Abdullah, H. Turabieh, B. McCollum, and P. McMullan, “A tabu-based memetic approach for examination timetabling problems,” in Rough Set and Knowledge Technology, vol. 6401 of Lecture Notes in Computer Science, pp. 574–581, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  19. E. Özcan, “Memes, self-generation and nurse rostering,” in Practice and Theory of Automated Timetabling VI, vol. 3867 of Lecture Notes in computer Science, pp. 85–104, Springer, 2006. View at Google Scholar
  20. E. Özcan, A. J. Parkes, and A. Alkan, “The interleaved constructive memetic algorithm and its application to timetabling,” Computers and Operations Research, vol. 39, no. 10, pp. 2310–2322, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Abdullah and H. Turabieh, “On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems,” Information Sciences, vol. 191, pp. 146–168, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. M. Basikhasteh and M. A. Movafaghpour, “Hybridizing genetic algorithm with biased chance local search,” World Academy of Science, Engineering and Technology, vol. 80, pp. 354–359, 2011. View at Google Scholar · View at Scopus
  23. R. Lewis and B. Paechter, “Finding feasible timetables using group-based operators,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 3, pp. 397–413, 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. D. Qaurooni and M.-R. Akbarzadeh-T, “Course timetabling using evolutionary operators,” Applied Soft Computing Journal, vol. 13, no. 5, pp. 2504–2514, 2013. View at Publisher · View at Google Scholar · View at Scopus
  25. B. T. Tesfaldet, “Automated lecture timetabling using a memetic algorithm,” Asia-Pacific Journal of Operational Research, vol. 25, no. 4, pp. 451–475, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. P. Pongcharoen, D. J. Stewardson, C. Hicks, and P. M. Braiden, “Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry,” Journal of Applied Statistics, vol. 28, no. 3-4, pp. 441–455, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  27. D. C. Montgomery, Design and Analysis of Experiments, John Wiley & Sons, New York, NY, USA, 8th edition, 2012.
  28. T. Thepphakorn, P. Pongcharoen, and C. Hicks, “An ant colony based timetabling tool,” International Journal of Production Economics, vol. 149, pp. 131–144, 2014. View at Publisher · View at Google Scholar · View at Scopus
  29. L. N. de Castro and J. Timmis, “An artificial immune network for multimodal function optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), pp. 699–704, IEEE, 2002.
  30. D. Dasgupta, “Advances in artificial immune systems,” IEEE Computational Intelligence Magazine, vol. 1, no. 4, pp. 40–49, 2006. View at Publisher · View at Google Scholar · View at Scopus
  31. E. Hart and J. Timmis, “Application areas of AIS: the past, the present and the future,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 191–201, 2008. View at Publisher · View at Google Scholar · View at Scopus
  32. Y. L. He, S. C. Hui, and E. M. K. Lai, “Automatic timetabling using artificial immune system,” in Algorithmic Applications in Management, N. Megiddo, Y. F. Xu, and B. H. Zhu, Eds., vol. 3521 of Lecture Notes in Computer Science, pp. 55–65, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  33. M. R. Malim, A. T. Khader, and A. Mustafa, “Artificial immune algorithms for university timetabling,” in Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling (PATAT '06), pp. 234–245, 2006.
  34. A. Bhaduri, “University time table scheduling using genetic artificial immune network,” in Proceedings of the International Conference on Advances in Recent Technologies in Communication and Computing, pp. 289–292, IEEE, Kottayam, India, October 2009. View at Publisher · View at Google Scholar
  35. Y. Zhang, Y. Jun, G. Wei, and L. Wu, “Find multi-objective paths in stochastic networks via chaotic immune PSO,” Expert Systems with Applications, vol. 37, no. 3, pp. 1911–1919, 2010. View at Publisher · View at Google Scholar · View at Scopus
  36. E. K. Burke and S. Petrovic, “Recent research directions in automated timetabling,” European Journal of Operational Research, vol. 140, no. 2, pp. 266–280, 2002. View at Publisher · View at Google Scholar · View at Scopus
  37. R. Qu, E. K. Burke, and B. McCollum, “Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems,” European Journal of Operational Research, vol. 198, no. 2, pp. 392–404, 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. L. Di Gaspero, B. McCollum, and A. Schaerf, “The second international timetabling competition (ITC-2007): curriculum-based course timetabling track,” in Proceedings of the 14th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, M. Gavanelli and T. Mancini, Eds., Rome, Italy, 2007.
  39. E. K. Burke and J. P. Newall, “Solving examination timetabling problems through adaption of heuristic orderings,” Annals of Operations Research, vol. 129, pp. 107–134, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  40. J. K. Ousterhout and K. Jones, Tcl and the Tk Toolkit, Addison-Wesley, Reading, Mass, USA, 2nd edition, 2009.
  41. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
  42. P. Moscato and M. G. Norman, “A memetic approach for the travelling salesman problem—implementation of a computational ecology for combinatorial optimisation on message-passing systems,” in Proceedings of the International Conference on Parallel Computing and Transputer Applications, pp. 177–186, 1992.
  43. E. Elbeltagi, T. Hegazy, and D. Grierson, “Comparison among five evolutionary-based optimization algorithms,” Advanced Engineering Informatics, vol. 19, no. 1, pp. 43–53, 2005. View at Publisher · View at Google Scholar · View at Scopus
  44. J. D. Farmer, N. H. Packard, and A. S. Perelson, “The immune system, adaptation, and machine learning,” Physica D: Nonlinear Phenomena, vol. 22, no. 1–3, pp. 187–204, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  45. D. Dasgupta, S. Yu, and F. Nino, “Recent advances in artificial immune systems: models and applications,” Applied Soft Computing Journal, vol. 11, no. 2, pp. 1574–1587, 2011. View at Publisher · View at Google Scholar · View at Scopus
  46. L. N. de Castro and F. J. von Zuben, “Learning and optimization using the clonal selection principle,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 3, pp. 239–251, 2002. View at Publisher · View at Google Scholar · View at Scopus
  47. T. Murata, H. Ishibuchi, and H. Tanaka, “Genetic algorithms for flowshop scheduling problems,” Computers & Industrial Engineering, vol. 30, no. 4, pp. 1061–1071, 1996. View at Publisher · View at Google Scholar · View at Scopus
  48. G. Syswerda, “Scheduling optimisation using genetic algorithm,” in Handbook of Genetic Algorithms, pp. 332–349, 1991. View at Google Scholar
  49. T. Thepphakorn and P. Pongcharoen, “Heuristic ordering for ant colony based timetabling tool,” Journal of Applied Operational Research, vol. 5, no. 3, pp. 113–123, 2013. View at Google Scholar
  50. P. Thapatsuwan, J. Sepsirisuk, W. Chainate, and P. Pongcharoen, “Modifying particle swarm optimisation and genetic algorithm for solving multiple container packing problems,” in Proceedings of the International Conference on Computer and Automation Engineering (ICCAE '09), pp. 137–141, IEEE, Bangkok, Thailand, March 2009. View at Publisher · View at Google Scholar · View at Scopus