{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:44Z","timestamp":1742914304912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505515"},{"type":"electronic","value":"9783031505522"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50552-2_5","type":"book-chapter","created":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T19:02:05Z","timestamp":1711220525000},"page":"67-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Scheduling Algorithm of Logistics Distribution Vehicles Based on Internet of Vehicles Platform"],"prefix":"10.1007","author":[{"given":"Zhuorong","family":"Li","sequence":"first","affiliation":[]},{"given":"Yongchang","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Haibo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Nan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianmei","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,24]]},"reference":[{"issue":"11","key":"5_CR1","first-page":"6","volume":"39","author":"Y Zhao","year":"2022","unstructured":"Zhao, Y., Chen, Z.H.: Shortest path optimization of reverse logistics vehicle based on local search. Comput. Simul. 39(11), 6 (2022)","journal-title":"Comput. Simul."},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1504\/IJMTM.2021.118805","volume":"35","author":"X Xu","year":"2021","unstructured":"Xu, X., Liu, L.: Research on distributed logistics scheduling method for workshop production based on hybrid particle swarm optimisation. Int. J. Manuf. Technol. Manage. 35(3), 234 (2021)","journal-title":"Int. J. Manuf. Technol. Manage."},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"04020047","DOI":"10.1061\/AJRUA6.0001096","volume":"7","author":"CA Pennetti","year":"2021","unstructured":"Pennetti, C.A., Jun, J., Jones, G.S., et al.: Temporal disaggregation of performance measures to manage uncertainty in transportation logistics and scheduling. ASCE-ASME J. Risk Uncertainty Eng. Syst. Part A Civ. Eng. 7(1), 04020047 (2021)","journal-title":"ASCE-ASME J. Risk Uncertainty Eng. Syst. Part A Civ. Eng."},{"issue":"2","key":"5_CR4","first-page":"10","volume":"3","author":"Z Ding","year":"2022","unstructured":"Ding, Z., Xu, X., Jiang, S., et al.: Emergency logistics scheduling with multiple supply-demand points based on grey interval. J. Saf. Sci. Resilience 3(2), 10 (2022)","journal-title":"J. Saf. Sci. Resilience"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liu, J.: Emergency logistics scheduling under uncertain transportation time using online optimization methods. IEEE Access PP(99), 1 (2021)","DOI":"10.1109\/ACCESS.2021.3061454"},{"issue":"4","key":"5_CR6","first-page":"8","volume":"2","author":"Z Ding","year":"2021","unstructured":"Ding, Z., Zhao, Z., Liu, D., et al.: Multi-objective scheduling of relief logistics based on swarm intelligence algorithms and spatio-temporal traffic flow. J. Saf. Sci. Resilience 2(4), 8 (2021)","journal-title":"J. Saf. Sci. Resilience"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1983\/1\/012109","volume":"1983","author":"J Lei","year":"2021","unstructured":"Lei, J., Hui, J., Ding, K., et al.: A framework for planning and scheduling shop floor logistics via cloud-edge collaboration. J. Phys. Conf. Ser. 1983(1), 012109 (2021)","journal-title":"J. Phys. Conf. Ser."},{"issue":"16","key":"5_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.4018\/IJWLTT.2021030104","volume":"2021","author":"ME Midaoui","year":"2021","unstructured":"Midaoui, M.E., Qbadou, M., Mansouri, K.: Logistics chain optimization and scheduling of hospital pharmacy drugs using genetic algorithms: morocco case. Int. J. Web Based Learn. Teach. Technol. 2021(16), 54 (2021)","journal-title":"Int. J. Web Based Learn. Teach. Technol."},{"issue":"4","key":"5_CR9","first-page":"41","volume":"2021","author":"T Chen","year":"2021","unstructured":"Chen, T.: Decision-making support for transportation and logistics combining rough set fuzzy logic algorithm. J. Intell. Fuzzy Syst. Appl. Eng. Technol. 2021(4), 41 (2021)","journal-title":"J. Intell. Fuzzy Syst. Appl. Eng. Technol."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Wang, S.: Artificial intelligence applications in the new model of logistics development based on wireless communication technology. Scientific Programming 2021(Pt.9), 2021 (2021)","DOI":"10.1155\/2021\/5166993"},{"issue":"6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.patrec.2020.12.011","volume":"143","author":"Q Zhang","year":"2021","unstructured":"Zhang, Q., Wang, T., Huang, K., et al.: Efficient dispatching system of railway vehicles based on internet of things technology. Pattern Recogn. Lett. 143(6), 14\u201318 (2021)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TTE.2020.3020690","volume":"7","author":"SSK Madahi","year":"2021","unstructured":"Madahi, S.S.K., Nafisi, H., Abyaneh, H.A., et al.: Co-optimization of energy losses and transformer operating costs based on smart charging algorithm for plug-in electric vehicle parking lots. IEEE Trans. Transp. Electrification 7(2), 527\u2013541 (2021)","journal-title":"IEEE Trans. Transp. Electrification"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"101604","DOI":"10.1016\/j.aei.2022.101604","volume":"52","author":"C Li","year":"2022","unstructured":"Li, C., Zhang, L., Zhang, L.: A route and speed optimization model to find conflict-free routes for automated guided vehicles in large warehouses based on quick response code technology. Adv. Eng. Inform. 52, 101604\u2013101691 (2022)","journal-title":"Adv. Eng. Inform."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1108\/IJWIS-11-2020-0071","volume":"17","author":"RMT Masadeh","year":"2021","unstructured":"Masadeh, R.M.T., Alsharman, N., Sharieh, A.A., et al.: Task scheduling on cloud computing based on sea lion optimization algorithm. Int. J. Web Inf. Syst. 17(2), 99\u2013116 (2021)","journal-title":"Int. J. Web Inf. Syst."},{"issue":"15","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1080\/08839514.2021.1975392","volume":"35","author":"M Basu","year":"2021","unstructured":"Basu, M., Basu, S.: Horse herd optimization algorithm for fuel constrained day-ahead scheduling of isolated nanogrid. Appl. Artif. Intell. 35(15), 1250\u20131270 (2021)","journal-title":"Appl. Artif. Intell."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Advanced Hybrid Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50552-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T19:02:34Z","timestamp":1711220554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50552-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505515","9783031505522"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50552-2_5","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"24 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADHIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Hybrid Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Harbin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adhip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adhip.eai-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy plus","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"270","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":"109","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":"0","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":"40% - 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":"3","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":"3","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)"}}]}}