Iterated Local Search
A metaheuristic optimization algorithm that applies a perturbation after local search and then restarts, in order to escape local optima.
Timeline (last 90 days)
In another set of tests with matching inputs, under the constraint that output latency exceeding 100 milliseconds yields zero utility, the full FPTR pipeline outperforms six independent search baselines (ALNS, tabu search, genetic algorithm, simulated annealing, iterated local search, and GRASP) by 6.68% to 8.35%.
Iterated local search applies a perturbation after local search and then restarts.
General search frameworks (such as ALNS, tabu search, genetic algorithm, simulated annealing, iterated local search, and GRASP) may fail under hard deadlines because they cannot guarantee a feasible solution at every iteration, whereas FPTR avoids this deficiency through transactional refinement.
All Facts (3)
In another set of tests with matching inputs, under the constraint that output latency exceeding 100 milliseconds yields zero utility, the full FPTR pipeline outperforms six independent search baselines (ALNS, tabu search, genetic algorithm, simulated annealing, iterated local search, and GRASP) by 6.68% to 8.35%.
50%UnverifiedIterated local search applies a perturbation after local search and then restarts.
50%UnverifiedGeneral search frameworks (such as ALNS, tabu search, genetic algorithm, simulated annealing, iterated local search, and GRASP) may fail under hard deadlines because they cannot guarantee a feasible solution at every iteration, whereas FPTR avoids this deficiency through transactional refinement.
50%