Interactive heuristic search and visualization for solving combinatorial optimization problems

摘要

A system enables an interactively guided heuristic search for solving a combinatorial optimization problem. The system initially performs a hill-climbing search on the combinatorial optimization problem to obtain a solution using initial default parameters. The current solution and the combinatorial optimization problem are visualized on an optimization table, a table-top display device. The parameters are altered based on the visualization of the combinatorial optimization problem and the current solution. Then, the searching, visualizing, and setting are repeated until the solution is selected as an acceptable solution of the combinatorial optimization problem. During the repeating, the parameters can be a set of probabilities, and in which case the search is a random perturbation-based search. Alternatively, the parameters can be a set of priorities, in which case the search is an exhaustive local search.