Reference12 articles.
1. Abd Aziz Z & Kendall G. An Investigation of an Ant-based Hyper-heuristics for the Capacitated Vehicle Routing Problem. In Proceedings of Multidiciplinary International Conference on Scheduling: Theory and Applications (MISTA), 2009.
2. Bentley J.L. Fast Algorithms for Geometric Traveling Salesman Problems. In: ORSA Journal of Computing; 1992. Vol 4(4) p.387-411.
3. Burke E. K., Kendall G., Landa-Silva J. D., O’Brien R. & Soubeiga E. An Ant Algorithm Hyperheuristic for the Project Presentation Scheduling Problem. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation; 2005. Vol 3 p.2263-2270.
4. Burke E.K., Gendreau M., Hyde M., Kendall G., Ochoa G., Ozcan E., Qu R. Hyper-heuristics: A Survey of the State of the Art. In: Journal of The Operational Research Society; 2013. Vol 64. p 1695-1724.
5. Chen P. Hyper-heuristic Ant Algorithm for the Traveling Tournament Problem. PhD Thesis. University of Nottingham, UK; 2006.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献