Distributed MOPSO with dynamic pareto front driven population analysis for TSP problem

  title={Distributed MOPSO with dynamic pareto front driven population analysis for TSP problem},
  author={Raja Fdhila and Walid Elloumi and Tarek M. Hamdani},
  journal={2014 6th International Conference of Soft Computing and Pattern Recognition (SoCPaR)},
This paper describe the use of Multi-Objective concept to solve the Traveling Salesman Problem (TSP). The traveling salesman problem is defined as an NP-hard problem. The resolution of this kind of problem is based firstly on exact methods and after that is based on single objective based methods as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). Firstly, a short description of the Multi-objective Particles swarm optimization (MOPSO) is given as an efficient technique to… CONTINUE READING


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.
Showing 1-10 of 27 references

A MultiObjective Particles Swarm Optimization Algorithm for Solving the Routing Pico-Satellites Problem

  • R. Fdhila, A.M.T.M. Hamdani
  • IEEE International Conference on System, Man, and…
  • 2012
1 Excerpt

A new distributed approach for MOPSO based on population Pareto fronts analysis and Dynamic subdivision

  • R. Fdhila, T. M. Hamdani, A. M. Alimi
  • Systems Man and Cybernetics (SMC), IEEE…
  • 2010
1 Excerpt

Combinatory Optimization of ACO and PSO

  • W. Elloumi, A. M. Alimi
  • International Conference on Metaheuristique and…
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…