Abstract
This project aims to study a way to parallelize the hybrid method Clustering Search (CS), which seeks to combine efficiently metaheuristics and local search heuristics. CS is an easily parallelizable method, since its components can be executed independently. Through parallelization of CS, we can use the full potential of multiple machines, as well as the use of all available processors t…