I used CPLEX for an advanced operations research course focused on the TSP problem and it is really powerful as a tool, IMO the most beautiful examples: http://www.math.uwaterloo.ca/tsp/data/art/index.html However, some of the best results are obtained with heuristics like a Parallel Genetic Algorithm with Edge Assembly Crossover (which I wrote from scratch with enormous effort following the related papers)
Yet they remain solvers without awareness of their actions. I think a planner/solver using atomspace should have different characteristics from them right? Il giorno giovedì 29 aprile 2021 alle 12:18:35 UTC+2 [email protected] ha scritto: > Two best planners from this planning competition are not based on ASP > https://ipc2018-cla <https://ipc2018-classical.bitbucket.io/scores.html>s > <https://ipc2018-classical.bitbucket.io/scores.html> > sical.bitbucket.io/scores.html > <https://ipc2018-classical.bitbucket.io/scores.html>, first one is based > on deep-learning and second one on a heuristic with a pattern database. In > 2014 half of the planners were based on IBM CPLEX solver.. i guess the > reason is that one can't have a universally optimal solver for np-hard > problems, but one can find some shortcuts for a reasonably small subset of > them. > -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/7f2b4aba-0b1c-4d7d-9c28-b79b4d70b862n%40googlegroups.com.
