Neuro-fuzzy and soft computing: a computational approach to learning and machine intelligence
Neuro-fuzzy and soft computing: a computational approach to learning and machine intelligence
Design and Use of the CPAN Branch & Bound for the Solution of the Travelling Salesman Problem (TSP)
CONIELECOMP '05 Proceedings of the 15th International Conference on Electronics, Communications and Computers
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem
HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
An Ant Colony Optimization Algorithm with Evolutionary Operator for Traveling Salesman Problem
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Hardware Implementation of 2-Opt Local Search Algorithm for the Traveling Salesman Problem
RSP '07 Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping
A Fast Evolutionary Algorithm for Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
An Angle-Based Crossover Tabu Search for the Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
A Novel Immunity-Growth Genetic Algorithm for Traveling Salesman Problem
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 05
A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
Computers and Industrial Engineering
Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A modified ant colony system for solving the travelling salesman problem with time windows
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
In this paper a new idea to solve the traveling salesman problem is introduced. The idea is categorized within meta-heuristic algorithms and is based on a normal wise human-being thinking method. Starting from an arbitrary starting point, three factors are considered to generate a score vector by which the next position is selected. Distance from the non-visited points, successful previous exper iments, and a randomly changing factor are the components that make the score vector. The effect of each factor can be adjusted by a weighting parameter. The algorithm is implemented and tested on many small (less than 100 cities) benchmarks. The primary surprising results obtained by this soft computing approach, in comparison to many other recently developed methods, turn a light on its bright perspective to be known as an efficient simple solution to the problem.