Making use of local search algorithms to find a good assignation between carriers and packages in a logistics company.
The following project studies the efficiency of different initial solution generators, operators and heuristic functions for the Hill Climbing and Simulated Annealing algorithms in the scope of a local search.
Developed in the context of the Artificial Intelligence course of FIB [UPC] during the fall quarter of 2020.