An improved ant colony algorithm for TSP application

Aiming at the problems of slow convergence speed and easy to fall into the optimal solution of ant colony algorithm, genetic algorithm and nonlinear optimization are used to optimize ant colony algorithm. After the initial iteration of the ant colony, the solution formed by all paths is the initial...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. Conference series Jg. 1802; H. 3; S. 32067
Hauptverfasser: Jiao, Deqiang, Liu, Che, Li, Zerui, Wang, Dinghao
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Bristol IOP Publishing 01.03.2021
Schlagworte:
Ant colony optimization
Convergence
Crossovers
Genetic algorithms
Physics
Traveling salesman problem
ISSN:1742-6588, 1742-6596
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Aiming at the problems of slow convergence speed and easy to fall into the optimal solution of ant colony algorithm, genetic algorithm and nonlinear optimization are used to optimize ant colony algorithm. After the initial iteration of the ant colony, the solution formed by all paths is the initial population, and then the genetic algorithm is used for selection, crossover and mutation to improve the ability of global search. Finally, the nonlinear optimization algorithm is used to increase the ability of local search of the algorithm. Through this improvement, the convergence speed of the ant colony algorithm is improved and the problem of easy to fall into the optimal solution is solved, which is applied to the traveling salesman problem.
AbstractList Aiming at the problems of slow convergence speed and easy to fall into the optimal solution of ant colony algorithm, genetic algorithm and nonlinear optimization are used to optimize ant colony algorithm. After the initial iteration of the ant colony, the solution formed by all paths is the initial population, and then the genetic algorithm is used for selection, crossover and mutation to improve the ability of global search. Finally, the nonlinear optimization algorithm is used to increase the ability of local search of the algorithm. Through this improvement, the convergence speed of the ant colony algorithm is improved and the problem of easy to fall into the optimal solution is solved, which is applied to the traveling salesman problem.
Author Wang, Dinghao
Liu, Che
Li, Zerui
Jiao, Deqiang
Author_xml – sequence: 1
  givenname: Deqiang
  surname: Jiao
  fullname: Jiao, Deqiang
– sequence: 2
  givenname: Che
  surname: Liu
  fullname: Liu, Che
– sequence: 3
  givenname: Zerui
  surname: Li
  fullname: Li, Zerui
– sequence: 4
  givenname: Dinghao
  surname: Wang
  fullname: Wang, Dinghao
