Required ability/experience to complete this project:
1. Knowledge background of the Fleet Planning Problem;
2. Familiar with Dynamic Programming algorithm;
3. Familiar with heuristic algorithms including Tabu search, neighbor search;
4. Can read and understand mathematical models.
Particularly, to be a fit for this project you need:
Understand the attached academic paper, and be able to repeat the algorithm used in the attached paper.
Algorithms (in Python, or C++, Java, Python, other languages) that can read input-data (i.e., instance data) and calculate solutions of fleet renewal plans.
The protocol to create the required algorithm is ready. Details could be confirmed during a discussion. Thanks!