PSO is an evolutionary computation technique that is based on population-based swarm optimization.
- It is an iterative algorithm that engages several simple entities—particles—iteratively over the search space of objective functions.
- The particles evaluate their fitness values, with respect to the search function, at their current locations. Subsequently, each particle determines its movement through the search space by combining information about its current fitness, its best fitness from previous locations (individual perspective) and best fitness locations with regards to one or more members of the swarm (social perspective), with some random perturbations.
- The next iteration starts after the positions of all particles have been updated.
build and run in file src/VehicleRoutingProblem/Simulator