Originally posted by: davidoff

Hello

I'm currently investigating some kind of Vehicle Routing Problem (VRP) . The worst case would be to run it against a 1000 locations instance.

I'm interested to know what would be the best in order to access distance between these 1000 potential locations to be visited.

Choice 1 : store the records City1 City2 Distance in a table (around 500 000 records)
Choice 2 : store the records City xpos ypos , and then ask OPL to compute the euclidian distance (1000 records, but the cost of preprocess is now in OPL)

Or are none of these choices tracktable in a reasonable time/memory by OPL ?

Thanks

David
#DecisionOptimization
#OPLusingCPOptimizer

Originally posted by: rdumeur

Hi David,

As this question is not specific to OPL using CP Optimizer, it would be best to ask it to this more general forum:

http://www.ibm.com/developerworks/forums/forum.jspa?forumID=2059&start=0

I've pointed the concerned team to your message so that they can handle your question.

Cheers,

Renaud
#DecisionOptimization
#OPLusingCPOptimizer

Hi

it is a memory versus time question.
I would choose Choice 2 as far as I am concerned

Regards

Alex
#DecisionOptimization
#OPLusingCPOptimizer