BookMark eNqFkEtLw0AQxxepYFv9DC54jtlXMpuDh1K0CgUF63lZ9qFb0mzcpEK_vYmVHrw4c5iBmf88fjM0aWLjELqm5JYSKXMKgmVlUZU5lYTlPCeckRLO0PRUmZxyKS_QrOu2hPDBYIrEosFh16b45SzWTY9NrGNzwLp-jyn0HzvsY8Kb1xes27YORvchNpfo3Ou6c1e_cY7eHu43y8ds_bx6Wi7WmWGigox5C0IyR0snDAEuSgeGSyEKYKBtRcCbylfcF1JbUlJuDAATlnqwtqCaz9HNce5w3-fedb3axn1qhpWKFZRVJYfB5wiOXSbFrkvOqzaFnU4HRYkaEanxeTWCUCMixdUR0aC8-6M0of_5sE861P_qvwE8D2xz
CitedBy_id crossref_primary_10_1007_s10489_022_03912_7
crossref_primary_10_1007_s10586_024_04860_2
Cites_doi 10.1016/j.asoc.2015.07.005
ContentType Journal Article
Copyright 2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
8FD
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
H8D
HCIFZ
L7M
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOI 10.1088/1742-6596/1802/3/032067
DatabaseName CrossRef
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Technology collection
ProQuest One
ProQuest Central Korea
Aerospace Database
SciTech Premium Collection
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle CrossRef
Publicly Available Content Database
Advanced Technologies & Aerospace Collection
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
Aerospace Database
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
Advanced Technologies Database with Aerospace
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database
CrossRef
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 1742-6596
ExternalDocumentID 10_1088_1742_6596_1802_3_032067
Genre Conference Proceeding
GroupedDBID 1JI
29L
2WC
4.4
5B3
5GY
5PX
5VS
7.Q
AAJIO
AAJKP
AAYXX
ABHWH
ACAFW
ACHIP
AEFHF
AEINN
AEJGL
AFFHD
AFKRA
AFYNE
AIYBF
AKPSB
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ASPBG
ATQHT
AVWKF
AZFZN
BENPR
BGLVJ
CCPQU
CEBXE
CITATION
CJUJL
CRLBU
CS3
DU5
E3Z
EBS
EDWGO
EQZZN
F5P
FRP
GX1
HCIFZ
HH5
IJHAN
IOP
IZVLO
J9A
KQ8
LAP
N5L
N9A
O3W
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PJBAE
PQGLB
RIN
RNS
RO9
ROL
SY9
T37
TR2
W28
XSB
~02
8FD
8FE
8FG
ABUWG
AZQEC
DWQXO
H8D
L7M
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c2497-2fd7482e16e4c07346e7c38445727ad907fc9f93f58ad0613cc7724d1f7dd51a3
IEDL.DBID P5Z
ISSN 1742-6588
IngestDate Sun Jul 13 04:21:39 EDT 2025
Sat Nov 29 01:47:42 EST 2025
Tue Nov 18 20:57:48 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2497-2fd7482e16e4c07346e7c38445727ad907fc9f93f58ad0613cc7724d1f7dd51a3
Notes ObjectType-Conference Proceeding-1
SourceType-Scholarly Journals-1
content type line 14
OpenAccessLink https://www.proquest.com/docview/2512963737?pq-origsite=%requestingapplication%
PQID 2512963737
PQPubID 4998668
ParticipantIDs proquest_journals_2512963737
crossref_primary_10_1088_1742_6596_1802_3_032067
crossref_citationtrail_10_1088_1742_6596_1802_3_032067
PublicationCentury 2000
PublicationDate 20210301
PublicationDateYYYYMMDD 2021-03-01
PublicationDate_xml – month: 03
  year: 2021
  text: 20210301
  day: 01
PublicationDecade 2020
PublicationPlace Bristol
PublicationPlace_xml – name: Bristol
PublicationTitle Journal of physics. Conference series
PublicationYear 2021
Publisher IOP Publishing
Publisher_xml – name: IOP Publishing
References Zhou (JPCS_1802_3_032067bib3) 2016
You (JPCS_1802_3_032067bib1) 2017
Lu (JPCS_1802_3_032067bib4) 2015
Pan (JPCS_1802_3_032067bib2) 2016
References_xml – year: 2016
  ident: JPCS_1802_3_032067bib2
– start-page: 1
  year: 2016
  ident: JPCS_1802_3_032067bib3
  article-title: Obstacle avoidance planning of space manipulator end-effector based on the improved local antcolony algorithm[J]
  publication-title: SpringerPlus
– start-page: 629
  year: 2015
  ident: JPCS_1802_3_032067bib4
  article-title: Improved particle swarm optimization algorithm and its application in text selection[J]
  publication-title: Applied Soft Computing
  doi: 10.1016/j.asoc.2015.07.005
– start-page: 553
  year: 2017
  ident: JPCS_1802_3_032067bib1
  article-title: An ant colony algorithm for dynamic search strategy and its application in robot path planning [J]
  publication-title: Control and decision-making
