Proposal of Mutation-Based Bees Algorithm (MBA) to Solve Traveling Salesman & Jobs Scheduling Problems


This paper presents an improved swarm-based algorithm which is based on BeesAlgorithm and Mutation Operator. Mutation-based Bees Algorithm (MBA) is veryuseful to solve some NP-complete problems. This paper contains the basic version ofMBA with solving two NP-complete problems as examples and experiments fortesting the suggested approach. These two problems are Traveling Salesman Problemand Job Scheduling Problem. The experimental results show that the suggestedapproach is very suitable for solving NP-complete problems and gives good resultscompare with traditional Bees algorithm.