Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Ant colony optimisation for coloured travelling salesman problem by multi-task learning

© The Institution of Engineering and Technology
Received 04/11/2016, Accepted 13/04/2018, Revised 22/02/2018, Published 26/04/2018

Traditional algorithms, such as genetic algorithm and simulated annealing, have greatly attracted a lot of research studies due to their simplicity and flexibility to solve coloured travelling salesman problem (CTSP). However, their performance is limited in solution quality and convergence speed. To improve these limitations, this study presents a fast and effective ant colony optimisation (FEACO) algorithm. In the proposed FEACO, a new pheromone updating mechanism is incorporated into the traditional ant colony optimisation (ACO) to improve its performance. Furthermore, a multi-task cooperative learning approach is employed to solve CTSP. In it, multiple tasks in a shared city set are cooperatively carried out by all salesmen, but each task in exclusive city sets is independently performed by an appointed salesman. In ACO and FEACO, feasible solutions can be found for CTSP by cooperative learning, which is carried out by the cooperation of a set of ants. During the process, ants can cooperate to find good solutions by utilising the pheromone deposited on the paths while ants pass them. Compared with state-of-the-art algorithms, the experimental results on both small scale and larger scale show that the proposed method has potential to provide an improvement in solution quality and convergence speed.

Inspec keywords: travelling salesman problems; ant colony optimisation; learning (artificial intelligence); set theory

Other keywords: CTSP; genetic algorithm; solution quality; multitask cooperative learning approach; pheromone updating mechanism; fast and effective ant colony optimisation algorithm; cooperative learning; coloured travelling salesman problem; FEACO algorithm; simulated annealing; shared city set; convergence speed

Subjects: Optimisation techniques; Applications of systems theory; Combinatorial mathematics

References

    1. 1)
      • 22. Zhang, H.G., Zhou, J.: ‘Dynamic multiscale region search algorithm using vitality selection for travelling salesman problem’, Expert Syst. Appl., 2016, 60, pp. 81–95.
    2. 2)
      • 9. Pereira, C., Gonçalves, L., Ferreira, M.: ‘Exudate segmentation in fundus images using an ant colony optimization approach’, Inf. Sci., 2015, 296, pp. 14–24.
    3. 3)
      • 21. Li, C.S., Yan, J.C., Wei, F., et al: ‘Self-paced multi-task learning’. Proc. 31st AAAI Conf. on Artificial Intelligence (AAAI), San Fransisco, CA, USA, 2017, pp. 2175–2181.
    4. 4)
      • 10. Dong, W.Y., Zhang, W.S., Yu, R.G.: ‘Convergence and runtime analysis of ITÖ algorithm for one class of combinatorial optimization’, Chin. J. Comput., 2011, 34, (4), pp. 636–646.
    5. 5)
      • 17. Chen, L., Zhang, Q., Li, B.X.: ‘Predicting multiple attributes via relative multi-task learning’. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), Columbus, OH, USA, 2014, pp. 1027–1034.
    6. 6)
      • 20. Liu, A.A., Su, Y.T., Nie, W.Z., et al: ‘Hierarchical clustering multi-task learning for joint human action grouping and recognition’, IEEE Trans. Pattern Anal. Mach. Intell., 2017, 39, (1), pp. 102–113.
    7. 7)
      • 7. Dong, W.Y., Dong, X.S.: ‘Parameters selection for genetic algorithms and ant colony algorithms by uniform design’, Lect. Notes Comput. Sci., 2014, 8588, pp. 184–195.
    8. 8)
      • 15. Pan, J.L., Yang, Q.: ‘A survey on transfer learning’, IEEE Trans. Knowl. Data Eng., 2010, 22, (10), pp. 1345–1359.
    9. 9)
      • 19. Zhao, L., Sun, Q., Ye, J.P.: ‘Multi-task learning for spatio-temporal event forecasting’. ACM SIGKDD Conf. on Knowledge Discovery & Data Mining (SIGKDD), Sydney, Australia, 2015, pp. 1503–1512.
    10. 10)
      • 5. Dorigo, M., Maniezzo, V., Colorni, A.: ‘Ant system: optimization by a colony of cooperating agents’, IEEE Trans. Syst. Man Cybern. B, Cybern., 1996, 26, (1), pp. 29–41.
    11. 11)
      • 16. Zhang, Y.: ‘Multi-task learning and algorithmic stability’. Proc. 29th AAAI Conf. on Artificial Intelligence (AAAI), Austin, TX, USA, 2015, pp. 3181–3187.
    12. 12)
      • 8. Liao, T.J., Socha, K., Oca, M.A., et al: ‘Ant colony optimization for mixed-variable optimization problems’, IEEE Trans. Evol. Comput., 2013, 18, (4), pp. 503–518.
    13. 13)
      • 3. Wang, P., Sanin, C., Szczerbicki, E.: ‘Evolutionary algorithm and decisional DNA for multiple travelling salesman problem’, Neurocomputing, 2015, 150, pp. 50–57.
    14. 14)
      • 2. Li, J., Sun, Q., Zhou, M.C., et al: ‘A new multiple travelling salesman problem and its genetic algorithm-based solution’. Proc. 2013 IEEE Int. Conf. on Systems Man and Cybernetics, Manchester, UK, 2013, pp. 1–6.
    15. 15)
      • 12. Dong, W.Y., Cai, Y.L, Wang, Y.F, et al: ‘Discrete ITÔ algorithm to the coloured travelling salesman problem’, Int. J. Wireless Mob. Comput., 2016, 11, (2), pp. 157–165.
    16. 16)
      • 1. Li, J., Zhou, M.C., Sun, Q.R., et al: ‘Coloured travelling salesman problem’, IEEE Trans. Cybern., 2015, 45, (11), pp. 2390–2401.
    17. 17)
      • 13. Kang, Z.L., Grauman, K., Sha, F.: ‘Learning with whom to share in multi-task feature learning’. Proc. 28th Int. Conf. on Machine Learning (ICML), Bellevue, WA, USA, 2011, pp. 1–8.
    18. 18)
      • 11. Yi, Y.F., Cai, Y.L., Dong, W.Y., et al: ‘Improved ITÖ for multi-objective real-time vehicle routing problem with customers satisfaction’, Acta Electron. Sin., 2015, 43, (10), pp. 2053–2061.
    19. 19)
      • 14. Gao, J., Fan, W., Jiang, J., et al: ‘Knowledge transfer via multiple model local structure mapping’. Proc. 14th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (SIGKDD), Las Vegas, NV, USA, 2008, pp. 283–291.
    20. 20)
      • 6. Dorigo, M., Gambardella, L.M.: ‘Ant colony system: a cooperative learning approach to the travelling salesman problem’, IEEE Trans. Evol. Comput., 1997, 1, (1), pp. 53–66.
    21. 21)
      • 4. Kota, L., Jarmai, K.: ‘Mathematical modelling of multiple tour multiple travelling salesman problem using evolutionary programming’, Appl. Math. Model., 2015, 39, (12), pp. 3410–3433.
    22. 22)
      • 18. Su, C., Yang, F., Zhang, S., et al: ‘Multi-task learning with low rank attribute embedding for person re-identification’. IEEE Int. Conf. on Computer Vision (ICCV), Santiago, Chile, 2015, pp. 3739–3747.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-its.2016.0282
Loading

Related content

content/journals/10.1049/iet-its.2016.0282
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address