Abstract
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving random problems and a tight real-world resource allocation problem. The restart strategy proposed by Gomes et al. [1] requires the specification of a cutoff value determined from an overall profile of the cost of search for solving the problem. When no such profile is known, the cutoff value is chosen by trial-and-error. The Randomization and Geometric Restart (RGR) proposed by Walsh does not rely on a cost profile but determines the cutoff value as a function of a constant parameter and the number of variables in the problem [2]. Unlike these strategies, which have fixed restart schedules, our technique (RDGR) dynamically adapts the value of the cutoff parameter to the results of the search process. Our experiments investigate the behavior of these techniques using the cumulative distribution of the solutions, over different run-time durations, values of the cutoff, and problem types. We show that distinguishing between solvable and over-constrained problem instances yields new insights on the relative performance of the search techniques tested. We propose to use this characterization as a basis for building new strategies of cooperative, hybrid search.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gomes, C.P., Selman, B., Kautz, H.: Boosting Combinatorial Search Through Randomization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), pp. 431–437 (1998)
Walsh, T.: Search in a Small World. In: Proc. of the 16th IJCAI, pp. 1172–1177 (1999)
Lim, R., Guddeti, V.P., Choueiry, B.Y.: An Interactive System for Hiring and Managing Graduate Teaching Assistants. In: Conference on Prestigious Applications of Intelligent Systems (ECAI 2004), Valencia, Spain, pp. 730–734 (2004)
Glaubius, R.: A Constraint Processing Approach to Assigning Graduate Teaching Assistants to Courses. Undergraduate Honors Thesis. Department of Computer Science & Engineering, University of Nebraska-Lincoln (2001)
Glaubius, R., Choueiry, B.Y.: Constraint Constraint Modeling and Reformulation in the Context of Academic Task Assignment. In: Working Notes of the Workshop Modelling and Solving Problems with Constraints, ECAI 2002, Lyon, France (2002)
Glaubius, R., Choueiry, B.Y.: Constraint Modeling in the Context of Academic Task Assignment. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 789. Springer, Heidelberg (2002)
Freuder, E.C., Wallace, R.J.: Partial Constraint Satisfaction. Artificial Intelligence 58, 21–70 (1992)
Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence 9(3), 268–299 (1993)
Guddeti, V.P.: Empirical Evaluation of Heuristic and Randomized Backtrack Search. Master’s thesis, Computer Science & Engineering, University of Nebraska-Lincoln (2004)
Zou, H., Choueiry, B.Y.: Characterizing the Behavior of a Multi-Agent Search by Using it to Solve a Tight, Real-World Resource Allocation Problem. In: Workshop on Applications of Constraint Programming, Kinsale, County Cork, Ireland, pp. 81–101 (2003)
Zou, H.: Iterative Improvement Techniques for Solving Tight Constraint Satisfaction Problems. Master’s thesis, Computer Science & Engineering, University of Nebraska-Lincoln (2003)
Zou, H., Choueiry, B.Y.: Multi-agent Based Search versus Local Search and Backtrack Search for Solving Tight CSPs: A Practical Case Study. In: Working Notes of the Workshop on Stochastic Search Algorithms (IJCAI 2003), Acapulco, Mexico, pp. 17–24 (2003)
Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58, 161–205 (1992)
Barták, R.: Online Guide to Constraint Programming (1998), http://www.kti.ms.mff.cuni.cz/~bartak/constraints
Liu, J., Jing, H., Tang, Y.: Multi-Agent Oriented Constraint Satisfaction. Artificial Intelligence 136, 101–144 (2002)
Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: Israel Symposium on Theory of Computing Systems, pp. 128–133 (1993)
Hoos, H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann, San Francisco (2004)
van Hemert, J.I.: Random CSP: generating constraint satisfaction problems randomly (2004), Homepages: http://www.cwi.nl/~jvhemert/randomcsp.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guddeti, V.P., Choueiry, B.Y. (2005). Characterization of a New Restart Strategy for Randomized Backtrack Search. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2004. Lecture Notes in Computer Science(), vol 3419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11402763_5
Download citation
DOI: https://doi.org/10.1007/11402763_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25176-7
Online ISBN: 978-3-540-32252-8
eBook Packages: Computer ScienceComputer Science (R0)