Abstract: A Heuristic Method for Searching Optimum Path in Contamination Matrices

Contaminating processes are present in various manufacturing industries, whose effects are attempted to minimize. A typical case corresponds to dyeing of fabrics in the textile industry. Modeling of the process leads to matrices which, though corresponding to the Asymmetrical Traveling Salesman Problem, have characteristics that facilitate the search process, allowing discovery of the optimum path with a short range search. In this paper, we present a model that allows the use of optimization techniques to minimize the dyestuff pollution effect, and heuristic considerations facilitating the industrial task of determining the contamination matrix.