SSID ssj0033337
Score 2.266224
Snippet Aiming at the problems of slow convergence speed and easy to fall into the optimal solution of ant colony algorithm, genetic algorithm and nonlinear...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 32067
SubjectTerms Ant colony optimization
Convergence
Crossovers
Genetic algorithms
Physics
Traveling salesman problem
Title An improved ant colony algorithm for TSP application
URI https://www.proquest.com/docview/2512963737
Volume 1802
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIOP
  databaseName: Institute of Physics Open Access Journal Titles
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033337
  issn: 1742-6588
  databaseCode: O3W
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://iopscience.iop.org/
  providerName: IOP Publishing
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033337
  issn: 1742-6588
  databaseCode: P5Z
  dateStart: 20040801
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033337
  issn: 1742-6588
  databaseCode: BENPR
  dateStart: 20040801
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033337
  issn: 1742-6588
  databaseCode: PIMPY
  dateStart: 20040801
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF60VfDiW6zWsgevoW52s5ucpEqLgpagFaqXJe5DCzWtTRX8987mofWiB3PLY0P42J1vZnYyH0LHvuAGeIR5gUmoxxThXkgV8XxrE54A35OiSdKV6PfD4TCKy4RbVpZVVjYxN9R6olyOvO14GCaLoOJ0-uo51Si3u1pKaCyjuuuS4KQb4uChssQUDlH8EOl7wLRhVd8FQV95LeJt1wKtTdtOSDwXm19gp5_GOWec3sZ_v3UTrZe-Ju4Uk2MLLZl0G63mNZ8q20Gsk-JRnlMwGgPA2DWwTj9wMn6Cl82fXzA4tHhwG-OFXe5ddNfrDs4vvFJEwVMQWQkAXQsW-oZwwxSsZ8aNUDRkLADPJdEQG1sV2YjaIEy0I3elwOFmmlihdUASuodq6SQ1-wgzS0mgwWEk5BG4jz8mRGurObFMUXi0gXgFnlRlh3EndDGW-U53GEqHunSoS4e6pLJAvYFOvgZOiyYbfw9pVtDLctVl8hv3g99vH6I139Wm5LVkTVSbz97MEVpR7_NRNmuh-lm3H9-08skEZ_HldXz_CRM6y4k
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwEB1BAcGFHbHjAxyj4tix0wNCiEVUlKoSRYKTCV6gEoTSFhA_xTcyzsJygRMHckziyMp7mjdjj2cANkMpLOoIDyKbsIBrKoKYaRqEziUiQb2neZGkhmw244uLWmsI3sqzMD6tsrSJmaE2D9qvkVe9DiNZJJO73cfAd43yu6tlC42cFif29QVDtv5O_QDx3QrDo8P2_nFQdBUINIYaEmdhJI9DS4XlGgnOhZWaxZxHKOWJwWDR6ZqrMRfFifFqpzV6oNxQJ42JaMLwu8Mwwj3ZKzDSqp-2Lkvbz_CS-RHMMEBtj8uMMgwzi3s1UfVF16qs6luXZ-3tv-jhdznINO5o6r_9nWmYLLxpspfTfwaGbDoLY1lWq-7PAd9LSSdbNbGGIIWIL9GdvpLk7gYnP7i9J-iyk_ZZi3zZx5-H8z-Z8gJU0ofULgLhjtHIoEtM6TWqu7hOqDHOCOq4ZvjqEogSLKWLGuq-lcedyvby41h5lJVHWXmUFVM5ykuw_TGwm5cR-X3Iagm1KuxKX33ivPzz4w0YP26fNlSj3jxZgYnQZ-JkmXOrUBn0nuwajOrnQaffWy8oTODqr3nxDnufJMc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+improved+ant+colony+algorithm+for+TSP+application&rft.jtitle=Journal+of+physics.+Conference+series&rft.au=Jiao%2C+Deqiang&rft.au=Liu%2C+Che&rft.au=Li%2C+Zerui&rft.au=Wang%2C+Dinghao&rft.date=2021-03-01&rft.issn=1742-6588&rft.eissn=1742-6596&rft.volume=1802&rft.issue=3&rft.spage=32067&rft_id=info:doi/10.1088%2F1742-6596%2F1802%2F3%2F032067&rft.externalDBID=n%2Fa&rft.externalDocID=10_1088_1742_6596_1802_3_032067
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1742-6588&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1742-6588&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1742-6588&client=summon