{"id":"https://openalex.org/W122188082","doi":"https://doi.org/10.1007/978-3-642-16336-4_30","title":"The Optimization of Route Design for Grouping Search","display_name":"The Optimization of Route Design for Grouping Search","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W122188082","doi":"https://doi.org/10.1007/978-3-642-16336-4_30","mag":"122188082"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16336-4_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16336-4_30","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047125486","display_name":"Xiujun Wu","orcid":"https://orcid.org/0000-0002-3945-2915"},"institutions":[{"id":"https://openalex.org/I31590910","display_name":"Jianghan University","ror":"https://ror.org/041c9x778","country_code":"CN","type":"education","lineage":["https://openalex.org/I31590910"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiujun Wu","raw_affiliation_strings":["School of Mathematics & Computer Science, Jianghan University, Wuhan, 430056, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics & Computer Science, Jianghan University, Wuhan, 430056, China","institution_ids":["https://openalex.org/I31590910"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047125486"],"corresponding_institution_ids":["https://openalex.org/I31590910"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"226","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/midpoint","display_name":"Midpoint","score":0.6501002907752991},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6022046208381653},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5529244542121887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5232143402099609},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.49630433320999146},{"id":"https://openalex.org/keywords/start-point","display_name":"Start point","score":0.4840254485607147},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47722533345222473},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.47176364064216614},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.4569755494594574},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4547123908996582},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.450917512178421},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42172345519065857},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4165099263191223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3986867070198059},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37087780237197876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21040406823158264}],"concepts":[{"id":"https://openalex.org/C34130140","wikidata":"https://www.wikidata.org/wiki/Q1645406","display_name":"Midpoint","level":2,"score":0.6501002907752991},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6022046208381653},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5529244542121887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5232143402099609},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.49630433320999146},{"id":"https://openalex.org/C2779859299","wikidata":"https://www.wikidata.org/wiki/Q7602527","display_name":"Start point","level":3,"score":0.4840254485607147},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47722533345222473},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.47176364064216614},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.4569755494594574},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4547123908996582},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.450917512178421},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42172345519065857},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4165099263191223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3986867070198059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37087780237197876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21040406823158264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-16336-4_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16336-4_30","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1997266867","https://openalex.org/W2028769163","https://openalex.org/W2072879089","https://openalex.org/W2074682596","https://openalex.org/W2098803581","https://openalex.org/W2364584538","https://openalex.org/W2371578059","https://openalex.org/W2371756640","https://openalex.org/W2376686063","https://openalex.org/W2482935363","https://openalex.org/W4234302886"],"related_works":["https://openalex.org/W2358427436","https://openalex.org/W2808808802","https://openalex.org/W2064794194","https://openalex.org/W1994919150","https://openalex.org/W4200104947","https://openalex.org/W4386269615","https://openalex.org/W2164899989","https://openalex.org/W4390091683","https://openalex.org/W2397806795","https://openalex.org/W205563547"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}