Skip to main content
Erschienen in: Arabian Journal for Science and Engineering 9/2021

04.06.2021 | Research Article-Computer Engineering and Computer Science

Co-evolutionary Multi-Colony Ant Colony Optimization Based on Adaptive Guidance Mechanism and Its Application

verfasst von: Shundong Li, Xiaoming You, Sheng Liu

Erschienen in: Arabian Journal for Science and Engineering | Ausgabe 9/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Ant colony optimization has insufficient convergence and tends to fall into the local optima when solving the traveling salesman problem. This paper proposes a co-evolutionary multi-colony ant colony optimization (MCGACO) to overcome this deficiency and applies it to the Robot Path Planning. First, a dynamic grouping cooperation algorithm, combined with Ant Colony System and Max-Min Ant System, is introduced to form a heterogeneous multi-population structure. Each population co-evolves and complements each other to improve the overall optimization performance. Second, an adaptive guidance mechanism is proposed to accelerate convergence speed. The mechanism includes two parts: One is a dynamic evaluation network, which is used to evaluate and divide all solutions by the evaluation function. The other is a positive-negative incentive strategy, which can enhance the guiding role of solutions with higher evaluation value. Besides, to jump out of the local optima, an inter-specific co-evolution mechanism based on the game model is proposed. By dynamically determining the optimal communication combination, the diversity among populations can be well balanced. Finally, the experimental results demonstrate that MCGACO outperforms in terms of solution accuracy and convergence. Meanwhile, the proposed algorithm is also feasible for application in Robot Path Planning.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Strk, L.; Skinderowicz, R.; Boryczka, U.: Adjustability of a discrete particle swarm optimization for the dynamic TSP. Soft Comput. 22(22), 7633–7648 (2018)CrossRef Strk, L.; Skinderowicz, R.; Boryczka, U.: Adjustability of a discrete particle swarm optimization for the dynamic TSP. Soft Comput. 22(22), 7633–7648 (2018)CrossRef
2.
Zurück zum Zitat Das, P.K.; Jena, P.K.: Multi-robot path planning using improved particle swarm optimization algorithm through novel evolutionary operators. Appl. Soft Comput. 92, 106312 (2020)CrossRef Das, P.K.; Jena, P.K.: Multi-robot path planning using improved particle swarm optimization algorithm through novel evolutionary operators. Appl. Soft Comput. 92, 106312 (2020)CrossRef
3.
Zurück zum Zitat Wang, Z.; Fang, X.; Li, H.; Jin, H.: An improved Partheno-genetic algorithm with reproduction mechanism for the multiple traveling salesperson problem. IEEE Access 8, 102607–102615 (2020)CrossRef Wang, Z.; Fang, X.; Li, H.; Jin, H.: An improved Partheno-genetic algorithm with reproduction mechanism for the multiple traveling salesperson problem. IEEE Access 8, 102607–102615 (2020)CrossRef
4.
Zurück zum Zitat Hao, K.; Zhao, J.; Yu, K.; Li, C.; Wang, C.: Path planning of mobile robots based on a multi-population migration genetic algorithm. Sensors 20(20), 5873 (2020)CrossRef Hao, K.; Zhao, J.; Yu, K.; Li, C.; Wang, C.: Path planning of mobile robots based on a multi-population migration genetic algorithm. Sensors 20(20), 5873 (2020)CrossRef
5.
Zurück zum Zitat Mavrovouniotis, M.; Muller, F.M.; Yang, S.: Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans. Cybern. 47(7), 1743–1756 (2017)CrossRef Mavrovouniotis, M.; Muller, F.M.; Yang, S.: Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans. Cybern. 47(7), 1743–1756 (2017)CrossRef
6.
Zurück zum Zitat Chen, G.; Liu, J.: Mobile robot path planning using ant colony algorithm and improved potential field method. Comput. Intell. Neurosci. 2019812, 1–10 (2019) Chen, G.; Liu, J.: Mobile robot path planning using ant colony algorithm and improved potential field method. Comput. Intell. Neurosci. 2019812, 1–10 (2019)
7.
Zurück zum Zitat Jia, Z.; Wang, Y.; Wu, C.; Yang, Y.; Zhang, X.; Chen, H.: Multi-objective energy-aware batch scheduling using ant colony optimization algorithm. Comput. Ind. Eng. 131, 41–56 (2019)CrossRef Jia, Z.; Wang, Y.; Wu, C.; Yang, Y.; Zhang, X.; Chen, H.: Multi-objective energy-aware batch scheduling using ant colony optimization algorithm. Comput. Ind. Eng. 131, 41–56 (2019)CrossRef
8.
Zurück zum Zitat Demir, H.I.; Erden, C.: Dynamic integrated process planning, scheduling and due-date assignment using ant colony optimization. Comput. Ind. Eng. 149, 106799 (2020)CrossRef Demir, H.I.; Erden, C.: Dynamic integrated process planning, scheduling and due-date assignment using ant colony optimization. Comput. Ind. Eng. 149, 106799 (2020)CrossRef
9.
Zurück zum Zitat Huang, Y.; Blazquez, C.A.; Huang, S.; Paredes-Belmar, G.; Latorre-Nunez, G.: Solving the feeder vehicle routing problem using ant colony optimization. Comput. Ind. Eng. 127, 520–535 (2019)CrossRef Huang, Y.; Blazquez, C.A.; Huang, S.; Paredes-Belmar, G.; Latorre-Nunez, G.: Solving the feeder vehicle routing problem using ant colony optimization. Comput. Ind. Eng. 127, 520–535 (2019)CrossRef
10.
Zurück zum Zitat Yang, Y.; Yang, B.; Wang, S.; Liu, F.; Wang, Y.; Shu, X.: A dynamic ant-colony genetic algorithm for cloud service composition optimization. Int. J. Adv. Manuf. Technol. 102(1–4), 355–368 (2019)CrossRef Yang, Y.; Yang, B.; Wang, S.; Liu, F.; Wang, Y.; Shu, X.: A dynamic ant-colony genetic algorithm for cloud service composition optimization. Int. J. Adv. Manuf. Technol. 102(1–4), 355–368 (2019)CrossRef
11.
Zurück zum Zitat Dorigo, M.; Maniezzo, V.; Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26, 29–41 (1996)CrossRef Dorigo, M.; Maniezzo, V.; Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26, 29–41 (1996)CrossRef
12.
Zurück zum Zitat Dorigo, M.; Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolut. Comput. 1, 53–66 (1997)CrossRef Dorigo, M.; Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolut. Comput. 1, 53–66 (1997)CrossRef
13.
Zurück zum Zitat Stützle, T.; Hoos, H.H.: MAX-MIN ant system, future generation. Comput. Syst. 16, 889–914 (2000) Stützle, T.; Hoos, H.H.: MAX-MIN ant system, future generation. Comput. Syst. 16, 889–914 (2000)
14.
Zurück zum Zitat Yan, Y.; Sohn, H.; Reyes, G.: A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem. IEEE Access 60, 256–267 (2017) Yan, Y.; Sohn, H.; Reyes, G.: A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem. IEEE Access 60, 256–267 (2017)
15.
Zurück zum Zitat Escario, J.B.; Jiménez, J.F.; Giron-Sierra, J.M.: Ant colony extended: experiments on the travelling salesman problem. Exp. Syst. Appl. 42(1), 390–410 (2015)CrossRef Escario, J.B.; Jiménez, J.F.; Giron-Sierra, J.M.: Ant colony extended: experiments on the travelling salesman problem. Exp. Syst. Appl. 42(1), 390–410 (2015)CrossRef
16.
Zurück zum Zitat Pan, H.; You, X.; Liu, S.: High-frequency path mining-based reward and punishment mechanism for multi-colony ant colony optimization. IEEE Access 8, 155459–155476 (2020)CrossRef Pan, H.; You, X.; Liu, S.: High-frequency path mining-based reward and punishment mechanism for multi-colony ant colony optimization. IEEE Access 8, 155459–155476 (2020)CrossRef
17.
Zurück zum Zitat Ivan, W.M.: An improved ant colony algorithm applied in the TSP problem. Appl Mech Mater. 380–384, 2240–2243 (2012) Ivan, W.M.: An improved ant colony algorithm applied in the TSP problem. Appl Mech Mater. 380–384, 2240–2243 (2012)
18.
Zurück zum Zitat Neyoy, H.; Castillo, O.; Soria, J.: Dynamic fuzzy logic parameter tuning for aco and its application in tsp problems. Stud. Comput. Intell. 451(1), 259–271 (2013) Neyoy, H.; Castillo, O.; Soria, J.: Dynamic fuzzy logic parameter tuning for aco and its application in tsp problems. Stud. Comput. Intell. 451(1), 259–271 (2013)
19.
Zurück zum Zitat Shetty, A.; Puthusseri, K.S.; Shankaramani,R.: An improved ant colony optimization algorithm: minion ant(mant) and its application on TSP. In: IEEE Symposium Series on Computational Intelligence SSCI, pp. 1219–1225 (2018) Shetty, A.; Puthusseri, K.S.; Shankaramani,R.: An improved ant colony optimization algorithm: minion ant(mant) and its application on TSP. In: IEEE Symposium Series on Computational Intelligence SSCI, pp. 1219–1225 (2018)
20.
Zurück zum Zitat Gao, S.; Zhong, J.; Cui, Y.; Gao, C.; Li, X.: A novel pheromone initialization strategy of ACO algorithms for solving TSP. in 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, pp. 243–248 (2017) Gao, S.; Zhong, J.; Cui, Y.; Gao, C.; Li, X.: A novel pheromone initialization strategy of ACO algorithms for solving TSP. in 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, pp. 243–248 (2017)
21.
Zurück zum Zitat Middendorf, M.; Reischle, F.; Schmeck, H.: Multi colony ant algorithms. J. Heuristics 8(3), 305–320 (2002)CrossRef Middendorf, M.; Reischle, F.; Schmeck, H.: Multi colony ant algorithms. J. Heuristics 8(3), 305–320 (2002)CrossRef
22.
Zurück zum Zitat Melo, L.; Pereira, F.; Schmeck, H.: MC-ANT: a multi-colony ant algorithm, artifical evolution. in 9th International Conference, Evolution Artificielle. EA, 2009, Strasbourg, France, October 26–28, 2009. Revised Selected Papers 5975(3), 25–36 (2009) Melo, L.; Pereira, F.; Schmeck, H.: MC-ANT: a multi-colony ant algorithm, artifical evolution. in 9th International Conference, Evolution Artificielle. EA, 2009, Strasbourg, France, October 26–28, 2009. Revised Selected Papers 5975(3), 25–36 (2009)
23.
Zurück zum Zitat Gulcu, S.; Mahi, M.; Baykan, O.K.; Kodaz, H.: A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem. Soft Comput. 22(5), 1669–1685 (2018)CrossRef Gulcu, S.; Mahi, M.; Baykan, O.K.; Kodaz, H.: A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem. Soft Comput. 22(5), 1669–1685 (2018)CrossRef
24.
Zurück zum Zitat Tuani, A.F.; Keedwell, E.; Collett, M.: H-ACO: a heterogeneous ant colony optimisation approach with application to the travelling salesman problem. In Artificial Evolution: 13th International Conference, pp. 144–161. Évolution Artificielle, EA (2017) Tuani, A.F.; Keedwell, E.; Collett, M.: H-ACO: a heterogeneous ant colony optimisation approach with application to the travelling salesman problem. In Artificial Evolution: 13th International Conference, pp. 144–161. Évolution Artificielle, EA (2017)
25.
Zurück zum Zitat Chen, J.; You, X.; Liu, S.; Li, J.: Entropy-based dynamic heterogeneous ant colony optimization. IEEE Access 7, 317–328 (2019) Chen, J.; You, X.; Liu, S.; Li, J.: Entropy-based dynamic heterogeneous ant colony optimization. IEEE Access 7, 317–328 (2019)
26.
Zurück zum Zitat Zhu, H.; You, X.; Liu, S.: Multiple ant colony optimization based on pearson correlation coefficient. IEEE Access 7, 628–638 (2019) Zhu, H.; You, X.; Liu, S.: Multiple ant colony optimization based on pearson correlation coefficient. IEEE Access 7, 628–638 (2019)
27.
Zurück zum Zitat Gunduz, M.; Kiran, M.S.; Ozceylan, E.: A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. 23(1), 215–235 (2015) Gunduz, M.; Kiran, M.S.; Ozceylan, E.: A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. 23(1), 215–235 (2015)
28.
Zurück zum Zitat Zhang, H.; You, X.: Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism. IEEE Access 7, 160–169 (2019)CrossRef Zhang, H.; You, X.: Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism. IEEE Access 7, 160–169 (2019)CrossRef
29.
Zurück zum Zitat Zhang, D.; You, X.; Liu, S.; Yang, K.: Multi-colony ant colony optimization based on generalized jaccard similarity recommendation strategy. IEEE Access 7, 303–317 (2019) Zhang, D.; You, X.; Liu, S.; Yang, K.: Multi-colony ant colony optimization based on generalized jaccard similarity recommendation strategy. IEEE Access 7, 303–317 (2019)
30.
Zurück zum Zitat Meng, L.; You, X.; Liu, S.; Li, S.: Multi-colony ant algorithm using both generative adversarial nets and adaptive stagnation avoidance strategy. IEEE Access 8, 250–260 (2020) Meng, L.; You, X.; Liu, S.; Li, S.: Multi-colony ant algorithm using both generative adversarial nets and adaptive stagnation avoidance strategy. IEEE Access 8, 250–260 (2020)
31.
Zurück zum Zitat Akhand, M.A.H.; Ayon, S.I.; Shahriyar, S.A.; Siddique, N.H.; Adeli, H.: Discrete spider monkey optimization for travelling salesman problem. Appl. Soft Comput. 86, 105887 (2020)CrossRef Akhand, M.A.H.; Ayon, S.I.; Shahriyar, S.A.; Siddique, N.H.; Adeli, H.: Discrete spider monkey optimization for travelling salesman problem. Appl. Soft Comput. 86, 105887 (2020)CrossRef
32.
Zurück zum Zitat Xue, H.; Peng, Z.; Lin, Y.: A multiple ant colonies optimization algorithm based on immunity for solving tsp. Dn International Conference on Artificial Intelligence & Education (2010) Xue, H.; Peng, Z.; Lin, Y.: A multiple ant colonies optimization algorithm based on immunity for solving tsp. Dn International Conference on Artificial Intelligence & Education (2010)
33.
Zurück zum Zitat Clausius, R.: Ueber verschiedene für die Anwendung bequeme Formen der Hauptgleichungen der mechanischen Wrmetheorie. Annalen der Physik 125, 353–400 (1865)CrossRef Clausius, R.: Ueber verschiedene für die Anwendung bequeme Formen der Hauptgleichungen der mechanischen Wrmetheorie. Annalen der Physik 125, 353–400 (1865)CrossRef
34.
35.
Zurück zum Zitat Hochreiter, S.; Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735–1780 (1997)CrossRef Hochreiter, S.; Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735–1780 (1997)CrossRef
36.
Zurück zum Zitat Shi, M.; Tang, Y.; Liu, J.: Functional and contextual attention-based lstm for service recommendation in mashup creation. IEEE Trans. Parallel Distrib. Syst. 99, 1 (2018) Shi, M.; Tang, Y.; Liu, J.: Functional and contextual attention-based lstm for service recommendation in mashup creation. IEEE Trans. Parallel Distrib. Syst. 99, 1 (2018)
37.
Zurück zum Zitat Sankara, R.A.; Durga, B.S.; Sobha, R.T.; Bapi, R.S.; Narahari, S.G.: Study of Diversity and Similarity of Large Chemical Databases Using Tanimoto Measure (2011) Sankara, R.A.; Durga, B.S.; Sobha, R.T.; Bapi, R.S.; Narahari, S.G.: Study of Diversity and Similarity of Large Chemical Databases Using Tanimoto Measure (2011)
38.
Zurück zum Zitat Racz, A.; Bajusz, D.; Heberger, K.: Life beyond the tanimoto coefficient: similarity measures for interaction fingerprints. J. Cheminf. 10(1), 48 (2018)CrossRef Racz, A.; Bajusz, D.; Heberger, K.: Life beyond the tanimoto coefficient: similarity measures for interaction fingerprints. J. Cheminf. 10(1), 48 (2018)CrossRef
39.
Zurück zum Zitat Li, Z.; Li, Y.; Rong, X.; Zhang, H.: Grid map construction and terrain prediction for quadruped robot based on c-terrain path. IEEE Access 8, 572–580 (2020) Li, Z.; Li, Y.; Rong, X.; Zhang, H.: Grid map construction and terrain prediction for quadruped robot based on c-terrain path. IEEE Access 8, 572–580 (2020)
40.
Zurück zum Zitat Li, J.; Li, L.: A hybrid genetic algorithm based on information entropy and game theory. IEEE Access 8, 602–611 (2020) Li, J.; Li, L.: A hybrid genetic algorithm based on information entropy and game theory. IEEE Access 8, 602–611 (2020)
41.
Zurück zum Zitat Wang, Y.; Hao, J.; Liu, W.; Wang, X.: Dynamic evaluation of GNSS spoofing and jamming efficacy based on game theory. IEEE Access 8, 845–857 (2020) Wang, Y.; Hao, J.; Liu, W.; Wang, X.: Dynamic evaluation of GNSS spoofing and jamming efficacy based on game theory. IEEE Access 8, 845–857 (2020)
42.
Zurück zum Zitat Luo, Q.; Wang, H.; Zheng, Y.; He, J.: Research on path planning of mobile robot based on improved ant colony algorithm. Neural Comput. Appl. 32(6), 1555–1566 (2020)CrossRef Luo, Q.; Wang, H.; Zheng, Y.; He, J.: Research on path planning of mobile robot based on improved ant colony algorithm. Neural Comput. Appl. 32(6), 1555–1566 (2020)CrossRef
43.
Zurück zum Zitat Lee, J.: Heterogeneous-ants-based path planner for global path planning of mobile robot applications. Int. J. Control Autom. Syst. 15(4), 1754–1769 (2017)CrossRef Lee, J.: Heterogeneous-ants-based path planner for global path planning of mobile robot applications. Int. J. Control Autom. Syst. 15(4), 1754–1769 (2017)CrossRef
Metadaten
Titel
Co-evolutionary Multi-Colony Ant Colony Optimization Based on Adaptive Guidance Mechanism and Its Application
verfasst von
Shundong Li
Xiaoming You
Sheng Liu
Publikationsdatum
04.06.2021
Verlag
Springer Berlin Heidelberg
Erschienen in
Arabian Journal for Science and Engineering / Ausgabe 9/2021
Print ISSN: 2193-567X
Elektronische ISSN: 2191-4281
DOI
https://doi.org/10.1007/s13369-021-05694-5

Weitere Artikel der Ausgabe 9/2021

Arabian Journal for Science and Engineering 9/2021 Zur Ausgabe

Research Article-Computer Engineering and Computer Science

Structural Self-Similarity Framework for Virtual Human’s Whole Posture Generation

Research Article-Computer Engineering and Computer Science

Credit Card Fraud Detection Technique by Applying Graph Database Model

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.