Search

This paper describes a methodology to determine the optimal routes for the recollection of infectious waste in the city of Rio Cuarto in Argentina. The case can be formulated as a mixed integer linear programming problem and is classified as NP-hard. (non-deterministic polynomialtime 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. [ABSTRACT FROM AUTHOR]