Solving MTSP (Geocode) for E-commerce Delivery using K-Medoids and Dynamic Programming

Authors : Manjunath H; Alok Hegde; Allen Peter; Nainitha N Shetty; Sooryakantha G

Volume/Issue : Volume 7 - 2022, Issue 6 - June

Google Scholar :

Scribd :


With the increased demand for speedy and same-day deliveries, various e-commerce businesses are looking into new ways to move items in a cost-effective, time-efficient, and sustainable manner. This can be achieved by having a robust execution of delivery. Considering the difference in journey, time, cost factors and number of salespersons the recommended system delivers the best solution in terms of three criteria: cost, time, and sustainability. So, the goal is to reduce the overall distance travelled by all salesperson. Our designed Application will take locations, number of salespersons & vehicle and showcase the optimized sequence of locations. This will save not only Time but Money and Fuel too, which is a win-win situation for both customers and logistics organization. The application was much more needed for since it will be saving the valuable resources of environment.

Keywords : MTSP, TSP, K-Medoid, Dynamic Programming, Graph Partitioning, Geocode.


Paper Submission Last Date
31 - March - 2024

Paper Review Notification
In 1-2 Days

Paper Publishing
In 2-3 Days

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.