Basically it is a dynamic location allocation problem with four objective functions. It is a minimization problem and I need to get the Pareto fronts. I don`t want to use linear weighted sum or similar approaches that doesn`t work probably on non-convex problems. I need someone who can code and solve the problem with an exact approach that can give me all Pareto fronts. I donot insist on Matlab, so if you can code it on other platforms like AIMMS, Lingo, GAMS, etc. it is OK with me.
Now I have added the problem so that you can see how the objectives look like.
What do I need explicitly: I need the characteristics of Pareto fronts including the values of objective functions and decision variables in each Pareto frontier and I want them in a excel file. So when I run the program, it will result in one excel file with the results.
What you need to show me before I accept your bid: I need to know if you have done some multi -objective programming before. I need evidences to assure me you can do the programming. In return, I can give you enough time.
Note: I have a benchmark problem. So I will check the consistency of your programmed model. This is a serious thing.
11 freelancere byder i gennemsnit €453 på dette job
I have best skill regarding your task I will do it this task is simple for me because i have long time experience with professional level and i m interested contact me if you wiling. thanks