File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Mutual information based Pso and its application in travel route optimization

TitleMutual information based Pso and its application in travel route optimization
Authors
KeywordsMutual information
Traveling salesman problem
Image matching
Particle swarm algorithm
Issue Date2012
Citation
International Journal of Advancements in Computing Technology, 2012, v. 4, n. 3, p. 105-110 How to Cite?
AbstractTo improve the performance of Particle Swarm algorithm in high dimension space, a hybrid Particle Swarm algorithm is proposed based medical image registration. To express the mutual entropy, the current paths are compared with the history paths in an effort to utilize the nature of parallel paradigm of harmony search in order to improve the global search capability and accelerate the search speed. Besides, the formulas are simplified in its application of the traveling salesman problem to make some kind of simplification of time complexity. Compared with the traditional algorithms through experiments, the results demonstrate that the proposed algorithm has been improved to some extent in terms of solution performance and the capacity of jumping out of local minimum.
Persistent Identifierhttp://hdl.handle.net/10722/295994
ISSN

 

DC FieldValueLanguage
dc.contributor.authorBai, Yuan-
dc.contributor.authorShao, Liangshan-
dc.contributor.authorQiu, Yunfei-
dc.contributor.authorDu, Zhanwei-
dc.contributor.authorHao, Linyu-
dc.date.accessioned2021-02-11T04:52:36Z-
dc.date.available2021-02-11T04:52:36Z-
dc.date.issued2012-
dc.identifier.citationInternational Journal of Advancements in Computing Technology, 2012, v. 4, n. 3, p. 105-110-
dc.identifier.issn2005-8039-
dc.identifier.urihttp://hdl.handle.net/10722/295994-
dc.description.abstractTo improve the performance of Particle Swarm algorithm in high dimension space, a hybrid Particle Swarm algorithm is proposed based medical image registration. To express the mutual entropy, the current paths are compared with the history paths in an effort to utilize the nature of parallel paradigm of harmony search in order to improve the global search capability and accelerate the search speed. Besides, the formulas are simplified in its application of the traveling salesman problem to make some kind of simplification of time complexity. Compared with the traditional algorithms through experiments, the results demonstrate that the proposed algorithm has been improved to some extent in terms of solution performance and the capacity of jumping out of local minimum.-
dc.languageeng-
dc.relation.ispartofInternational Journal of Advancements in Computing Technology-
dc.subjectMutual information-
dc.subjectTraveling salesman problem-
dc.subjectImage matching-
dc.subjectParticle swarm algorithm-
dc.titleMutual information based Pso and its application in travel route optimization-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.4156/ijact.vol4.issue3.14-
dc.identifier.scopuseid_2-s2.0-84857943730-
dc.identifier.volume4-
dc.identifier.issue3-
dc.identifier.spage105-
dc.identifier.epage110-
dc.identifier.eissn2233-9337-
dc.identifier.issnl2005-8039-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats