Solving the Multiobjective Multiple Traveling Salesmen Problem Using Membrane Algorithm

The multiple traveling salesmen problem (mTSP) is a generalization of the classical traveling salesman problem (TSP). The mTSP is more appropriate for real-life applications than the TSP, however, the mTSP has not received the same amount of attention. Due to the high complexity of the mTSP, a more efficient algorithm proposed for mTSP must be based on a global search procedure. Membrane algorithms are a class of hybrid intelligence algorithms, which has been introduced recently as a global optimization technique. In this work, a new membrane algorithm for solving mTSP with different numbers of salesmen and problem sizes is described. The experiment results are compared with several multiobjective evolutionary strategies.