WebMonkeys
Programmer
Hello
I have a set of predicates that will generate the route, given a 'shopping list.' I want to be able to find the shortest route to get the items in this list.
At the moment, my program is generating all of the possible permuations of the shopping list, working out the route for every one of those permutations, and then works out the shortest of these routes.
This works, it works ok. But for large shopping lists, it will take a very very long time to determine the shortest path.
Does anyone have any ideas about how I may solve this speed problem?
Thank you
I have a set of predicates that will generate the route, given a 'shopping list.' I want to be able to find the shortest route to get the items in this list.
At the moment, my program is generating all of the possible permuations of the shopping list, working out the route for every one of those permutations, and then works out the shortest of these routes.
This works, it works ok. But for large shopping lists, it will take a very very long time to determine the shortest path.
Does anyone have any ideas about how I may solve this speed problem?
Thank you