Menu ▾ ▴

#44 solving Vehicle routing problem 2 objectives using nsga II

Any Version
open
nobody
None
5
2015-04-22
2015-04-20
Anonymous
No

I would like to use the NSGA II algorithm to solve a two objectives Vehicle routing problem (minimum Distances and Minimum number of vehicle to use)
I appreciate any suggestions and help.

Discussion

  • Comment has been marked as spam. 
    Undo

    View and moderate all "feature-requests Discussion" comments posted by this user

    Mark all as spam, and block user from posting to "Feature Requests"

    Anonymous

    Anonymous - 2015-04-21

    I would suggest starting with the Traveling Salesman Problem in the examples/org/moeaframework/examples/ga/tsplib folder. It demonstrates loading distance graphs and finding an optimal route using a permutation encoding. You would then need to implement Vehicle routing problem and supply the appropriate encoding, objectives, and constraints.

     
  • Comment has been marked as spam. 
    Undo

    View and moderate all "feature-requests Discussion" comments posted by this user

    Mark all as spam, and block user from posting to "Feature Requests"

    Anonymous

    Anonymous - 2015-04-22

    thanks a lot for responding and I need more help about how to implement Vehicle routing problem and supply the appropriate encoding, objectives, and constraints.