Open Access
MATEC Web of Conferences
Volume 44, 2016
2016 International Conference on Electronic, Information and Computer Engineering
Article Number 02025
Number of page(s) 5
Section Electronics, Information and Engineering Application
Published online 08 March 2016
  1. Gorenstein S. Printing press scheduling for multi-edition periodicals. Management Science 1970; 16 (6): B373–83. [CrossRef]
  2. Szeto, W., Wu, Y., &Ho, S.C. (2011). An artificial bee colony algorithm for the capacitated vehicle routing problem. European Journal of Operational Research, 215(1),126–135. [CrossRef]
  3. D. Karaboga, B. Akay. A comparative study of Artificial Bee Colony algorithm. Appl. Math. Comput. 214 (2009) 108–132. [CrossRef]
  4. Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. Technical report-1r06, Erciyes university, engineering faculty, computer engineering department.
  5. B.Akay, D.Karaboga, A modified Artificial Bee Colony (ABC) algorithm for real-parameter optimization, Inf. sci 192 (2012) 120–142. [CrossRef]
  6. W. Xiang, M. An. An efficient and robust Artificial Bee Colony algorithm for numerical optimization. Comput. Oper. Res. 40 (2013) 1256–1265. [CrossRef]
  7. S. Biswas, S. Das, S. Debchoudhury, S. Kundu, Co-evolving bee colonies by forager migration: A multi-swarm based Artificial Bee Colony algorithm for global search space, Appl. Math. Comput. 232 (2014) 216–234. [CrossRef]
  8. A. E. Carter, C. T. Ragsdale, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Eur. J. Oper. Res. 175 (2006)245–257. [CrossRef]
  9. A.Singh, A.S. Baghel, A new grouping genetic algorithm approach to the multiple traveling salesperson problem, Soft Comput. 13 (2009) 95–101. [CrossRef]
  10. W. Liu, S. Li, F. Zhao, A. Zheng, An ant colony optimization algorithm for the multiple traveling salesmen problem, in: 4th IEEE Industrial Conference on Industrial Electronics and Applications (ICIEA 2009), IEEE, 2009, pp. 1533–1537.