Cplex OPL, Matlab, C#. Shortest Path with foribdden paths
$30-250 USD
Pagado a la entrega
Hello,
I have project to write in Cplex OPL, Matlab or C#. The task is to write program which find the shortest path in given graph : Shortest Path Problem with Forbidden Paths.
Program have to be written based on article Luigi Di Puglia Pugliese and Francesca Guerriero. Shortest Path Problem with Forbidden Paths: the Elementary Version. European Journal
of Operational Research, 227(2):254–267, June 2, 2013.
Section Dynamic Programming Approaches
Algorithm 4 or 5 to choose:
-Label Selection Method
-Node Selection Method.
Program need to have possible to give some different graphs and different forbidden paths and output the time of execute algorithm for given graph.
Write a documentation including analysis of the results (for different number of nodes and different forbidden paths).
Nº del proyecto: #9128791
Sobre el proyecto
11 freelancers están ofertando un promedio de $322 por este trabajo
Hi! My name is Fernando Téllez. I am a senior year student of electrical engineering at Universidad Simón Bolívar (USB), one of the most prestigious universities in my country (Ranked 34° at the QS University Rankings: Más
Hi. I have a PhD in operations research. I am familiar with CPLEX and have developed my own models and algorithms. I can do the job for you.
Hi! I am a recent graduate in applied mathematics and I have done a course on combinatorial optimization, working on this assignment would be a blast!
