{"id":"https://openalex.org/W2614779231","doi":"https://doi.org/10.1007/978-3-319-59105-6_5","title":"Evolutionary Algorithm for the Time-Dependent Orienteering Problem","display_name":"Evolutionary Algorithm for the Time-Dependent Orienteering Problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2614779231","doi":"https://doi.org/10.1007/978-3-319-59105-6_5","mag":"2614779231"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-59105-6_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-59105-6_5","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":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01656243","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012639529","display_name":"K Ostrowski","orcid":"https://orcid.org/0000-0002-7120-396X"},"institutions":[{"id":"https://openalex.org/I1323121030","display_name":"Bialystok University of Technology","ror":"https://ror.org/02bzfsy61","country_code":"PL","type":"education","lineage":["https://openalex.org/I1323121030"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Ostrowski","raw_affiliation_strings":["Faculty of Computer Science, Bialystok University of Technology, Bialystok, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Bialystok University of Technology, Bialystok, Poland","institution_ids":["https://openalex.org/I1323121030"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012639529"],"corresponding_institution_ids":["https://openalex.org/I1323121030"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":2.118,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.88172293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"50","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9977999925613403,"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.9977999925613403,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9950000047683716,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/orienteering","display_name":"Orienteering","score":0.9419338703155518},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.816779613494873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4975793659687042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3352331221103668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11198922991752625}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.9419338703155518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.816779613494873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4975793659687042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3352331221103668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11198922991752625}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-59105-6_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-59105-6_5","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"},{"id":"pmh:oai:HAL:hal-01656243v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01656243","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.50-62, &#x27E8;10.1007/978-3-319-59105-6_5&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01656243v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01656243","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.50-62, &#x27E8;10.1007/978-3-319-59105-6_5&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W49093931","https://openalex.org/W153773207","https://openalex.org/W968900271","https://openalex.org/W1964959815","https://openalex.org/W1972096422","https://openalex.org/W1982511625","https://openalex.org/W1983566109","https://openalex.org/W1999883971","https://openalex.org/W2003281104","https://openalex.org/W2014979043","https://openalex.org/W2022067434","https://openalex.org/W2022487853","https://openalex.org/W2032999460","https://openalex.org/W2039097929","https://openalex.org/W2059762964","https://openalex.org/W2082212102","https://openalex.org/W2135475768","https://openalex.org/W2136051486","https://openalex.org/W2140596151","https://openalex.org/W2142295412","https://openalex.org/W2503238886","https://openalex.org/W2562010518","https://openalex.org/W2950680102","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4249387127","https://openalex.org/W327165017","https://openalex.org/W2356214734","https://openalex.org/W2394169628","https://openalex.org/W4254102998","https://openalex.org/W2381702286","https://openalex.org/W2014979043","https://openalex.org/W2392643114","https://openalex.org/W2358559116"],"abstract_inverted_index":{"The":[0,42,59],"Time-Dependent":[1],"Orienteering":[2,10],"Problem":[3,11],"(TDOP)":[4],"is":[5],"a":[6],"generalization":[7],"of":[8,40],"the":[9,38],"where":[12],"graph":[13],"weights":[14],"vary":[15],"with":[16,26,48],"time.":[17],"It":[18],"has":[19],"many":[20],"real":[21],"life":[22],"applications":[23],"particularly":[24],"associated":[25],"transport":[27],"networks,":[28],"in":[29,68],"which":[30,56],"travel":[31],"time":[32],"between":[33],"two":[34],"points":[35],"depends":[36],"on":[37,63],"moment":[39],"start.":[41],"paper":[43],"presents":[44],"an":[45],"evolutionary":[46],"algorithm":[47,60],"embedded":[49],"local":[50],"search":[51],"operators":[52],"and":[53,67],"heuristic":[54],"crossover,":[55],"solves":[57],"TDOP.":[58],"was":[61],"tested":[62],"TDOP":[64],"benchmark":[65],"instances":[66],"most":[69],"cases":[70],"achieved":[71],"optimal":[72,75],"or":[73],"near":[74],"results":[76],"clearly":[77],"outperforming":[78],"other":[79],"published":[80],"methods.":[81]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}
