Heurísticas do problema do caminho hamiltoniano mínimo: aplicadas à roteirização da coleta de resíduos sólidos na cidade de Quixadá-CE

Abstract

Efficient solid waste collection management is a growing challenge in Brazilian cities. This study proposes the application of heuristics for the Shortest Hamiltonian Path Problem (SHPP) to optimize collection routes at irregular waste disposal points in the city of Quixadá-CE. Based on real data provided by the local government, adapted versions of the Nearest Neighbor and Cheapest Insertion heuristics were implemented using Python. The case study considered a single truck departing from the garage and ending at the municipal dump, visiting all mapped points without returning to the origin. Results showed that the Cheapest Insertion heuristic performed better, producing more efficient routes in both distance and time. This work offers a practical and scalable solution for waste management, providing a useful tool for public policy and more effective logistical planning.