Implementation of a program that solves the problem of deciding where to install stores minimizing the building costs (known as Generalized Assignment Problem, linear programming problem solved with AMPL) and the problem of deciding the routes of the trucks that periodically refurbish the stores minimizing the driving costs (known as the Vehicle Routing Problem, solved with an heuristic method to obtain polynomial execution time).
The full description of the problem is available here.
A detailed explanation of the solution of the problem is available here. Also, an interactive python notebook is also available here, which shows plots to better understand the intermediate steps of the solution of the whole problem.