{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:09:48Z","timestamp":1767319788959,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550142","type":"print"},{"value":"9789819550159","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-5015-9_27","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:06:14Z","timestamp":1767319574000},"page":"380-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DeepQUBO: Quantum-Optimized Route Planning for\u00a0Carpooling Service"],"prefix":"10.1007","author":[{"given":"Zifeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhuo","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TITS.2019.2891235","volume":"21","author":"T Stollenwerk","year":"2020","unstructured":"Stollenwerk, T., et al.: Quantum annealing applied to de-conflicting optimal trajectories for air traffic management. IEEE Trans. Intell. Transp. Syst. (ITSM) 21(1), 285\u2013297 (2020)","journal-title":"IEEE Trans. Intell. Transp. Syst. (ITSM)"},{"issue":"7","key":"27_CR2","doi-asserted-by":"publisher","first-page":"7564","DOI":"10.1109\/TITS.2022.3172241","volume":"24","author":"U Azad","year":"2023","unstructured":"Azad, U., Behera, B.K., Ahmed, E.A., Panigrahi, P.K., Farouk, A.: Solving vehicle routing problem using quantum approximate optimization algorithm. IEEE Trans. Intell. Transp. Syst. (ITSM) 24(7), 7564\u20137573 (2023)","journal-title":"IEEE Trans. Intell. Transp. Syst. (ITSM)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.11.020","volume":"619","author":"Y Ruan","year":"2023","unstructured":"Ruan, Y., Yuan, Z., Xue, X., Liu, Z.: Quantum approximate optimization for combinatorial problems with constraints. Inf. Sci. 619, 98\u2013125 (2023)","journal-title":"Inf. Sci."},{"issue":"2241","key":"27_CR4","doi-asserted-by":"publisher","first-page":"20210417","DOI":"10.1098\/rsta.2021.0417","volume":"381","author":"A Rajak","year":"2023","unstructured":"Rajak, A., Suzuki, S., Dutta, A., Chakrabarti, B.K.: Quantum annealing: an overview. Philos. Trans. R. Soc. A Math. Phys. Eng. Sci. 381(2241), 20210417 (2023)","journal-title":"Philos. Trans. R. Soc. A Math. Phys. Eng. Sci."},{"key":"27_CR5","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014). arXiv preprint arXiv:1411.4028"},{"key":"27_CR6","unstructured":"Pichugina, O., Tan, Y., Beck, C.: Deriving compact qubo models via multilevel constraint transformation (2024). arXiv preprint arXiv:2404.03610"},{"issue":"5","key":"27_CR7","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ab85b8","volume":"83","author":"P Hauke","year":"2020","unstructured":"Hauke, P., Katzgraber, H.G., Lechner, W., Nishimori, H., Oliver, W.D.: Perspectives of quantum annealing: methods and implementations. Rep. Prog. Phys. 83(5), 054401 (2020)","journal-title":"Rep. Prog. Phys."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Honjo, T., et al.: 100,000-spin coherent ising machine. Sci. Adv. 7(40), eabh0952 (2021)","DOI":"10.1126\/sciadv.abh0952"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-031-49611-0_27","volume-title":"Combinatorial Optimization and Applications (COCOA)","author":"J Zhang","year":"2024","unstructured":"Zhang, J., Huang, X., Liu, Z., Gao, X., Chen, G.: Multi-candidate carpooling routing problem and its approximation algorithms. In: Wu, W., Guo, J. (eds.) Combinatorial Optimization and Applications (COCOA), pp. 380\u2013391. Springer, Cham (2024)"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Gonz\u00e1lez, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997)","journal-title":"Oper. Res."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-030-50433-5_42","volume-title":"Computational Science \u2013 ICCS 2020","author":"M Borowski","year":"2020","unstructured":"Borowski, M., et al.: New hybrid quantum annealing algorithms for solving vehicle routing problem. In: Krzhizhanovskaya, V.V., et al. (eds.) ICCS 2020. LNCS, vol. 12142, pp. 546\u2013561. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50433-5_42"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-14082-3_9","volume-title":"Quantum Technology and Optimization Problems","author":"T Stollenwerk","year":"2019","unstructured":"Stollenwerk, T., Lobe, E., Jung, M.: Flight gate assignment with a quantum annealer. In: Feld, S., Linnhoff-Popien, C. (eds.) QTOP 2019. LNCS, vol. 11413, pp. 99\u2013110. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14082-3_9"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Goto, H., Tatsumura, K., Dixon, A.R.: Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems. Sci. Adv. 5(4), eaav2372 (2019)","DOI":"10.1126\/sciadv.aav2372"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Shikuri, Y.: Decomposed quadratization: efficient qubo formulation for learning Bayesian network. In: AAAI Conference on Artificial Intelligence (AAAI), vol.\u00a039, pp. 11345\u201311352 (2025)","DOI":"10.1609\/aaai.v39i11.33234"},{"issue":"6","key":"27_CR17","doi-asserted-by":"publisher","first-page":"2114","DOI":"10.1109\/TC.2025.3557965","volume":"74","author":"J Luo","year":"2025","unstructured":"Luo, J., Shu, Y., Ha, Y.: RSQC: recursive sparse qubo construction for quantum annealing machines. IEEE Trans. Comput. (TOC) 74(6), 2114\u20132128 (2025)","journal-title":"IEEE Trans. Comput. (TOC)"},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/TC.2021.3063618","volume":"71","author":"M Zaman","year":"2022","unstructured":"Zaman, M., Tanahashi, K., Tanaka, S.: Pyqubo: Python library for mapping combinatorial optimization problems to qubo form. IEEE Trans. Comput. (TOC) 71(4), 838\u2013850 (2022)","journal-title":"IEEE Trans. Comput. (TOC)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Pu, T., Chen, C., Zeng, L., Liu, S., Sun, R., Fan, C.: Solving combinatorial optimization problem over graph through qubo transformation and deep reinforcement learning. In: IEEE International Conference on Data Mining (ICDM), pp. 390\u2013399 (2024)","DOI":"10.1109\/ICDM59182.2024.00046"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: A 1.5-approximation for path tsp. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1539\u20131549 (2019)","DOI":"10.1137\/1.9781611975482.93"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., Fanarioti, S.: A qubo model for the traveling salesman problem with time windows. Algorithms 12(11) (2019)","DOI":"10.3390\/a12110224"}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5015-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:06:16Z","timestamp":1767319576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5015-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819550142","9789819550159"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5015-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icsoc2025.hit.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}