Abstract
The currently best CP method for solving the Travelling Salesman Problem is the Weighted Circuit Constraint associated with the LCFirst search strategy. The use of Embarrassingly Parallel Search (EPS) for this model is problematic because EPS decomposition is a depth-bounded process unlike the LCFirst search strategy which is depth-first. We present Bound-Backtrack-and-Dive, a method which solves this issue. First, we run a sequential solving of the problem with a bounded number of backtracks in order to extract key information from LCFirst, then we decompose with EPS using that information rather than LCFirst. The experimental results show that we obtain almost a linear gain on the number of cores and that Bound-Backtrack-and-Dive may considerably reduce the number of backtracks performed for some 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
Similar content being viewed by others
Notes
- 1.
The activity time of a worker is the sum of the solving times of its sub-problems.
References
Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesmanproblem: A Computational Study. Princeton University Press, Princeton (2006)
Benchimol, P., Régin, J.-C., Rousseau, L.-M., Rueher, M., van Hoeve, W.-J.: Improving the held and karp approach with constraint programming. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 40–44. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13520-0_6
Benchimol, P., Van Hoeve, W.J., Régin, J.C., Rousseau, L.M., Rueher, M.: Improved filtering for weighted circuit constraints. Constraints 17(3), 205–233 (2012). https://hal.archives-ouvertes.fr/hal-01344070
Fages, J.G., Lorca, X., Rousseau, L.M.: The salesman and the tree: the importance of search in CP. Constraints 21(2), 145–162 (2016)
Haralick, R., Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263–313 (1979)
Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138–1162 (1970)
Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: part ii. Math Program. 1(1), 6–25 (1971)
Isoart, N., Régin, J.-C.: Integration of structural constraints into TSP models. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 284–299. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30048-7_17
Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97–109 (1985). https://doi.org/10.1016/0004-3702(85)90084-0
Lecoutre, C., Saïs, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artif. Intell. 173(18), 1592–1614 (2009)
Malapert, A., Régin, J., Rezgui, M.: Embarrassingly parallel search in constraint programming. J. Artif. Intell. Res. (JAIR) 57, 421–464 (2016)
Régin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 596–610. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40627-0_45
Reinelt, G.: TSPLIB–a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Isoart, N., Régin, JC. (2020). Parallelization of TSP Solving in CP. In: Simonis, H. (eds) Principles and Practice of Constraint Programming. CP 2020. Lecture Notes in Computer Science(), vol 12333. Springer, Cham. https://doi.org/10.1007/978-3-030-58475-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-58475-7_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58474-0
Online ISBN: 978-3-030-58475-7
eBook Packages: Computer ScienceComputer Science (R0)