Hi All, I would like to know whether with the actual A-star, we can be able to develop a multi-objective approach. After a brief introduction I came to know that it is possible to have a vector weight, and customize the different steps of the algorithm with a Visitor. Now I am wondering if: + the objective function (distance) can only be a scalar and not a vector ? + Is the algorithm (behind the scenes) bear a multi-objective implementation, for instance for A* a tree is constructed, but for MOA* rather an Acyclic Graph is constructed.
If not supported, I should maybe be add a new search algorithm to the set. What is the best way to extend Graph Tool ? Do I have only to create the graph_moastar.cc, graph_moastar.hh, graph_moastar.lo and update the Makefile in the src/graph/search folder ? Thank you for your attention, ;) -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Multi-Objective-A-star-Vector-Weight-Non-dominated-Distances-tp4026075.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
