Originally posted by: SystemAdmin

[anahana said:]

I'm searching for a routing solution within a concatenated neighborhood, made up of 5 predefined neighborhoods. A loop explores the concatenated neighborhood, and the current objective value and the best objective value are stored in an array. I want to be able to identify the individual neighborhood which includes the best objective value. How can I do that?

Regards,
#CPOptimizer
#DecisionOptimization

Originally posted by: SystemAdmin

[shaw said:]

Hello,

Assuming you have:

IloNHood nhood = nh1 + nh2 + nh3 + nh4 + nh5;

Then you can use the class IloNeighborIdentifier which you pass to IloSingleMove.
When a move is taken, you can get the index of the winning move via:

IloInt idx = IloIIM(solver).getAtIndex(neighborhoodIdentifer)

You can then compare this index against the sizes of the subordinate
neighborhoods to find the winning neighborhood.  So:

idx -= nh1.getSize();
if (idx < 0) nh = 1;<br />idx -= nh2.getSize();
if (idx < 0) nh = 2;<br />//etc.



Paul
#CPOptimizer
#DecisionOptimization

Originally posted by: SystemAdmin

[anahana said:]

Dear Paul,

Thanks for the help, I will try it out and let you know.

Regards,
#CPOptimizer
#DecisionOptimization

Originally posted by: SystemAdmin

[anahana said:]

Dear Paul,

shouldn't the method getLocalNHood(solver, IloIIM(solver).getAtIndex(nid)) give the same results?
#CPOptimizer
#DecisionOptimization

Originally posted by: SystemAdmin

[shaw said:]

Yes, it should.


Paul
#CPOptimizer
#DecisionOptimization

Originally posted by: SystemAdmin

[anahana said:]

Thanks.
#CPOptimizer
#DecisionOptimization