{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:02:27Z","timestamp":1764784947887,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086229"},{"type":"electronic","value":"9783031086236"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_10","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"59-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Machine Learning Constructives and\u00a0Local Searches for\u00a0the\u00a0Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Tommaso","family":"Vitali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto Junior","family":"Mele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Maria","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Montemanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"key":"10_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2020","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-030-78230-6_26","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"J Fitzpatrick","year":"2021","unstructured":"Fitzpatrick, J., Ajwani, D., Carroll, P.: Learning to sparsify travelling salesman problem instances. In: Stuckey, P.J. (ed.) CPAIOR 2021. LNCS, vol. 12735, pp. 410\u2013426. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78230-6_26"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Fu, Z.H., Qiu, K.B., Zha, H.: Generalize a small pre-trained model to arbitrarily large TSP instances. arXiv preprint: arXiv:2012.10658 (2020)","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/5254.708428","volume":"13","author":"MA Hearst","year":"1998","unstructured":"Hearst, M.A., Dumais, S.T., Osuna, E., Platt, J., Scholkopf, B.: Support vector machines. IEEE Intell. Syst. Appl. 13(4), 18\u201328 (1998)","journal-title":"IEEE Intell. Syst. Appl."},{"key":"10_CR9","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint: arXiv:1803.08475 (2018)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TEPM.2003.813002","volume":"26","author":"R Kumar","year":"2003","unstructured":"Kumar, R., Luo, Z.: Optimizing the operation sequence of a chip placement machine using TSP model. IEEE Trans. Electron. Packag. Manuf. 26(1), 14\u201321 (2003)","journal-title":"IEEE Trans. Electron. Packag. Manuf."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"DT Lee","year":"1980","unstructured":"Lee, D.T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9, 219\u2013242 (1980)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"10_CR12","first-page":"539","volume":"39","author":"XY Liu","year":"2008","unstructured":"Liu, X.Y., Wu, J., Zhou, Z.H.: Exploratory undersampling for class-imbalance learning. IEEE Trans. Syst. Man Cybern. 39, 539\u2013550 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10_CR13","unstructured":"Marcus, G.: Deep learning: a critical appraisal. arXiv preprint: arXiv:1801.00631 (2018)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6377(92)90028-2","volume":"11","author":"O Martin","year":"1992","unstructured":"Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett. 11, 219\u2013224 (1992)","journal-title":"Oper. Res. Lett."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Mele, U.J., Chou, X., Gambardella, L.M., Montemanni, R.: Reinforcement learning and additional rewards for the traveling salesman problem. In: Proceedings of the 8th International Conference on Industrial Engineering and Applications, pp. 198\u2013204 (2021)","DOI":"10.1145\/3463858.3463885"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Mele, U.J., Gambardella, L.M., Montemanni, R.: Machine learning approaches for the traveling salesman problem: a survey. In: Proceedings of the 8th International Conference on Industrial Engineering and Applications, pp. 182\u2013186 (2021)","DOI":"10.1145\/3463858.3463869"},{"issue":"9","key":"10_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.3390\/a14090267","volume":"14","author":"UJ Mele","year":"2021","unstructured":"Mele, U.J., Gambardella, L.M., Montemanni, R.: A new constructive heuristic driven by machine learning for the traveling salesman problem. Algorithms 14(9), 267 (2021)","journal-title":"Algorithms"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Miki, S., Yamamoto, D., Ebara, H.: Applying deep learning and reinforcement learning to traveling salesman problem. In: International Conference on Computing, Electronics and Communications Engineering, pp. 65\u201370. IEEE (2018)","DOI":"10.1109\/iCCECOME.2018.8659266"},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB: a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"DH Wolpert","year":"1992","unstructured":"Wolpert, D.H.: Stacked generalization. Neural Netw. 5, 241\u2013259 (1992)","journal-title":"Neural Netw."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10994-010-5221-8","volume":"85","author":"HF Yu","year":"2011","unstructured":"Yu, H.F., Huang, F.L., Lin, C.J.: Dual coordinate descent methods for logistic regression and maximum entropy models. Mach. Learn. 85, 41\u201375 (2011)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T19:00:20Z","timestamp":1727895620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_10","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}