Uploaded image for project: 'OptaPlanner'
  1. OptaPlanner
  2. PLANNER-50

Planner: simulated annealing should work for planning problems with hard constraints often broken too

XMLWordPrintable

    • Icon: Enhancement Enhancement
    • Resolution: Done
    • Icon: Minor Minor
    • 5.2.0.Final
    • None
    • optaplanner-core
    • None

      This code is bad in SimulatedAnnealingAcceptor:

      // TODO don't abuse translateScoreToGraphValue
      // TODO do hard and soft separately and then average their acceptChance
      Double diff = localSearchSolverScope.getScoreDefinition().translateScoreToGraphValue(scoreDifference);
      if (diff == null)

      { // more hard constraints broken, ignore it for now return 0.0; }

              gdesmet@redhat.com Geoffrey De Smet (Inactive)
              gdesmet@redhat.com Geoffrey De Smet (Inactive)
              Votes:
              0 Vote for this issue
              Watchers:
              0 Start watching this issue

                Created:
                Updated:
                Resolved: