Depth-First Branch-and-Bound versus Local Search: A Case Study

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 930-935

  Zhang, Weixiong ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; LOCAL SEARCH (OPTIMIZATION); TRAVELING SALESMAN PROBLEM;

ANYTIME ALGORITHM; ASYMMETRIC TRAVELLING SALESMAN PROBLEMS; BRANCH AND BOUNDS; CASE-STUDIES; COMBINATORIAL OPTIMIZATION PROBLEMS; DEPTH FIRST; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; OPTIMAL SOLUTIONS; PROBLEM STRUCTURE;

APPROXIMATION ALGORITHMS;

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

References (24)

1. Balas, E., and Toth, P. 1985. Branch and bound methods. In The Traveling Salesman Problem. Essex, England: John Wiley & Sons. 361-401.
2. Carpaneto, G., and Toth, P. 1980. Some new branching and bounding criteria for the asymmetric traveling salesman problem. Management Science 26:736-743.
3. Dean, T., and Boddy, M. 1988. An analysis of time-dependent planning. In Procceedings of the 7th National Conference on Artificial Intelligence (AAAI-88), 49-54.
4. Dechter, R., and Kask, K. Personal communications. 1999-2000.
5. Frieze, A.; Galbiati, G.; and Maffioli, F. 1982. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Network 12:23-39.
6. Hoebel, L., and Zilberstein, S., eds. 1997. Proceedings of the AAAI Workshop on Building Resource-Bounded Reasoning Systems. Providence, RI: AAAI.
7. Horvitz, E., and Zilberstein, S., eds. 1996. Proceedings of the AAAI Fall Symposium on Flexible Computation in Intelligent Systems: Results, Issues and Opportunities. Cambridge, MA: AAAI.
8. Ibaraki, T.; Muro, S.; Murakami, T.; and Hasegawa, T. 1983. Using branch-and-bound algorithms to obtain suboptimal solutions. Zeitchrift für Operations Research 27:177-202.
9. Johnson, D. S., and McGeoch, L. A. 1997. The Traveling Salesman Problem: A case study. In Local Search in Combinatorial Optimization. John Wiley & Sons. 215-310.
10. Johnson, D. S. 1990. Local optimization and the traveling salesman problem. In Proc. of the 17th Intern. Colloquium on Automata, Languages and Programming, 446-461.
11. Kanellakis, P. C., and Papadimitriou, C. H. 1980. Local search for the asymmetric traveling salesman problem. Operations Research 28:1086-1099.
12. Karp, R. M. 1979. A patching algorithm for the non-symmetric Traveling-Salesman Problem. SIAM Journal on Computing 8:561-573.
13. Kask, K., and Dechter, R. 1999. Stochastic local search for bayesian networks. In Proc. Intern. Workshop on AI and Statistics.
14. Korf, R. E. 1998. A complete anytime algorithm for number partitioning. Artificial Intelligence 105:133-155.
15. Lawler, E. L.; Lenstra, J. K.; Kan, A. H. G. R.; and Shmoys, D. B. 1985. The Traveling Salesman Problem. Essex, England: John Wiley & Sons.
16. Lin, S., and Kernighan, B. W. 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21:498-516.
17. Martello, S., and Toth, P. 1987. Linear assignment problems. Annals of Discrete Math. 31:259-282.
18. Miller, D. L., and Pekny, J. F. 1991. Exact solution of large asymmetric traveling salesman problems. Science 251:754-761.
19. Papadimitriou, C. H., and Kanellakis, P. C. 1980. Flowshop scheduling with limited temporary storage. Journal of ACM 27:533-549.
20. Papadimitriou, C. H., and Steiglitz, K. 1982. Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall.
21. Papadimitriou, C. H. 1994. Computational Complexity. Reading, MA: Addison-Wesley.
22. Reddi, S. S., and Ramamoorthy, C. V. 1972. On the flowshop sequencing problem with no wait in process. Operational Research Quarterly 23:323-331. ftp://ftp.zib.de/pub/packages/mptestdata/tsp/tsplib/tsplib.html.
23. Zhang, W., and Korf, R. E. 1995. Performance of linear-space search algorithms. Artificial Intelligence 79:241-292.
24. Zhang, W., and Korf, R. E. 1996. A study of complexity transitions on the asymmetric Traveling Salesman Problem. Artificial Intelligence 81:223-239.