Food Delivery Website Using Tsp
Author : Prof. Mahesh Dumbere, Vivek Thakre, Pratik Patil, Ritesh Magare, Mahesh Gajbhiye Journa Name: International Journal of Scientific Research & Engineering Trends Volume: 12 issue: 3 Year: Volume-12-issue-3 Views : 107The 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.
Related Indexing Platform
Indexed Journal Website
OAI
https://abcdindex.com/Q745YUJGHTHWE77/ajax/paper_indexing_from_deng.php?verb=GetRecord&identifier=oai%3Aabcdindex.com%3Aarticle%3A65632&metadataPrefix=oai_dc
ABCDIndex OAI-PMH
Dublin Core metadata (harvesters)
GS
Search on Google Scholar
Google Scholar
Search this title on Scholar
SS
Search on Semantic Scholar
Semantic Scholar
Search this title