Optimización de Recorridos para la Recolección de Residuos Infecciosos

this paper describes a methodology to determine the optimal routes for the recollection of infectious waste in the city of 3io cuarto in argentina. the case can be formulated as a mixed integer linear programming problem and is classified as np-hard. (non-deterministic polynomial-time hard). the paper proposes to improve the quality of the solutions obtained by an exact searching algorithm by mean of a local search heuristics. this technique inspects the surroundings of such solutions by different mechanisms ensuring the intensive exploitation of the promising regions of the search space. the methodology and its performance for solving different problems taken from literature and for determining a set of optimal routes are presented.