Machine Learning-Assisted Dynamic Proximity-Driven Sorting Algorithm for Supermarket Navigation Optimization: A Simulation-Based Validation

Vincent Abella, Johnfil Initan, Jake Mark Perez, Philip Virgil Astillo, Luis Gerardo Cañete and Gaurav Choudhary ()
Additional contact information
Vincent Abella: Department of Computer Engineering, University of San Carlos, Cebu 6000, Philippines
Johnfil Initan: Department of Computer Engineering, University of San Carlos, Cebu 6000, Philippines
Jake Mark Perez: Department of Computer Engineering, University of San Carlos, Cebu 6000, Philippines
Philip Virgil Astillo: Department of Computer Engineering, University of San Carlos, Cebu 6000, Philippines
Luis Gerardo Cañete: Department of Computer Engineering, University of San Carlos, Cebu 6000, Philippines
Gaurav Choudhary: Center for Industrial Software, The Maersk Mc-Kinney Moller Institute, University of Southern Denmark, 6400 Sonderborg, Denmark

Future Internet, 2024, vol. 16, issue 8, 1-24

Abstract: In-store grocery shopping is still widely preferred by consumers despite the rising popularity of online grocery shopping. Moreover, hardware-based in-store navigation systems and shopping list applications such as Walmart’s Store Map, Kroger’s Kroger Edge, and Amazon Go have been developed by supermarkets to address the inefficiencies in shopping. But even so, the current systems’ cost-effectiveness, optimization capability, and scalability are still an issue. In order to address the existing problems, this study investigates the optimization of grocery shopping by proposing a proximity-driven dynamic sorting algorithm with the assistance of machine learning. This research method provides us with an analysis of the impact and effectiveness of the two machine learning models or ML-DProSA variants—agglomerative hierarchical and affinity propagation clustering algorithms—in different setups and configurations on the performance of the grocery shoppers in a simulation environment patterned from the actual supermarket. The unique shopping patterns of a grocery shopper and the proximity of items based on timestamps are utilized in sorting grocery items, consequently reducing the distance traveled. Our findings reveal that both algorithms reduce dwell times for grocery shoppers compared to having an unsorted grocery shopping list. Ultimately, this research with the ML-DProSA’s optimization capabilities aims to be the foundation in providing a mobile application for grocery shopping in any grocery stores.

Keywords: proximity-driven sorting algorithm; in-store grocery shopping; in-store navigation systems; simulation environment (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/16/8/277/pdf (application/pdf)
https://www.mdpi.com/1999-5903/16/8/277/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:16:y:2024:i:8:p:277-:d:1448949

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().