Bee Colony Optimization with local search for traveling salesman problem
- 1 July 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19354576,p. 1019-1025
Abstract
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan chain optimization and drilling problem in integrated circuit testing and production. This paper presents a bee colony optimization (BCO) algorithm for traveling salesman problem (TSP). The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. The model is integrated with 2-opt heuristic to further improve prior solutions generated by the BCO model. Experimental results comparing the proposed BCO model with existing approaches on a set of benchmark problems are presented.Keywords
This publication has 24 references indexed in Scilit:
- The use of waggle dance information by honey bees throughout their foraging careersBehavioral Ecology and Sociobiology, 2005
- A hybrid evolutionary algorithm for traveling salesman problem2005
- Computing with Bees: Attacking Complex Transportation Engineering ProblemsInternational Journal on Artificial Intelligence Tools, 2003
- Solving symmetric and asymmetric TSPs by ant colonies2002
- A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems2002
- Genetic local search for the TSP: new results2002
- The Biology of the Dance LanguageAnnual Review of Entomology, 2002
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Tabu search performance on the symmetric traveling salesman problemComputers & Operations Research, 1994
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problemJournal of Statistical Physics, 1988