Canguinha: an Intelligent Recommendation System for Optimizing Shopping Routes

• Marcelo A. Bastos UFAL
• Bruno C. S. Nogueira UFAL
• Rian G. S. Pinheiro UFAL

DOI: https://doi.org/10.5753/semish.2025.8986

Abstract

This work introduces Canguinha Alagoas, an online platform designed to minimize the cost of the basic food basket, particularly for low-income consumers. Given a selected list of essential products and a search radius, the system identifies the most cost-effective stores within the specified area and generates an optimized route that reduces both travel time and overall purchase cost. The platform leverages real-time price data from the SEFAZ API (NFC-e), models the problem as a Traveling Purchaser Problem (TPP), and applies a metaheuristic algorithm to efficiently explore the solution space. Experimental results demonstrate that the platform achieves significant cost savings for consumers, contributing to economic efficiency and positively impacting community well-being.

References

E. Angelelli, R. Mansini, and M. G. Speranza. Greedy heuristic methods for the dynamic traveling purchaser problem (dtpp). Journal of Heuristics, 15(5):571–591, 2009. DOI: 10.1007/s10732-008-9081-8.

David L Applegate. The traveling salesman problem: a computational study, volume 17. Princeton university press, 2006.

Geoff Boeing. OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks, 2017. ISSN 0198-9715. URL [link].

Daniel Delahaye, Supatcha Chaimatanan, and Marcel Mongeau. Simulated Annealing: From Basics to Applications, pages 1–35. Springer International Publishing, Cham, 2019. ISBN 978-3-319-91086-4. DOI: 10.1007/978-3-319-91086-4_1.

Bruce Golden, Larry Levy, and Roy Dahl. Two generalizations of the traveling salesman problem. Omega, 9(4):439–441, 1981.

Ilker Kucukoglu. The traveling purchaser problem with fast service option. Computers & Operations Research, 141:105700, 2022.

Daniele Manerba, Renata Mansini, and Jorge Riera-Ledesma. The traveling purchaser problem and its variants. European Journal of Operational Research, 259(1):1–18, 2017. DOI: 10.1016/j.ejor.2016.09.063.

David Pisinger and Stefan Ropke. Large neighborhood search. In Handbook of meta-heuristics, pages 99–127. Springer, 2018.

Jorge Riera-Ledesma and Juan José Salazar-González. A heuristic approach for the traveling purchaser problem. European Journal of Operational Research, 162(1):142–152, 2005.

Secretaria da Fazenda de Alagoas. Ajuda - Programa Economiza Alagoas, 2025. URL [link].

Mingyu Xiao, Jianan Zhang, and Weibo Lin. Parameterized algorithms and complexity for the traveling purchaser problem and its variants. Journal of Combinatorial Optimization, 44(6):2269–2285, 2022. DOI: 10.1007/s10878-020-00608-x. URL [link].