documents/intro_paper/eclipse.tex

86 locally repairing an original solution, and repeating the process
481 Naturally the implemented solution to an industrial problem must be
483 It is sometimes argued that this is only possible if the solution is
504 the implemented solution has proved not to solve the actual industrial
507 The solution cannot then be modified to meet the actual, or new,
765 the best feasible solution to the problem is one which minimises the
881 and 99 is eight coins!  One solution is:
939 solution.
1120 *       Found a solution with cost 6
1242 *       no (more) solution.
1421 in cases where the constraints have only one solution, interval
1543 *       no (more) solution.
2132 solution, that the cost of future solutions must be better than the
2133 cost of the current best solution.
2183 The linear solver can efficiently find an optimal solution to the
2281 *       Found a solution with cost -11
2324 The optimal solution is indeed the one found first, which testifies to
2350 solution repair, achieve faster convergence on good solutions than
2356 solution repair.
2384 outperform solution repair.
2389 which change after an initial solution has been found.
2391 solution for reasons which are not captured in the implementation, and
2392 adds new constraints to exclude this solution.
2397 support solution repair.
2402 constraint handler, but from the original solution to the original
2411 comprise a feasible solution to the new problem and there is no need
2412 to repair the solution at all!
2433 so as to minimise disruption to the original solution.
2468         [X,Y,Z] tent_set [1,2,3],              % set existing solution
2470         [X,Y,Z] tent_get [NewX,NewY,NewZ].  % get repaired solution
2479 solution
2486 keeps the value of the existing solution, and is
2524 value such that the cost of the new solution is better than the cost
2525 of the previous solution.
2530 not necessarily yield a feasible solution.
2532 solution which incorporates the change.
2548 way that the next solution returned from {\em eplex} must satisfy it.
2550 dynamic constraint problem: there is an original solution and the
2551 requirement is to modify that solution to satisfy some new
2619 However hybrid search algorithms, in particular utilising solution