{"id":"https://openalex.org/W3146299665","doi":"https://doi.org/10.1109/ipdps.2006.1639513","title":"A nature-inspired algorithm for the disjoint paths problem","display_name":"A nature-inspired algorithm for the disjoint paths problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3146299665","doi":"https://doi.org/10.1109/ipdps.2006.1639513","mag":"3146299665"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","raw_type":"proceedings-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/A5084968190","display_name":"Mar\u00eda J. Blesa","orcid":"https://orcid.org/0000-0001-8246-9926"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"M.J. Blesa","raw_affiliation_strings":["ALBCOM research group, Universitat Polilt\u00e8cnica de Catalunya, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"ALBCOM research group, Universitat Polilt\u00e8cnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051233439","display_name":"Christian Blum","orcid":"https://orcid.org/0000-0002-1736-3559"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"C. Blum","raw_affiliation_strings":["ALBCOM research group, Universitat Polilt\u00e8cnica de Catalunya, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"ALBCOM research group, Universitat Polilt\u00e8cnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084968190"],"corresponding_institution_ids":["https://openalex.org/I9617848"],"apc_list":null,"apc_paid":null,"fwci":0.8076,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82415406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"8 pp.","last_page":"8 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.6722092032432556},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6421692967414856},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6238974928855896},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.5608070492744446},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.544222354888916},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.48833367228507996},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4738227128982544},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4385543465614319},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4371464252471924},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4248868525028229},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41297653317451477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4012327194213867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24978649616241455},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20567455887794495},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12817281484603882},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11428654193878174}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6722092032432556},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6421692967414856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6238974928855896},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5608070492744446},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.544222354888916},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.48833367228507996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4738227128982544},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4385543465614319},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4371464252471924},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4248868525028229},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41297653317451477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4012327194213867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24978649616241455},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20567455887794495},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12817281484603882},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11428654193878174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639513","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","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":23,"referenced_works":["https://openalex.org/W619004858","https://openalex.org/W1487599410","https://openalex.org/W1591562949","https://openalex.org/W1664011265","https://openalex.org/W1801849579","https://openalex.org/W1983103400","https://openalex.org/W1985893635","https://openalex.org/W1996073274","https://openalex.org/W2005509629","https://openalex.org/W2010748366","https://openalex.org/W2041884875","https://openalex.org/W2042697932","https://openalex.org/W2062948942","https://openalex.org/W2080283527","https://openalex.org/W2107941094","https://openalex.org/W2114218179","https://openalex.org/W2117663227","https://openalex.org/W2142182373","https://openalex.org/W2154929945","https://openalex.org/W2162125251","https://openalex.org/W6629155253","https://openalex.org/W6645887367","https://openalex.org/W6666227138"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2373784230","https://openalex.org/W2045237525","https://openalex.org/W1581626193","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W46882622","https://openalex.org/W2019216770"],"abstract_inverted_index":{"The":[0,5,59],"edge-disjoint":[1],"paths":[2],"(EDP)":[3],"problem":[4,7],"EDP":[6,36],"is":[8,27],"interesting":[9],"for":[10,33,55,67],"different":[11],"research":[12],"fields":[13],"such":[14],"as":[15,64],"combinatorial":[16],"optimization,":[17],"algorithmic":[18],"graph":[19],"theory":[20],"and":[21,42,51,89],"operations":[22],"research.":[23],"In":[24],"general,":[25],"there":[26],"a":[28,43,95],"lack":[29],"of":[30,73],"efficient":[31],"algorithms":[32,66],"tackling":[34,56],"the":[35,57,71,74,84],"problem.":[37,58],"Only":[38],"some":[39],"greedy":[40,60],"approaches":[41,61],"preliminary":[44],"ant":[45],"colony":[46],"optimization":[47],"(ACO)":[48],"approach":[49,86],"(Blesa":[50],"Blum,":[52],"2004)":[53],"exist":[54],"are":[62,78],"used":[63],"approximation":[65],"theoretical":[68],"purposes,":[69],"but":[70],"quality":[72],"solutions":[75],"they":[76],"obtain":[77],"susceptible":[79],"to":[80],"improvement.":[81],"Based":[82],"on":[83],"(basic)":[85],"in":[87],"Blesa":[88],"Blum":[90],"(2004),":[91],"we":[92],"have":[93],"evolved":[94],"more":[96],"sophisticated":[97],"ACO":[98],"algorithm":[99]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}