{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:40:11Z","timestamp":1743622811141,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819642069","type":"print"},{"value":"9789819642076","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-4207-6_44","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:10:08Z","timestamp":1743621008000},"page":"491-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Acceleration of\u00a0Transportation Problem Solving Using SpMV in\u00a0the\u00a0Industrial Chain Context"],"prefix":"10.1007","author":[{"given":"De","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanyu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruikang","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenliang","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuchong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"44_CR1","unstructured":"US Zip Codes Database | Simplemaps.com. https:\/\/simplemaps.com\/data\/us-zips"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Aminabadi, R.Y., et al.: DeepSpeed- inference: enabling efficient inference of transformer models at unprecedented scale. In: SC22: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201315 (2022)","DOI":"10.1109\/SC41404.2022.00051"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Bieling, J., Peschlow, P., Martini, P.: An efficient gpu implementation of the revised simplex method. In: 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp.\u00a01\u20138. IEEE (2010)","DOI":"10.1109\/IPDPSW.2010.5470831"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Boyer, V., El\u00a0Baz, D., Salazar-Aguilar, M.: Gpu computing applied to linear and mixed integer programming, chapter 10 in advances in gpu, research and practice, h. sarbazi-azad editor (2017)","DOI":"10.1016\/B978-0-12-803738-6.00010-0"},{"issue":"6","key":"44_CR5","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1080\/10556788.2016.1260568","volume":"32","author":"H Bulut","year":"2017","unstructured":"Bulut, H.: Multiloop transportation simplex algorithm. Optim. Methods Softw. 32(6), 1206\u20131217 (2017)","journal-title":"Optim. Methods Softw."},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Burchard, L., Cai, X., Langguth, J.: iPUG for multiple graphcore ipus: optimizing performance and scalability of parallel breadth-first search. In: 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC), pp. 162\u2013171 (2021)","DOI":"10.1109\/HiPC53243.2021.00030"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Gass, S.I.: On solving the transportation problem. J. Oper. Res. Soc. (1990)","DOI":"10.1038\/sj\/jors\/0410402"},{"issue":"5","key":"44_CR8","doi-asserted-by":"crossref","first-page":"804","DOI":"10.26599\/TST.2021.9010054","volume":"27","author":"Q Hua","year":"2022","unstructured":"Hua, Q., Chen, L., Li, P., Zhao, S., Li, Y.: A pixel-channel hybrid attention model for image processing. Tsinghua Sci. Technol. 27(5), 804\u2013816 (2022)","journal-title":"Tsinghua Sci. Technol."},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Ji, Y., Liu, H., Hu, Y., Huang, H.H.: iSpan: parallel identification of strongly connected components with spanning trees. ACM Trans. Parallel Comput. 9(3), 13:1\u201313:27 (2022)","DOI":"10.1145\/3543542"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.asoc.2015.05.009","volume":"34","author":"ZAMS Juman","year":"2015","unstructured":"Juman, Z.A.M.S., Hoque, M.A.: An efficient heuristic to obtain a better initial feasible solution to the transportation problem. Appl. Soft Comput. 34, 813\u2013826 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"44_CR11","first-page":"370","volume":"16","author":"S Koruko\u011flu","year":"2011","unstructured":"Koruko\u011flu, S., Ball\u0131, S.: An improved vogel\u2019s approximation method for the transportation problem. Math. Comput. Appl. 16(2), 370\u2013381 (2011)","journal-title":"Math. Comput. Appl."},{"key":"44_CR12","doi-asserted-by":"publisher","unstructured":"Li, J., Lv, R., Hu, X., Jiang, Z.: A gpu-based parallel algorithm for large scale linear programming problem. In: Intelligent Decision Technologies: Proceedings of the 3rd International Conference on Intelligent Decision Technologies (IDT\u20192011), pp. 37\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22194-1_4","DOI":"10.1007\/978-3-642-22194-1_4"},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.neucom.2019.11.066","volume":"382","author":"J Lin","year":"2020","unstructured":"Lin, J., Feng, S., Zhang, Y., Yang, Z., Zhang, Y.: A novel deep neural network based approach for sparse code multiple access. Neurocomputing 382, 52\u201363 (2020)","journal-title":"Neurocomputing"},{"issue":"4","key":"44_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5121\/ijite.2024.13401","volume":"13","author":"T Liu","year":"2024","unstructured":"Liu, T., Yang, X., Zhou, H., Zhao, Z.: A survey of collaborative filtering recommender algorithms based on graph neural networks. J. Integrat. Technol. 13(4), 1\u201315 (2024)","journal-title":"J. Integrat. Technol."},{"key":"44_CR15","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2023.104790","volume":"184","author":"M Mahajan","year":"2024","unstructured":"Mahajan, M., Nagi, R.: Gpu-accelerated transportation simplex algorithm. J. Parallel Distrib. Comput. 184, 104790 (2024)","journal-title":"J. Parallel Distrib. Comput."},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Mishra, D.S.: Solving transportation problem by various methods and their comparison. Int. J. Math. Trends Technol. IJMTT 44 (2017)","DOI":"10.14445\/22315373\/IJMTT-V44P538"},{"key":"44_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jss.2014.04.047","volume":"96","author":"N Ploskas","year":"2014","unstructured":"Ploskas, N., Samaras, N.: Gpu accelerated pivoting rules for the simplex algorithm. J. Syst. Softw. 96, 1\u20139 (2014)","journal-title":"J. Syst. Softw."},{"issue":"5","key":"44_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.9790\/5728-0453942","volume":"4","author":"S Aramuthakannan","year":"2013","unstructured":"Aramuthakannan, S., Kandasamy, P.: Revised distribution method of finding optimal solution for transportation problems. IOSR J. Math. 4(5), 39\u201342 (2013)","journal-title":"IOSR J. Math."},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Shah, U.A., Yousaf, S.: Performance analysis of benchmarks for gpu-based linear programming problem solvers. In: 2019 2nd International Conference on Communication, Computing and Digital Systems (C-CODE), pp. 132\u2013136. IEEE (2019)","DOI":"10.1109\/C-CODE.2019.8680981"},{"issue":"2","key":"44_CR20","first-page":"1","volume":"6","author":"MS Uddin","year":"2016","unstructured":"Uddin, M.S., Khan, A.R., Kibria, C.G., Raeva, I.: Improved least cost method to obtain a better ibfs to the transportation problem. J. Appl. Math. Bioinf. 6(2), 1 (2016)","journal-title":"J. Appl. Math. Bioinf."},{"issue":"5","key":"44_CR21","doi-asserted-by":"crossref","first-page":"916","DOI":"10.26599\/TST.2022.9010052","volume":"28","author":"W Yu","year":"2023","unstructured":"Yu, W., Liao, Y., Yang, Y.: Exact and approximation algorithms for the multi-depot capacitated arc routing problems. Tsinghua Sci. Technol. 28(5), 916\u2013928 (2023)","journal-title":"Tsinghua Sci. Technol."},{"key":"44_CR22","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ins.2018.07.064","volume":"466","author":"Z Zhao","year":"2018","unstructured":"Zhao, Z., Liu, W., Qian, Y., Nie, L., Yin, Y., Zhang, Y.: Identifying advisor-advisee relationships from co-author networks via a novel deep model. Inf. Sci. 466, 258\u2013269 (2018)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4207-6_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:10:58Z","timestamp":1743621058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4207-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819642069","9789819642076"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4207-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpcc.siat.ac.cn\/meeting\/pdcat2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}