IBM ILOG Dispatcher User's Manual > Developing Dispatcher Applications > Developing Your Own First Solution Heuristics > Creating your own first solution heuristic > Building a Complete Solution |
Building a Complete Solution |
INDEX
![]() |
The last goal to be written recursively chooses a vehicle and builds its route. It considers the visits which have not yet been assigned to any vehicle by the end of the search and marks those visits as "unperformed." Choosing a vehicle is done by iterating over all vehicles and finding one which has an incomplete route and which has the largest capacity for dimension dim
.
Building a route for the selected vehicle is done using the goals described in the preceding sections. The search ends by making unassigned visits unperformed when all open vehicles have been used.
In order to have more propagation from the path constraints during search the filter level is set to IlcBasic
.
To use this goal, a subclass of IlcGoal
, in your Concert Technology modeling environment you wrap it using the Solver ILOCPGOALWRAPPER
macro.
ILOCPGOALWRAPPER1(GenerateFirstSolution, solver, IloDimension1, dim) { return Ilc_GenerateFirstSolution(solver, dim); } |
Note |
This approach can be adapted to the user's needs by customizing the functions selecting the vehicles and the visits. |
© Copyright IBM Corp. 1987, 2009. Legal terms. | PREVIOUS NEXT |