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.
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.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
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.
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
View and moderate all "feature-requests Discussion" comments posted by this user
Mark all as spam, and block user from posting to "Feature Requests"
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.
View and moderate all "feature-requests Discussion" comments posted by this user
Mark all as spam, and block user from posting to "Feature Requests"
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.