Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Authors:
- Yannis MarinakisYMYannis Marinakis
- Magdalene MarinakiMMMagdalene Marinaki
- Georgios DouniasGDGeorgios Dounias
- 1 October 2011
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 181 (20) , 4684-4698
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- Path planning on a cuboid using genetic algorithmsInformation Sciences, 2008
- Particle swarm optimization-based algorithms for TSP and generalized TSPInformation Processing Letters, 2007
- A new approach to solve the traveling salesman problemNeurocomputing, 2007
- A novel quantum swarm evolutionary algorithm and its applicationsNeurocomputing, 2007
- Expanding Neighborhood GRASP for the Traveling Salesman ProblemComputational Optimization and Applications, 2005
- A proof of convergence for Ant algorithmsInformation Sciences, 2004
- On the harmonious mating strategy through tabu searchInformation Sciences, 2003
- A synergetic approach to genetic algorithms for solving traveling salesman problemInformation Sciences, 1999
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Optimization by Simulated AnnealingScience, 1983