Abstract
Local probing is a framework that integrates (a) local search into (b) backtrack search enhanced with local consistency techniques, by means of probe backtrack search hybridization. Previously, local probing was shown effective at solving generic resource constrained scheduling problems. In this paper, local probing is used to solve a network routing application, where the goal is to route traffic demands over a communication network. The aim of this paper is (1) to demonstrate the wider applicability of local probing, and (2) to explore the impact of certain local probing configuration decisions in more detail. This is accomplished by means of an experimental evaluation on realistic networking scenarios that vary greatly in their characteristics. This paper yields a better understanding of local probing as well as a versatile local probing algorithm for network routing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajili, F., Sakkout, H.E.: A probe based algorithm for piecewise linear optimization in scheduling. Annals of Operations Research 118, 35–48 (2003)
Beck, C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research 118, 49–71 (2003)
Benoist, T., Bourreau, E.: Improving global constraints support by local search. In: Proc. of CoSolv 2003 (2003)
Caseau, Y., Laburthe, F.: Disjunctive scheduling with task intervals. Technical Report LIENS-95-25, École Normale Supérieure, Paris, France (1995)
Caseau, Y., Laburthe, F.: Heuristics for large constrained vehicle routing problems. Journal of Heuristics 5(3), 281–303 (1999)
Sakkout, H.E., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5(4), 359–388 (2000)
Focacci, F., Shaw, P.: Pruning sub-optimal search branches using local search. In: Proc. of CP-AI-OR 2002 (2002)
Hooker, J.N., Kim, H.-J., Ottosson, G.: A declarative modeling framework that integrates solution methods. Annals of Operations Research 104, 141–161 (2001)
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence 139, 21–45 (2002)
Kamarainen, O., Sakkout, H.E.: Local probing applied to scheduling. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 155–171. Springer, Heidelberg (2002)
Kirkpatrick, S., Gelatt Jr., C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Liatsos, V., Novello, S., Sakkout, H.E.: A probe backtrack search algorithm for network routing. In: Proc. of CoSolv (2003)
Loudni, S., David, P., Boizumault, P.: On-line resources allocation for ATM networks with rerouting. In: Proc. of CP-AI-OR 2003 (2003)
Mazure, B., Saïs, L., Grégoire, É.: Boosting complete techniques thanks to local search. Annals of Mathematics and Artificial Intelligence 22, 319–331 (1998)
Prestwich, S.: A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 337–352. Springer, Heidelberg (2000)
Rousseau, L., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. J. Heuristics 8, 45–58 (2002)
M. Sellmann and W. Harvey. Heuristic constraint propagation: Using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem. In Proc. of CP-AI-OR’02, 2002.
P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proc. of CP’98, pages 417–431, 1998.
M. Wallace and J. Schimpf. Finding the right hybrid algorithm - a combinatorial meta-problem. Annals of Mathematics and Artificial Intelligence, 34:259–269, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kamarainen, O., El Sakkout, H. (2004). Local Probing Applied to Network Routing. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive