{"id":"https://openalex.org/W1696102839","doi":"https://doi.org/10.3233/fi-2014-1132","title":"Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows","display_name":"Genetic Algorithm with Path Relinking for the Orienteering Problem with Time Windows","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1696102839","doi":"https://doi.org/10.3233/fi-2014-1132","mag":"1696102839"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2014-1132","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2014-1132","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","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/A5056244149","display_name":"Joanna Karbowska-Chili\u0144ska","orcid":"https://orcid.org/0000-0001-5241-7930"},"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":"Joanna Karbowska-Chilinska","raw_affiliation_strings":["Faculty of Computer Science, Bialystok University of Technology, Poland. j.karbowska@pb.edu.pl; p.zabielski@pb.edu.pl"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Bialystok University of Technology, Poland. j.karbowska@pb.edu.pl; p.zabielski@pb.edu.pl","institution_ids":["https://openalex.org/I1323121030"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060820633","display_name":"Pawe\u0142 Zabielski","orcid":"https://orcid.org/0000-0002-0126-1849"},"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":false,"raw_author_name":"Pawel Zabielski","raw_affiliation_strings":["Faculty of Computer Science, Bialystok University of Technology, Poland. j.karbowska@pb.edu.pl; p.zabielski@pb.edu.pl"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Bialystok University of Technology, Poland. j.karbowska@pb.edu.pl; p.zabielski@pb.edu.pl","institution_ids":["https://openalex.org/I1323121030"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056244149"],"corresponding_institution_ids":["https://openalex.org/I1323121030"],"apc_list":null,"apc_paid":null,"fwci":4.3104,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.93278227,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"135","issue":"4","first_page":"419","last_page":"431"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9965000152587891,"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.9958000183105469,"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.975849986076355},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5901076197624207},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.589641809463501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5209683179855347},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44730493426322937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43224453926086426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4011678695678711},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08117738366127014}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.975849986076355},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5901076197624207},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.589641809463501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5209683179855347},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44730493426322937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43224453926086426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4011678695678711},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08117738366127014}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2014-1132","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2014-1132","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320323075","display_name":"Politechnika Bialostocka","ror":"https://ror.org/02bzfsy61"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1033426349","https://openalex.org/W1853592262","https://openalex.org/W1968989933","https://openalex.org/W1973751736","https://openalex.org/W1975828823","https://openalex.org/W1982511625","https://openalex.org/W1983566109","https://openalex.org/W1991744719","https://openalex.org/W2002420134","https://openalex.org/W2013321210","https://openalex.org/W2014979043","https://openalex.org/W2058995871","https://openalex.org/W2075600171","https://openalex.org/W2082675302","https://openalex.org/W2095703590","https://openalex.org/W2096305430","https://openalex.org/W2113873983","https://openalex.org/W2125281003","https://openalex.org/W2135475768","https://openalex.org/W2139148132","https://openalex.org/W2149285341","https://openalex.org/W2159248543","https://openalex.org/W2162264733","https://openalex.org/W2277204117","https://openalex.org/W2399535981","https://openalex.org/W2610768354"],"related_works":["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","https://openalex.org/W2958634208"],"abstract_inverted_index":{"The":[0],"Orienteering":[1],"Problem":[2],"with":[3],"Time":[4],"Windows":[5],"(OPTW)":[6],"is":[7],"an":[8],"optimisation":[9],"NP-hard":[10],"problem.":[11],"This":[12],"paper":[13],"proposes":[14],"a":[15,22,29,33,39,46],"hybrid":[16],"genetic":[17],"algorithm":[18],"(GAPR)":[19],"for":[20,93],"approximating":[21],"solution":[23,48,61],"to":[24],"the":[25,65,76],"OPTW.":[26],"Instead":[27],"of":[28,41],"crossover":[30],"we":[31],"use":[32],"path":[34],"relinking":[35],"(PR)":[36],"strategy":[37],"as":[38],"form":[40],"intensification":[42],"solution.":[43],"PR":[44],"generates":[45],"new":[47,90],"by":[49],"exploring":[50],"trajectories":[51],"between":[52],"two":[53],"random":[54],"solutions:":[55],"genes":[56],"not":[57],"present":[58],"in":[59,64],"one":[60],"are":[62],"included":[63],"other":[66],"one.":[67],"Experiments":[68],"performed":[69],"on":[70],"popular":[71],"benchmark":[72],"instances":[73],"show":[74],"that":[75],"proposed":[77],"GAPR":[78,88],"gives":[79,89],"good":[80],"quality":[81],"solutions":[82,92],"using":[83],"short":[84],"computing":[85],"times.":[86],"Moreover,":[87],"best":[91],"some":[94],"test":[95],"instances.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}