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

International Journal on Artificial Intelligence Tools

Volumn 14, Issue 1-2, 2005, Pages 43-60

  Lever, Jonathan ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Constraint programming; Hybrid Algorithms; Local search; Network routing

Indexed keywords

EID: 33746185744     PISSN: 02182130     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218213005001989     Document Type: Conference Paper

References (13)

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