Topic
No replies
Tulkas
Tulkas
4 Posts
ACCEPTED ANSWER

Pinned topic Breadth/Depth Search

‏2014-03-26T09:36:55Z |

Hello,

 

My goal sometimes fails to reach optimality within a reasonable amount of time because it takes a bad decision quite early and then tries to enumerate all subsolutions. Therefore, I would like to select an "old" choice point and first explore a different branch when the number of backtracks explodes whithout any improving (keeping traces of those branches I decide to temporary ignore). Is it possible to implement such kind of thing with IlcGoalI ?

 

Best Regards,

  • Philippe_Refalo
    Philippe_Refalo
    48 Posts
    ACCEPTED ANSWER

    Re: Breadth/Depth Search

    ‏2014-03-26T11:03:20Z  in response to Tulkas

    Hi Tulkas, 

    You cannot jump from a node to another with CP Optimizer. In general, it is often better and always easier to restart search from scratch with a new information (new constraints or new variable / value ordering). In your case, you can also add extra constraints to the model that prevent from re-exploring the search space already explored. There is something similar in the automatic search of CP Optimizer. 

    Philippe

     

  • This reply was deleted by Philippe_Refalo 2014-03-26T16:43:07Z.