Intelligent Feature Extraction for Ensemble of Classifiers
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Using the RRT algorithm to optimize classification systems for handwritten digits and letters
Proceedings of the 2008 ACM symposium on Applied computing
Animating animal motion from still
ACM SIGGRAPH Asia 2008 papers
Crossover operation engine considering character inheritance
ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
Dedicated hardware for inheritance-oriented crossover operation
WSEAS Transactions on Circuits and Systems
Multistart tabu search and diversification strategies for the quadratic assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Three-tier multi-agent approach for solving traveling salesman problem
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
A hybrid cultural algorithm with local search for traveling salesman problem
CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
Extended tabu search on fuzzy traveling salesman problem in multi-criteria analysis
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
An improved multi-agent approach for solving large traveling salesman problem
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
A multi-objective memetic algorithm for intelligent feature extraction
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Large scale parallel iterated local search algorithm for solving traveling salesman problem
Proceedings of the 2012 Symposium on High Performance Computing
| Hi-index | 0.00 |
Recently, several general optimization algorithms based on the demon algorithm from statistical physics have been developed and tested on a few traveling salesman problems with encouraging results. In this paper, we conduct an extensive computational study of 11 annealing-based heuristics for the traveling salesman problem. We code versions of simulated annealing, threshold accepting, record-to-record travel and eight heuristics based on the demon algorithm. We apply each heuristic to 29 traveling salesman problems taken from a well-known online library, compare the results with respect to accuracy and running time and provide insights and suggestions for future work