The Application Research of Improved Bat Algorithm for Time Table Problem
Available Online March 2016.
- 10.2991/icmmct-16.2016.332How to use a DOI?
- Bat Algorithm; Time table problem; active evolutionary operator; invalid bat
The time table problem is a typical NP complete problem, when the bat algorithm solves this problem; it will quickly converge, and can get the local optimal solution but not the global optimal solution. Therefore, we use the advantage of active evolutionary operator to improve the bat algorithm, and to solve TTP problem. We do a lot of experiments and evaluate the performance of the improved bat algorithm. The experiment results show that improved bat algorithm is a more superior algorithm to apply to the TTP problem.
- © 2016, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Wenxiang Liu PY - 2016/03 DA - 2016/03 TI - The Application Research of Improved Bat Algorithm for Time Table Problem BT - Proceedings of the 2016 4th International Conference on Machinery, Materials and Computing Technology PB - Atlantis Press SP - 1666 EP - 1669 SN - 2352-5401 UR - https://doi.org/10.2991/icmmct-16.2016.332 DO - 10.2991/icmmct-16.2016.332 ID - Liu2016/03 ER -