Authors: Prof. Mahesh Dumbere, Vivek Thakre, Pratik Patil, Ritesh Magare, Mahesh Gajbhiye
Abstract: The demand for effective delivery route optimization has grown due to the quick expansion of online meal delivery services. In order to reduce delivery time and expense, this study suggests a web-based meal delivery system that makes use of the Travelling Salesman Problem (TSP). For a delivery agent to visit several clients and return to the starting point, the system calculates the quickest path. To solve TSP, a variety of algorithms are examined, including Nearest Neighbor, Genetic Algorithm, and Dynamic Programming. The suggested solution increases customer satisfaction, lowers fuel consumption, and improves delivery efficiency. According to experimental results, optimized routing performs noticeably better than conventional delivery techniques.
