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

Autor: Manjunath H, Alok Hegde, Allen Peter, Nainitha N Shetty, Sooryakantha G
Rok vydání: 2022
DOI: 10.5281/zenodo.6833646
Popis: 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.
Databáze: OpenAIRE