In this research, we will build an algorithm (PCO: Particle Collision optimization) to solve continuous optimization problems. We assume that the optimal solution is confined to a limited space, and that a group of particles is scattered in the solution space according to a Brownian motion. These particles may collide with the optimal solution and may collide with each other, or even with the boundaries of the search space. We will test this metaheuristic algorithm on a set of standards benchmarks, and we will compare its results with the results of a group of wellknown algorithms, especially those that rely on the Lévy movement. We will also test its application to an engineering problem.