Human-guided tabu search

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 41-47

  Klau, Gunnar W ^a   Lesh, Neal ^b   Marks, Joe ^b   Mitzenmacher, Michael ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTERACTIVE COMPUTER SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION;

VEHICLE ROUTING;

HUMAN COMPUTER INTERACTION;

EID: 0036923679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Aarts, E.; Laarhoven, P. v.; Lenstra, J.; and Ulder, N. 1994. A computational study of local search algorithms for job-shop scheduling. ORSA Journal on Computing 6(2):118-125.
2. Anderson, D.; Anderson, E.; Lesh, N.; Marks, J.; Mirtich, B.; Ratajczak, D.; and Ryall, K. 2000. Human-guided simple search. In Proc. of AAAI 2000, 209-216.
3. Bastolla, U.; Frauenkron, H.; Gerstner, E.; Grassberger, P.; and Nadler, W. 1998. Testing a new Monte Carlo algorithm for protein folding. PROTEINS 32:52-66.
4. Chien, S.; Rabideau, G.; Willis, J.; and Mann, T. 1999. Automating planning and scheduling of shuttle payload operations. J. Artificial Intelligence 114:239-255.
5. Colgan, L.; Spence, R.; and Rankin, P. 1995. The cockpit metaphor. Behaviour & Information Technology 14(4):251-263.
6. Dill, A. K. 1985. Theory for the folding and stability of globular proteins. Biochemistry 24:1501.
7. Eades, P., and Wormald, N. C. 1994. Edge crossings in drawings of bipartite graphs. Algorithmica 11:379-403.
8. Feillet, D.; Dejax, P.; and Gendreau, M. 2001. The selective Traveling Salesman Problem and extensions: an overview. TR CRT-2001-25, Laboratoire Productique Logistique, Ecole Centrale Paris.
9. Gleicher, M., and Witkin, A. 1994. Drawing with constraints. Visual Computer 11:39-51.
10. Glover, F., and Laguna, M. 1997. Tabu Search. Kluwer academic publishers.
11. Gutwenger, C.; Jünger, M.; Klau, G. W.; Leipert, S.; and Mutzel, P. 2002. Graph drawing algorithm engineering with AGD. In Diehl, S., ed., Software Visualization: State of the An Survey. Proc. of the International Dagstuhl Seminar on Software Visualization, Schloss Dagstuhl, May 2001, volume 2269 of Lecture Notes in Computer Science, Springer. To appear.
12. Klau, G. W.; Lesh, N.; Marks, J.; Mitzenmacher, M.; and Schafer, G. T. 2002. The HuGS platform: A toolkit for interactive optimization. To appear in Advanced Visual Interfaces 2002.
13. Kuusik, A. 2000. Integer Linear Programming Approaches to Hierarchical Graph Drawing. Ph.D. Dissertation, Department of Computer Science and Information Systems, University of Limerick, Ireland.
14. Nascimento, H. d., and Eades, P. 2001. User hints for directed graph drawing. To appear in Graph Drawing.
15. Nelson, G. 1985. Juno, a constraint based graphics system. Computer Graphics (Proc. of SIGGRAPH '85) 19(3):235-243.
16. Ryall, K.; Marks, J.; and Shieber, S. 1997. Glide: An interactive system for graph drawing. In Proc. of the 1997 ACM SIGGRAPH Symposium on User Interface Software and Technology (UIST '97), 97-104.
17. Scott, S.; Lesh, N.; and Klau, G. W. 2002. Investigating human-computer optimization. To appear in CHI 2002.
18. Sims, K. 1991. Artificial evolution for computer graphics. Comp. Graphics (Proc. of SIGGRAPH '91) 25(3):319-328.
19. Storer, R.; Wu, S.; and Vaccari, R. 1992. New search spaces for sequencing instances with application to job shop scheduling. Management Science 38:1495-1509.
20. Todd, S., and Latham, W. 1992. Evolutionary Art and Computers. Academic Press.
21. Waters, C. 1984. Interactive vehicle routeing. Journal of Operational Research Society 35(9):821-826.
22. Yamada, T., and Nakano, R. 1992. A genetic algorithm applicable to large-scale job-shop instances. In Parallel instance solving from nature 2. North-Holland, Amsterdam: R. Manner, B. Manderick(eds). 281-290.