An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Authors:
- Eneko OsabaEneko Osaba
- Xin-She YangXYXin-She Yang
- Fernando DiazFDFernando Diaz
- Pedro Lopez-GarciaPLPedro Lopez-Garcia
- Roberto CarballedoRoberto Carballedo
Top Cited Papers
Open Access
- 1 February 2016
- journal article
- research article
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 48, 59-71
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Union׳s Horizon 2020 research
- Spanish Ministry of Economy and Competitiveness (TEC2013-45585-C2-2-R)
This publication has 90 references indexed in Scilit:
- Application of an Improved Ant Colony Optimization on Generalized Traveling Salesman ProblemEnergy Procedia, 2012
- Honey bees mating optimization algorithm for the Euclidean traveling salesman problemInformation Sciences, 2011
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- New inspirations in swarm intelligence: a surveyInternational Journal of Bio-Inspired Computation, 2011
- Particle swarm optimization-based algorithms for TSP and generalized TSPInformation Processing Letters, 2007
- On the capacitated vehicle routing problemMathematical Programming, 2003
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problemAnnals of Operations Research, 1989
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problemJournal of Statistical Physics, 1988
- The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization.Journal of the Operational Research Society, 1986
- Optimization by Simulated AnnealingScience, 1983