Abstract

Artificial Bee Colony (ABC) algorithm has received wide attention due to the outstanding performance in solving complex optimization problems. However, the further application of ABC is still hindered due to some bottlenecks, such as slow convergence velocity, poor global search ability and low accuracy of solution. To overcome these problems, an improved ABC (CT-ABC) is proposed in this paper by using both a chaotic map and a tolerance based search equation (TSE). Some standard test functions are chosen to verify the performance by implementing the proposed modified ABC algorithm, basic ABC and another modified ABC (WABC). Simulation results reveal the proposed CT-ABC algorithm is able to obtain the faster convergence speeds and better accurate approximate solution.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call