{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:26Z","timestamp":1742913026084,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031237409"},{"type":"electronic","value":"9783031237416"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-23741-6_1","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:29:01Z","timestamp":1672532941000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Shortest Path Searching Method Based on A* and Simulated Annealing"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Cui","sequence":"first","affiliation":[]},{"given":"Sihua","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Burns, E., Lemons, S., Ruml, W., Zhou, R.: Best-first heuristic search for multi-core machines. In: International Joint Conference on Artificial Intelligence (IJCAI) (2009)","DOI":"10.1609\/icaps.v19i1.13375"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume":"5515","author":"D Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. Lect. Notes Comput. Sci. 5515, 117\u2013139 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"11","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1109\/TCYB.2014.2371918","volume":"45","author":"J Li","year":"2015","unstructured":"Li, J., Zhou, M., Sun, Q., Dai, X., Yu, X.: Colored traveling salesman problem. IEEE Trans. Cybern. 45(11), 2390\u20132401 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"4598","key":"1_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"10","key":"1_CR6","first-page":"849","volume":"4","author":"F Lu","year":"1999","unstructured":"Lu, F., Lu, D., Cui, W.: Time shortest path algorithm for restricted searching area in transportation networks. J. Image Graph. 4(10), 849\u2013953 (1999). (in Chinese)","journal-title":"J. Image Graph."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1613\/jair.4171","volume":"50","author":"G Meir","year":"2014","unstructured":"Meir, G., et al.: Enhanced partial expansion A*. J. Artif. Intell. Res. 50, 141\u2013187 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1109\/TIA.2016.2517067","volume":"52","author":"J Mitra","year":"2016","unstructured":"Mitra, J., Vallem, M.R., Singh, C.: Optimal deployment of distributed generation using a reliability criterion. IEEE Trans. Ind. Appl. 52, 1989\u20131997 (2016)","journal-title":"IEEE Trans. Ind. Appl."},{"key":"1_CR9","unstructured":"Roni, S., Lelis, L.H.S.: What\u2019s hot in heuristic search. In: Proceedings of the Thirty AAAI Conference on Artificial Intelligence (2016)"},{"issue":"4","key":"1_CR10","first-page":"1","volume":"33","author":"H Toshiya","year":"2014","unstructured":"Toshiya, H., Anton, K., Carsten, D.: Multiplexed metropolis light transport. ACM Trans. Graph. 33(4), 1\u201310 (2014)","journal-title":"ACM Trans. Graph."}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23741-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:34:57Z","timestamp":1672533297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23741-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031237409","9783031237416"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23741-6_1","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":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Human Centered Computing","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":"9 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.scholat.com\/hcc\/2021","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":"68","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":"18","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":"9","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.5","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.4","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)"}}]}}