title: Particle Swarm Optimzation
body: <p>I have a question in resolving a traffic problem using the PSO algorithm.
  Supposing we have n vehicles (limiting it here in just four vehicules) theses vehicles have the same destination.
  They have different starting cities.(suppose we know their positions (x,y))
  D: the distance between the starting city and the destination. 
  d: the max distance it can travel before it runs out of gas.
  D >> d : each vehicle have to refuel N times with N=D/d
  The path that every vehicle should follow is undefined.
  Task:
  We are searching for the minimal number of gas stations so that every vehicle doesn’t break down (because of gas of course) . what is the number of gas stations and what are their locations.</p>