{"id":"https://openalex.org/W2001868482","doi":"https://doi.org/10.4018/ijncr.2014100103","title":"A Genetic Algorithms Approach for Inverse Shortest Path Length Problems","display_name":"A Genetic Algorithms Approach for Inverse Shortest Path Length Problems","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2001868482","doi":"https://doi.org/10.4018/ijncr.2014100103","mag":"2001868482"},"language":"en","primary_location":{"id":"doi:10.4018/ijncr.2014100103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijncr.2014100103","pdf_url":null,"source":{"id":"https://openalex.org/S1001844925","display_name":"International Journal of Natural Computing Research","issn_l":"1947-928X","issn":["1947-928X","1947-9298"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Natural Computing Research","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/A5049844770","display_name":"Ant\u00f3nio Leit\u00e3o","orcid":"https://orcid.org/0000-0002-4844-1169"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Ant\u00f3nio Leit\u00e3o","raw_affiliation_strings":["CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075552258","display_name":"Adriano Vinhas","orcid":"https://orcid.org/0009-0006-9161-472X"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Adriano Vinhas","raw_affiliation_strings":["CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035863026","display_name":"Penousal Machado","orcid":"https://orcid.org/0000-0002-6308-6484"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Penousal Machado","raw_affiliation_strings":["CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":null,"display_name":"Francisco C\u00e2mara Pereira","orcid":null},"institutions":[{"id":"https://openalex.org/I4210167254","display_name":"Singapore-MIT Alliance for Research and Technology","ror":"https://ror.org/05yb3w112","country_code":"SG","type":"education","lineage":["https://openalex.org/I4210167254"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Francisco C\u00e2mara Pereira","raw_affiliation_strings":["Department of Informatics Engineering, University of Coimbra & Singapore-MIT Alliance for Research and Technology, Singapore, Singapore","Department of Informatics Engineering, University of Coimbra & Singapore-MIT Alliance for Research and Technology, Singapore, Singapore#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics Engineering, University of Coimbra & Singapore-MIT Alliance for Research and Technology, Singapore, Singapore","institution_ids":["https://openalex.org/I4210167254"]},{"raw_affiliation_string":"Department of Informatics Engineering, University of Coimbra & Singapore-MIT Alliance for Research and Technology, Singapore, Singapore#TAB#","institution_ids":["https://openalex.org/I4210167254"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2896,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53602053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"4","first_page":"36","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9984999895095825,"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/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8320487141609192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7351422309875488},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5306360125541687},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.5298858880996704},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5217231512069702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4815090596675873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4693112373352051},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46050235629081726},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4480232000350952},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.43735644221305847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4245131015777588},{"id":"https://openalex.org/keywords/inverse-problem","display_name":"Inverse problem","score":0.4208950102329254},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2563050091266632},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2330220341682434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22556069493293762}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8320487141609192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7351422309875488},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5306360125541687},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.5298858880996704},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5217231512069702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4815090596675873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4693112373352051},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46050235629081726},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4480232000350952},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.43735644221305847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4245131015777588},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.4208950102329254},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2563050091266632},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2330220341682434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22556069493293762},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijncr.2014100103","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijncr.2014100103","pdf_url":null,"source":{"id":"https://openalex.org/S1001844925","display_name":"International Journal of Natural Computing Research","issn_l":"1947-928X","issn":["1947-928X","1947-9298"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Natural Computing Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jncr00:v:4:y:2014:i:4:p:36-54","is_oa":false,"landing_page_url":"http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijncr.2014100103","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W10297790","https://openalex.org/W1507183619","https://openalex.org/W1537982455","https://openalex.org/W1567268701","https://openalex.org/W1594902172","https://openalex.org/W1606565993","https://openalex.org/W1809557030","https://openalex.org/W1966229055","https://openalex.org/W1979134936","https://openalex.org/W1984313645","https://openalex.org/W1986946117","https://openalex.org/W2007572995","https://openalex.org/W2007619042","https://openalex.org/W2014561394","https://openalex.org/W2019571312","https://openalex.org/W2022980325","https://openalex.org/W2038990139","https://openalex.org/W2042349733","https://openalex.org/W2056975114","https://openalex.org/W2072630120","https://openalex.org/W2083358979","https://openalex.org/W2119312244","https://openalex.org/W2132022337","https://openalex.org/W2137212783","https://openalex.org/W2143676338","https://openalex.org/W2159307101","https://openalex.org/W2169528473","https://openalex.org/W2171588996","https://openalex.org/W2227557434","https://openalex.org/W2290850377","https://openalex.org/W2493479721","https://openalex.org/W2911796152","https://openalex.org/W3138807513","https://openalex.org/W4242091010","https://openalex.org/W6723097822"],"related_works":["https://openalex.org/W3118505512","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W4317939968","https://openalex.org/W2359578922","https://openalex.org/W2996337372","https://openalex.org/W2018146256","https://openalex.org/W2376911392","https://openalex.org/W2331917905","https://openalex.org/W3155039083"],"abstract_inverted_index":{"Inverse":[0,17,132],"Combinatorial":[1],"Optimization":[2],"has":[3,46],"become":[4],"a":[5,47,87,127],"relevant":[6,23],"research":[7],"subject":[8],"over":[9],"the":[10,16,30,34,44],"past":[11],"decades.":[12],"In":[13],"graph":[14,108],"theory,":[15],"Shortest":[18,133],"Path":[19,134],"Length":[20],"problem":[21],"becomes":[22],"when":[24],"people":[25],"don't":[26],"have":[27,61,75],"access":[28],"to":[29,38,64,101,106,130],"real":[31],"cost":[32],"of":[33],"arcs":[35],"and":[36,72,92,97,110,114],"want":[37],"infer":[39],"their":[40],"value":[41],"so":[42],"that":[43,122],"system":[45],"specific":[48],"outcome,":[49],"such":[50],"as":[51],"one":[52],"or":[53],"more":[54],"shortest":[55],"paths":[56],"between":[57],"nodes.":[58],"Several":[59],"approaches":[60],"been":[62,76],"proposed":[63],"tackle":[65,131],"this":[66],"problem,":[67],"relying":[68,85],"on":[69,86],"different":[70,107],"methods,":[71],"several":[73],"applications":[74],"suggested.":[77],"This":[78],"study":[79],"explores":[80],"an":[81],"innovative":[82],"evolutionary":[83,123],"approach":[84],"genetic":[88],"algorithm.":[89],"Two":[90],"scenarios":[91],"corresponding":[93],"representations":[94],"are":[95,99,116],"presented":[96],"experiments":[98],"conducted":[100],"test":[102],"how":[103],"they":[104],"react":[105],"characteristics":[109],"parameters.":[111],"Their":[112],"behaviour":[113],"differences":[115],"thoroughly":[117],"discussed.":[118],"The":[119],"outcome":[120],"supports":[121],"algorithms":[124],"may":[125],"be":[126],"viable":[128],"venue":[129],"problems.":[135]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}