{"id":"https://openalex.org/W2398467532","doi":"https://doi.org/10.1007/978-3-319-27340-2_43","title":"Heuristic Approaches for the Probabilistic Traveling Salesman Problem","display_name":"Heuristic Approaches for the Probabilistic Traveling Salesman Problem","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2398467532","doi":"https://doi.org/10.1007/978-3-319-27340-2_43","mag":"2398467532"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-27340-2_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-27340-2_43","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5066585896","display_name":"Christoph Weiler","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Christoph Weiler","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, TU Wien, Favoritenstra\u00dfe 9-11/1861, 1040, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, TU Wien, Favoritenstra\u00dfe 9-11/1861, 1040, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023011844","display_name":"Benjamin Biesinger","orcid":"https://orcid.org/0000-0001-6276-8339"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Benjamin Biesinger","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, TU Wien, Favoritenstra\u00dfe 9-11/1861, 1040, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, TU Wien, Favoritenstra\u00dfe 9-11/1861, 1040, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050064900","display_name":"Bin Hu","orcid":"https://orcid.org/0000-0002-3184-8907"},"institutions":[{"id":"https://openalex.org/I132118926","display_name":"Austrian Institute of Technology","ror":"https://ror.org/04knbh022","country_code":"AT","type":"facility","lineage":["https://openalex.org/I132118926"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Bin Hu","raw_affiliation_strings":["Mobility Department - Dynamic Transportation Systems, AIT Austrian Institute of Technology, Giefinggasse 2, 1210, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Mobility Department - Dynamic Transportation Systems, AIT Austrian Institute of Technology, Giefinggasse 2, 1210, Vienna, Austria","institution_ids":["https://openalex.org/I132118926"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030647388","display_name":"G\u00fcnther R. Raidl","orcid":"https://orcid.org/0000-0002-3293-177X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G\u00fcnther R. Raidl","raw_affiliation_strings":["Institute of Computer Graphics and Algorithms, TU Wien, Favoritenstra\u00dfe 9-11/1861, 1040, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Graphics and Algorithms, TU Wien, Favoritenstra\u00dfe 9-11/1861, 1040, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5066585896"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.19229574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"342","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8774906396865845},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7136138677597046},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6982916593551636},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6495041251182556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.610303521156311},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49638134241104126},{"id":"https://openalex.org/keywords/nearest-neighbour-algorithm","display_name":"Nearest neighbour algorithm","score":0.48642611503601074},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.446468323469162},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.43713515996932983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42238667607307434},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.42072904109954834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2821216583251953},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2495076060295105},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.18767568469047546}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8774906396865845},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7136138677597046},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6982916593551636},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6495041251182556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.610303521156311},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49638134241104126},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.48642611503601074},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.446468323469162},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.43713515996932983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42238667607307434},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.42072904109954834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2821216583251953},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2495076060295105},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.18767568469047546},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-27340-2_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-27340-2_43","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8299999833106995,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1138715348","https://openalex.org/W1500165591","https://openalex.org/W1545121340","https://openalex.org/W1879570979","https://openalex.org/W1996908848","https://openalex.org/W1998707332","https://openalex.org/W2007147155","https://openalex.org/W2010334716","https://openalex.org/W2027954882","https://openalex.org/W2034027189","https://openalex.org/W2100605418","https://openalex.org/W2143466467","https://openalex.org/W2148127689","https://openalex.org/W2148386266","https://openalex.org/W2202867063","https://openalex.org/W2244527890"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W2963876309","https://openalex.org/W1967341325","https://openalex.org/W2624732115","https://openalex.org/W4300949310","https://openalex.org/W2554237698","https://openalex.org/W4311068855","https://openalex.org/W87675801","https://openalex.org/W2901016982","https://openalex.org/W2189435634"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}