Proposal of mutation-based bees algorithm (MBA)‎ to solve traveling salesman & jobs scheduling problems

Abstract EN

This paper presents an improved swarm-based algorithm which is based on Bees Algorithm and Mutation Operator.

Mutation-based Bees Algorithm (MBA) is very useful to solve some NP-complete problems.

This paper contains the basic version of MBA with solving two NP-complete problems as examples and experiments for testing the suggested approach.

These two problems are Traveling Salesman Problem and Job Scheduling Problem.

The experimental results show that the suggested approach is very suitable for solving NP-complete problems and gives good results compare with traditional Bees algorithm.