Robust optimization_Vehicle Routing Problem_Branch-and-cut_Variable neighbourhood descent
Budget: $750 – $1,500 SGD
The required ability/experience to complete this project:
1. Knowledge background of the Vehicle Routing Problem, and Robust Optimization;
2. Familiar with exact algorithm Branch-and-Cut;
3. Familiar with heuristic algorithms including Variable Neighbourhood Search;
4. Can read and understand mathematical models.
Particularly, to be fit for this project you need:
a. Be able to understand the attached academic paper;
b. I will provide the code (in C++) used in the attached paper, if you are fit for this project.
Deliverables:
Algorithms (in C++, or Java, Python, other languages) that can read input-data (i.e., instance data) and calculate solutions for robust vehicle routing.
The protocol to create the required algorithm is ready. Details could be confirmed during a discussion. Thanks!
1. Knowledge background of the Vehicle Routing Problem, and Robust Optimization;
2. Familiar with exact algorithm Branch-and-Cut;
3. Familiar with heuristic algorithms including Variable Neighbourhood Search;
4. Can read and understand mathematical models.
Particularly, to be fit for this project you need:
a. Be able to understand the attached academic paper;
b. I will provide the code (in C++) used in the attached paper, if you are fit for this project.
Deliverables:
Algorithms (in C++, or Java, Python, other languages) that can read input-data (i.e., instance data) and calculate solutions for robust vehicle routing.
The protocol to create the required algorithm is ready. Details could be confirmed during a discussion. Thanks!