Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Evolutionary algorithm to traveling salesman problems

From MaRDI portal
Publication:745754
Jump to:navigation, search

DOI10.1016/J.CAMWA.2011.12.018zbMath1322.90119OpenAlexW2031543270MaRDI QIDQ745754

Dun-Han Yau, Chieh-Li Chen, Yen-Far Liao

Publication date: 14 October 2015

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.12.018


zbMATH Keywords

traveling salesman problemroutingparticle swarm optimizationfuzzy CC-means clustering


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (4)

Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics ⋮ Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem ⋮ Algorithms for randomized time-varying knapsack problems ⋮ A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem


Uses Software

  • TSPLIB
  • DistAl






This page was built for publication: Evolutionary algorithm to traveling salesman problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:745754&oldid=12665084"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki