Abstract
In this paper, we propose an effective search procedure that interleaves two steps: subproblem generation and subproblem solution. We mainly focus on the first part. It consists of a variable domain value ranking based on reduced costs. Exploiting the ranking, we generate, in a Limited Discrepancy Search tree, the most promising subproblems first. An interesting result is that reduced costs provide a very precise ranking that allows to almost always find the optimal solution in the first generated subproblem, even if its dimension is significantly smaller than that of the original problem. Concerning the proof of optimality, we exploit a way to increase the lower bound for subproblems at higher discrepancies. We show experimental results on the TSP and its time constrained variant to show the effectiveness of the proposed approach, but the technique could be generalized for other problems.
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
N. Ascheuer. ATSPTW-Problem instances. http://www.zib.de/ascheuer/ATSPTWinstances.html.
G. Carpaneto, S. Martello, and P. Toth. Algorithms and codes for the Assignment Problem. In B. Simeone et al., editor, Fortran Codes for Network Optimization-Annals of Operations Research, pages 193–223. 1988.
M. Dell’Amico and S. Martello. Linear assignment. In F. Maffioli M. Dell’Amico and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 355–371. Wiley, 1997.
T. Fahle and M. Sellman. Cp-based lagrangean relaxation for a multi-media application. In M. Wallace Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming [13], 2001.
T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.
M. Fischetti and P. Toth. An additive bounding procedure for combinatorial optimization problems. Operations Research, 37:319–328, 1989.
M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, 53:173–197, 1992.
F. Focacci, P. Laborie, and W. Nuijten. Solving scheduling problems with setup times and alternative resources. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS2000), 2000.
F. Focacci, A. Lodi, and M. Milano. Cost-based domain filtering. In CP’99 Conference on Principles and Practice of Constraint Programming, pages 189–203, 1999.
F. Focacci, A. Lodi, and M. Milano. A hybrid exact algorithm for the TSPTW. INFORMS Journal of Computing, to appear. Special issue on The merging of Mathematical Programming and Constraint Programming.
F. Focacci, A. Lodi, M. Milano, and D. Vigo Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 1999.
F. Focacci, A. Lodi, M. Milano, and D. Vigo. Solving TSP through the integration of OR and CP techniques. Proc. CP98 Workshop on Large Scale Combinatorial Optimisation and Constraints, 1998.
C. Gervet and M. Wallace Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2001.
M. L. Ginsberg and W. D. Harvey. Iterative broadening. Artificial Intelligence, 55(2):367–383, 1992.
W. D. Harvey and M. L. Ginsberg. Limited Discrepancy Search. In C. S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95); Vol. 1, pages 607–615, 1995.
ILOG. ILOG Scheduler 4.4, Reference Manual, 2000.
ILOG. ILOG Solver 4.4, Reference Manual, 2000.
U. Junker, S. Karisch, and S. Tschoeke Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2000.
F. Laburthe and N. Jussien Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2002.
P. Langley. Systematic and nonsystematic search strategies. In Proceedings of the 1st International Conference on AI Planning Systems, pages 145–152, 1992.
A. Lodi. Personal communication.
M. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, 47:19–36, 1990.
G. Reinelt. TSPLIB-a Travelling Salesman Problem Library. ORSA Journal on Computing, 3:376–384, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milano, M., van Hoeve, W.J. (2002). Reduced Cost-Based Ranking for Generating Promising Subproblems. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive