A local search/constraint propagation hybrid for a network routing problem

Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2004

Volumn 1, Issue , 2004, Pages 281-286

  Lever, Jonathan ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER PROGRAMMING; COMPUTER SCIENCE; OPTIMIZATION; PROBLEM SOLVING; ROUTERS;

CONSTRAINT PROGRAMMING; HYBRIDIZATION; NETWORK ROUTING; OVER CONSTRAINED PROBLEMS;

CONSTRAINT THEORY;

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

References (13)

1. Barnhart, C., Hane, C. A., and Vance, P. H. 2000. Using branch-and-price-and cut to solve origin-destination integer multicommodity flow problems. Operations Research 48(2):318-326.
2. Casseau, Y., and Laburthe, F. 1999. Heuristics for large constrained vehicle routing problems. Journal of Heuristics, 5(3):281-303. Kluwer.
3. Genreau, M., and Pesant, G. 1999. A constraint programming framework for local search methods. Journal of Heuristics, 5(3):255-279. Kluwer.
4. Harvey, W. D. and Ginsberg, M. L. 1995. Limited discrepancy search. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 607-615. Los Angeles.: Morgan Kaufmann.
5. Jussien, N., and Lhomme, O. 2000. Local search with constraint propagation and conflict-based heuristics. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, 2000:169-174. AAAI Press.
6. Kamarainen, O., and El-Sakkout, H. 2002. Local probing applied to scheduling. In Proceedings of the Eighth International Conference on the Principles and Practice of Constraint Programming, 155-171. Springer-Verlag.
7. Kirkpatrick, S., Gelatt Jr., C, and Vecchi, M. 1983. Optimization by simulated annealing. Science 220:671-680.
8. Lee, W., Hluchyi, M., and Humblet, P. 1995. Routing subject to quality of service constraints in integrated communication networks. IEEE Network, July 1995: 46-55.
9. Liatsos, V., Novello, S., and El-Sakkout, H. 2003. A probe backtrack search algorithm for network routing. In Proceedings of the CP2003 Third Workshop on Cooperating Solvers in Constraint Programming, Springer Verlag.
10. Schaerf, A. 1997. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1254-1259. Los Angeles.: Morgan Kaufmann.
11. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of the Fourth International Conference on the Principles and Practice of Constraint Programming, 417-431. Springer-Verlag.
12. Wang, Y., and Wang, Z. 1999. Explicit routing algorithms for internet traffic engineering. In Proceedings of IEEE ICCCN'99.
13. Zhang, J., and Zhang, H. 1996. Combining local search and backtracking techniques for constraint satisfaction. In Proceedings of the American Association for Artificial Intelligence, 1996:369-374. AAAI Press.