Applying Greedy Algorithm and Local Search in a Supply Chain distribution problem

In this work, we applied Greedy Algorithm for solving a Supply Chain Distribution Network problem.

This is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.
We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a demand at a certain time, each factory has a production limit. Furthermore, we assumed lost sales penalty (if a certain demand is not satisfied). The goal was to find the matrix of amount of products shipped from any factory to any sales point to minimize total costs. More information in the pdf file attached.