Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Computers and Operations Research
A synergetic approach to genetic algorithms for solving traveling salesman problem
Information Sciences: an International Journal
Case injected genetic algorithms for traveling salesman problems
Information Sciences: an International Journal - Special issue on frontiers in evolutionary algorithms
Artficial Immune Systems and Their Applications
Artficial Immune Systems and Their Applications
Artificial Immune Systems: A New Computational Intelligence Paradigm
Artificial Immune Systems: A New Computational Intelligence Paradigm
Efficient cluster compensation for lin-kernighan heuristics
Efficient cluster compensation for lin-kernighan heuristics
On the harmonious mating strategy through tabu search
Information Sciences: an International Journal - Special issue: Evolutionary computation
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
A proof of convergence for Ant algorithms
Information Sciences—Informatics and Computer Science: An International Journal
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Ant colony system with communication strategies
Information Sciences—Informatics and Computer Science: An International Journal
Expanding Neighborhood GRASP for the Traveling Salesman Problem
Computational Optimization and Applications
Handbook of Research on Nature-inspired Computing for Economics and Management
Handbook of Research on Nature-inspired Computing for Economics and Management
Exchange strategies for multiple Ant Colony System
Information Sciences: an International Journal
A new approach to solve the traveling salesman problem
Neurocomputing
Particle swarm optimization-based algorithms for TSP and generalized TSP
Information Processing Letters
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
Path planning on a cuboid using genetic algorithms
Information Sciences: an International Journal
Information Sciences: an International Journal
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
A hybrid discrete particle swarm optimization for the traveling salesman problem
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Parallel ant colony optimization for the traveling salesman problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Engineering optimizations via nature-inspired virtual bee algorithms
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Cooperative bees swarm for solving the maximum weighted satisfiability problem
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Particle swarm for the traveling salesman problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A hybrid heuristic for the traveling salesman problem
IEEE Transactions on Evolutionary Computation
An evolutionary algorithm for large traveling salesman problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Information Sciences: an International Journal
Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
Information Sciences: an International Journal
A honey bees mating optimization algorithm for the open vehicle routing problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Computers & Mathematics with Applications
Black hole: A new heuristic optimization approach for data clustering
Information Sciences: an International Journal
Combinatorial complexity problem reduction by the use of artificial vaccines
Expert Systems with Applications: An International Journal
Optimization of the material flow in a manufacturing plant by use of artificial bee colony algorithm
Expert Systems with Applications: An International Journal
Task assignment for minimizing application completion time using honeybee mating optimization
Frontiers of Computer Science: Selected Publications from Chinese Universities
A discrete gravitational search algorithm for solving combinatorial optimization problems
Information Sciences: an International Journal
Hi-index | 0.07 |
This paper introduces a new hybrid algorithmic nature inspired approach based on Honey Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman Problem. The proposed algorithm for the solution of the Traveling Salesman Problem, the Honey Bees Mating Optimization (HBMOTSP), combines a Honey Bees Mating Optimization (HBMO) algorithm, the Multiple Phase Neighborhood Search-Greedy Randomized Adaptive Search Procedure (MPNS-GRASP) algorithm and the Expanding Neighborhood Search Strategy. Besides these two procedures, the proposed algorithm has, also, two additional main innovative features compared to other Honey Bees Mating Optimization algorithms concerning the crossover operator and the workers. The main contribution of this paper is that it shows that the HBMO can be used in hybrid synthesis with other metaheuristics for the solution of the TSP with remarkable results both to quality and computational efficiency. The proposed algorithm was tested on a set of 74 benchmark instances from the TSPLIB and in all but eleven instances the best known solution has been found. For the rest instances the quality of the produced solution deviates less than 0.1% from the optimum.