Planning system for deliveries in Medell\'in

TL;DR

This paper presents a delivery route planning application for Medellín that addresses a variant of the TSP allowing multiple visits, aiming to optimize delivery efficiency and reduce costs.

Contribution

It introduces a route planning system tailored for Medellín that handles a TSP variant with repeated visits, which is novel in this context.

Findings

Efficient routes can significantly reduce delivery time.

The system adapts TSP algorithms to allow multiple visits to locations.

Potential for cost savings in urban delivery services.

Abstract

Here we present the implementation of an application capable of planning the shortest delivery route in the city of Medell\'in, Colombia. We discuss the different approaches to this problem which is similar to the famous Traveling Salesman Problem (TSP), but differs in the fact that, in our problem, we can visit each place (or vertex) more than once. Solving this problem is important since it would help people, especially stores with delivering services, to save time and money spent in fuel, because they can plan any route in an efficient way.