{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:47:08Z","timestamp":1743137228892,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157905"},{"type":"electronic","value":"9783031157912"}],"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-15791-2_14","type":"book-chapter","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T07:34:06Z","timestamp":1663313646000},"page":"160-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving the\u00a0Traveling Salesperson Problem with\u00a0Precedence Constraints by\u00a0Deep Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Christian","family":"L\u00f6wens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inaam","family":"Ashraf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Gembus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Genesis","family":"Cuizon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas K.","family":"Falkner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Schmidt-Thieme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,12]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., J\u00fcnger, M., Reinelt, G.: A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17(1), 61\u201384 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bdeir, A., Boeder, S, Dernedde, T., Tkachuk, K., Falkner, J. K., Schmidt-Thieme, L. RP-DQN: an application of q-learning to vehicle routing problems. KI 2021, 3\u201316 (2021)","DOI":"10.1007\/978-3-030-87626-5_1"},{"key":"14_CR3","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: ICLR Workshop (2017)"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10107-008-0234-9","volume":"121","author":"I Dumitrescu","year":"2010","unstructured":"Dumitrescu, I., Ropke, S., Cordeau, J.-F., Laporte, G.: The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2), 269\u2013305 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"LF Escudero","year":"1988","unstructured":"Escudero, L.F.: An inexact algorithm for the sequential ordering problem. Eur. J. Oper. Res. 37(2), 236\u2013249 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR6","unstructured":"Falkner, J. K., Schmidt-Thieme, L. Learning to solve vehicle routing problems with time windows through joint attention. CoRR abs\/2006.09100 (2020)"},{"key":"14_CR7","unstructured":"Google Inc. OR-Tools (2016)"},{"key":"14_CR8","unstructured":"Helsgaun, K. An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University, pp. 24\u201350 (2017)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Jamal, J., Shobaki, G., Papapanagiotou, V., Gambardella, L.M., Montemanni, R.: Solving the sequential ordering problem using branch and bound. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20139 (2017)","DOI":"10.1109\/SSCI.2017.8280805"},{"key":"14_CR10","unstructured":"Karan, M., Skorin-Kapov, N.: A branch and bound algorithm for the sequential ordering problem. In: 2011 Proceedings of the 34th International Convention MIPRO, pp. 452\u2013457. IEEE (2011)"},{"key":"14_CR11","unstructured":"Kool, W., Hoof, H., Welling, M.: Attention, learn to solve routing problems!. In: International Conference On Learning Representations (2019). https:\/\/openreview.net\/forum?id=ByxBFsRqYm"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"2306","DOI":"10.1109\/TITS.2021.3056120","volume":"23","author":"J Li","year":"2022","unstructured":"Li, J., Xin, L., Cao, Z., Lim, A., Song, W., Zhang, J.: Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning. IEEE Trans. Intell. Transp. Syst. 23(3), 2306\u20132315 (2022)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"14_CR13","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (2020)"},{"key":"14_CR14","unstructured":"Ma, Q., Ge, S., He, D., Thaker, D., Drori, I.: Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning (2019)"},{"issue":"1","key":"14_CR15","first-page":"266","volume":"4","author":"M Mojana","year":"2012","unstructured":"Mojana, M., Montemanni, R., Di Caro, G., Gambardella, L.M., Luangpaiboon, P.: A branch and bound approach for the sequential ordering problem. Lecture Notes Manag. Sci. 4(1), 266\u2013273 (2012)","journal-title":"Lecture Notes Manag. Sci."},{"key":"14_CR16","unstructured":"Thyssens, D., Falkner, J. K., Schmidt-Thieme, L.: Supervised permutation invariant networks for solving the CVRP with bounded fleet size. CoRR. abs\/2201.01529 (2022)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10589-015-9725-9","volume":"61","author":"G Shobaki","year":"2015","unstructured":"Shobaki, G., Jamal, J.: An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers. Comput. Optim. Appl. 61(2), 343\u2013372 (2015). https:\/\/doi.org\/10.1007\/s10589-015-9725-9","journal-title":"Comput. Optim. Appl."},{"key":"14_CR18","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Guyon, I., Luxburg, U. V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R., (eds.), Advances in Neural Information Processing Systems, vol. 30, pp. 5998\u20136008 (2017)"},{"key":"14_CR19","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R., (eds.), Advances in Neural Information Processing Systems, vol. 28, pp. 2692\u20132700 (2015)"},{"issue":"3\u20134","key":"14_CR20","first-page":"229","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8(3\u20134), 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"issue":"13","key":"14_CR21","first-page":"12042","volume":"35","author":"L Xin","year":"2021","unstructured":"Xin, L., Song, W., Cao, Z., Zhang, J.: Multi-decoder attention model with embedding glimpse for solving vehicle routing problems. Proc. AAAI Conf. Artif. Intell. 35(13), 12042\u201312049 (2021)","journal-title":"Proc. AAAI Conf. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","KI 2022: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15791-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T07:36:04Z","timestamp":1663313764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15791-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157905","9783031157912"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15791-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2022.gi.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 the conference was held virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}