User control in cooperative computer-aided design
UIST '90 Proceedings of the 3rd annual ACM SIGGRAPH symposium on User interface software and technology
Artificial evolution for computer graphics
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
The Visual Computer: International Journal of Computer Graphics
An interactive constraint-based system for drawing graphs
Proceedings of the 10th annual ACM symposium on User interface software and technology
Juno, a constraint-based graphics system
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Evolutionary Art and Computers
Evolutionary Art and Computers
Column-Based Strip Packing Using Ordered and Compliant Containment
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Guiding knowledge discovery through interactive data mining
Managing data mining technologies in organizations
CartoDraw: A Fast Algorithm for Generating Contiguous Cartograms
IEEE Transactions on Visualization and Computer Graphics
GAM: a guidance enabled association mining environment
International Journal of Business Intelligence and Data Mining
Techniques and Tools for Local Search Landscape Visualization and Analysis
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Grapheur: a software architecture for reactive and interactive optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
An interactive multi-user system for simultaneous graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Hi-index | 0.00 |
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 sample 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 to explore, 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 information-visualization 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.