Abstract
In this paper, we proposed an improved migrating birds optimization algorithm to solve discrete problem. It is a metaheuristic search algorithm that is inspired by V formation during the migration of migratory birds. Proposed algorithm has two main modifications on basic migrating birds algorithm. Firstly, multi-flocks are used instead of single flock in order to avoid local minimum. Secondly, these flocks interact with each other for the more detailed search around flock that has got better solutions. This interaction is inspired by particle swarm optimization algorithm. Also, insertion method is used for neighborhood in migrating birds optimization algorithm. As a discrete problem, traveling salesman problem is chosen. Performance of the proposed algorithm is tested on some of symmetric benchmark problems from TSPLIB. Obtained results show that proposed method is superior to basic migrating birds algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
