{"id":"https://openalex.org/W2138563220","doi":"https://doi.org/10.1109/icsmc.2010.5641920","title":"A study of genetic algorithms for approximating the longest path in generic graphs","display_name":"A study of genetic algorithms for approximating the longest path in generic graphs","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2138563220","doi":"https://doi.org/10.1109/icsmc.2010.5641920","mag":"2138563220"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2010.5641920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5641920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"},"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/A5046722511","display_name":"David Portugal","orcid":"https://orcid.org/0000-0002-1447-0439"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]},{"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":"David Portugal","raw_affiliation_strings":["Instituto de Sistemas e Robótica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","Instituto de Sistemas e Rob\u00f3tica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Sistemas e Robótica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","institution_ids":["https://openalex.org/I4210125590"]},{"raw_affiliation_string":"Instituto de Sistemas e Rob\u00f3tica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036445711","display_name":"Carlos Henggeler Antunes","orcid":"https://orcid.org/0000-0003-4754-2168"},"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":"Carlos Henggeler Antunes","raw_affiliation_strings":["INESC Coimbra, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC Coimbra, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085631032","display_name":"Rui P. Rocha","orcid":"https://orcid.org/0000-0002-4612-3554"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]},{"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":"Rui Rocha","raw_affiliation_strings":["Instituto de Sistemas e Robótica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","Instituto de Sistemas e Rob\u00f3tica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instituto de Sistemas e Robótica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","institution_ids":["https://openalex.org/I4210125590"]},{"raw_affiliation_string":"Instituto de Sistemas e Rob\u00f3tica, Dept. of Electrical and Comp. Eng., University of Coimbra, 3030-290, Portugal","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2539","last_page":"2544"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9979000091552734,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8029478788375854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6016845107078552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5134259462356567},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48489028215408325},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4652009904384613},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4612066149711609},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.45877182483673096},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4355959892272949},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4260683059692383},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.41141384840011597},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.36422818899154663},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35057467222213745},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3117803633213043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26166337728500366},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20635265111923218},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14477434754371643}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8029478788375854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6016845107078552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5134259462356567},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48489028215408325},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4652009904384613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4612066149711609},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.45877182483673096},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4355959892272949},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4260683059692383},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.41141384840011597},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.36422818899154663},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35057467222213745},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3117803633213043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26166337728500366},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20635265111923218},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14477434754371643},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2010.5641920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2010.5641920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1562281457","https://openalex.org/W1580484824","https://openalex.org/W1586904125","https://openalex.org/W1680573167","https://openalex.org/W1708444016","https://openalex.org/W1933567037","https://openalex.org/W1976157781","https://openalex.org/W1988980088","https://openalex.org/W1995981494","https://openalex.org/W2014875556","https://openalex.org/W2031332216","https://openalex.org/W2036504667","https://openalex.org/W2105698364","https://openalex.org/W2107682299","https://openalex.org/W2140986610","https://openalex.org/W2152195021","https://openalex.org/W2168271007","https://openalex.org/W2296148711","https://openalex.org/W4387228526","https://openalex.org/W6635196688","https://openalex.org/W6637514374","https://openalex.org/W6640434294","https://openalex.org/W6684645581","https://openalex.org/W6857538364"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963"],"abstract_inverted_index":{"Finding":[0],"the":[1,17,55,67,72,75,85],"longest":[2],"simple":[3],"path":[4],"in":[5,34,65,99],"a":[6,11,59],"generic":[7],"undirected":[8],"graph":[9],"is":[10],"challenging":[12],"issue":[13],"that":[14],"belongs":[15],"to":[16,28,83],"NP-Complete":[18],"class":[19],"of":[20,47,74],"problems.":[21],"Four":[22],"approaches":[23],"based":[24,49],"on":[25,50,62,71],"genetic":[26],"algorithms":[27,40],"solve":[29],"this":[30,35],"problem":[31],"are":[32],"presented":[33],"article.":[36],"The":[37],"first":[38],"three":[39],"proposed":[41],"use":[42],"crossover":[43],"mechanisms":[44],"between":[45],"pairs":[46],"solutions":[48],"their":[51,90,97],"intersecting":[52],"regions":[53],"and":[54,93,103],"fourth":[56],"one":[57],"uses":[58],"mutation":[60],"mechanism":[61],"individual":[63],"solutions,":[64],"which":[66,88],"perturbation":[68],"applied":[69],"depends":[70],"state":[73],"system.":[76],"Simulation":[77],"experiments":[78],"have":[79],"been":[80],"carried":[81],"out":[82],"validate":[84],"distinct":[86],"approaches,":[87],"reveal":[89],"good":[91],"performance":[92],"provide":[94],"hints":[95],"for":[96],"application":[98],"robotics,":[100],"packet":[101],"networks":[102],"other":[104],"fields.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}