TY - GEN
T1 - Human-guided simple search
T2 - 1999 Workshop on New Paradigms in Information Visualization and Manipulation, NPIVM 1999
AU - Anderson, David
AU - Anderson, Emily
AU - Lesh, Neal
AU - Marks, Joe
AU - Perlin, Ken
AU - Ratajczak, David
AU - Ryall, Kathy
N1 - Publisher Copyright:
© Copyright 2000 ACM.
PY - 1999/11/1
Y1 - 1999/11/1
N2 - Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some form of gradient descent to find local minima with some strategy for escaping nonoptimal local minima and traversing the search space. Our idea is to divide these two subtasks cleanly between human and computer: in our paradigm of human-guided simple search the computer is responsible only for finding local minima using a simple search method; using information visualization, the human identifies promising regions of the search space for the computer toexplore, and also intervenes to help it escape nonoptimal local minima. This is a specific example of a more general strategy, that of combining heuristic-search and informationvisualization techniques in an interactive system. We are applying our approach to the problem of capacitated vehicle routing with time windows (CVRTW). We describe the design and implementation of our initial prototype, some preliminary results, and our plans for future work.
AB - Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some form of gradient descent to find local minima with some strategy for escaping nonoptimal local minima and traversing the search space. Our idea is to divide these two subtasks cleanly between human and computer: in our paradigm of human-guided simple search the computer is responsible only for finding local minima using a simple search method; using information visualization, the human identifies promising regions of the search space for the computer toexplore, and also intervenes to help it escape nonoptimal local minima. This is a specific example of a more general strategy, that of combining heuristic-search and informationvisualization techniques in an interactive system. We are applying our approach to the problem of capacitated vehicle routing with time windows (CVRTW). We describe the design and implementation of our initial prototype, some preliminary results, and our plans for future work.
KW - Combinatorial optimization
KW - Computer-human interaction
KW - Information visualization
KW - Interactive systems
KW - Operations research
KW - Vehicle routing
UR - http://www.scopus.com/inward/record.url?scp=85015728041&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015728041&partnerID=8YFLogxK
U2 - 10.1145/331770.331778
DO - 10.1145/331770.331778
M3 - Conference contribution
AN - SCOPUS:85015728041
T3 - Proceedings of the 1999 Workshop on New Paradigms in Information Visualization and Manipulation in conjunction with the 8th ACM Internation Conference on Information and Knowledge Management, NPIVM 1999
SP - 21
EP - 25
BT - Proceedings of the 1999 Workshop on New Paradigms in Information Visualization and Manipulation in conjunction with the 8th ACM Internation Conference on Information and Knowledge Management, NPIVM 1999
PB - Association for Computing Machinery, Inc
Y2 - 2 November 1999 through 6 November 1999
ER -