APLICAÇÃO DE UM ALGORITMO GENÉTICO PARA O PROBLEMA DO CARTEIRO CHINÊS EM UMA SITUAÇÃO REAL DE COBERTURA DE ARCOS♠ APLLICATION OF A GENETIC ALGORITHM FOR THE CHINESE POSTMAN PROBLEM IN A REAL SITUATION OF COVERAGE OF ARCS

The Chinese Postman Problem is an optimization problem that aims to cover all the arcs of a graph, minimizing the total distance traveled. Can be applied to non-directed graphs (two-way streets), directed (one-way streets) or mixed (some two-way streets and other one- way).These arch for the route is done by algorithms that generate approximate solutions. In this work we used a genetic algorithm for the construction of routes that approximate the optimal solution. The main objective is to minimize the cost of the course of collection and transportation solid waste in the city of Irati (PR), Brazil. The application of the algorithm was performed in a downtown area. Were used formapping, real data courtesy of City Hall