Smart collection/delivery routing problem

Abstract

There has been an increase in online delivery with the improvement of technology that makes listing and buying of items online much easier. Subsequently, there are more small delivery companies that are trying to enter the market to compete against more well established firms. This project therefore aims to provide an optimal solution for delivery companies that would be required to maximize their profits per delivery while taking into consideration several factors such as pick-up, time windows, priority orders and competition among their customers. The project implements these solutions on Jupyter Notebook and visualizes the routes taken on a map. The mathematical formulas to add each constraint is shown and explained how it has been derived. With these, the project has shown how the optimal route can be obtained and is viable for small datasets. Additional constraints can be added to the model to fulfill additional needs that the delivery company might encounter.