{"id":"https://openalex.org/W2139253974","doi":"https://doi.org/10.1109/giis.2009.5307093","title":"Hybrid algorithm for solving a multimodal transport problems using a transfer graph model","display_name":"Hybrid algorithm for solving a multimodal transport problems using a transfer graph model","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2139253974","doi":"https://doi.org/10.1109/giis.2009.5307093","mag":"2139253974"},"language":"en","primary_location":{"id":"doi:10.1109/giis.2009.5307093","doi":"https://doi.org/10.1109/giis.2009.5307093","is_oa":false,"landing_page_url":"https://doi.org/10.1109/giis.2009.5307093","pdf_url":null,"source":{"id":"https://openalex.org/S4306418493","display_name":"Global Information Infrastructure and Networking Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Global Information Infrastructure Symposium","raw_type":"proceedings-article"},"volume":null,"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/A5036598081","display_name":"Hedi Ayed","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405264049","display_name":"Universit\u00e9 Paul Verlaine - Metz","ror":"https://ror.org/00t8qmx52","country_code":"FR","type":"education","lineage":["https://openalex.org/I4405264049","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4405264519","display_name":"Centre de recherche public Henri-Tudor","ror":"https://ror.org/02689jc25","country_code":"LU","type":"nonprofit","lineage":["https://openalex.org/I4405264519"]}],"countries":["FR","LU"],"is_corresponding":false,"raw_author_name":"Ayed Hedi","raw_affiliation_strings":["France and CRP Henri Tudor, University of Paul Verlaine-Metz, France","University Paul Verlaine of Metz, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"France and CRP Henri Tudor, University of Paul Verlaine-Metz, France","institution_ids":["https://openalex.org/I4405264049","https://openalex.org/I4405264519"]},{"raw_affiliation_string":"University Paul Verlaine of Metz, France#TAB#","institution_ids":["https://openalex.org/I4405264049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102981580","display_name":"Zineb Habbas","orcid":"https://orcid.org/0000-0002-9398-7072","observed_orcids":["https://orcid.org/0000-0002-9398-7072"]},"institutions":[{"id":"https://openalex.org/I4405264049","display_name":"Universit\u00e9 Paul Verlaine - Metz","ror":"https://ror.org/00t8qmx52","country_code":"FR","type":"education","lineage":["https://openalex.org/I4405264049","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zineb Habbas","raw_affiliation_strings":["University of Paul Verlaine-Metz, France","University Paul Verlaine of Metz, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paul Verlaine-Metz, France","institution_ids":["https://openalex.org/I4405264049"]},{"raw_affiliation_string":"University Paul Verlaine of Metz, France#TAB#","institution_ids":["https://openalex.org/I4405264049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000831625","display_name":"Carlos Galvez-Fernandez","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405264519","display_name":"Centre de recherche public Henri-Tudor","ror":"https://ror.org/02689jc25","country_code":"LU","type":"nonprofit","lineage":["https://openalex.org/I4405264519"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Carlos Galvez-Fernandez","raw_affiliation_strings":["CRP Henri Tudor, Luxembourg","CRP Henri Tudor, Luxembourg, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg","institution_ids":["https://openalex.org/I4405264519"]},{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg, France","institution_ids":["https://openalex.org/I4405264519"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106715487","display_name":"Djamel Khadraoui","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405264519","display_name":"Centre de recherche public Henri-Tudor","ror":"https://ror.org/02689jc25","country_code":"LU","type":"nonprofit","lineage":["https://openalex.org/I4405264519"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Djamel Khadraoui","raw_affiliation_strings":["CRP Henri Tudor, Luxembourg","CRP Henri Tudor, Luxembourg, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg","institution_ids":["https://openalex.org/I4405264519"]},{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg, France","institution_ids":["https://openalex.org/I4405264519"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.899,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85429142,"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":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.6406000256538391,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.6406000256538391,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.15719999372959137,"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.11869999766349792,"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/multimodal-transport","display_name":"multimodal transport","score":0.9769999980926514},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8270000219345093},{"id":"https://openalex.org/keywords/time-dependent-networks","display_name":"time-dependent networks","score":0.9449999928474426},{"id":"https://openalex.org/keywords/abstract-graphs","display_name":"abstract graphs","score":0.843999981880188},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.9850000143051147},{"id":"https://openalex.org/keywords/hybrid-method","display_name":"hybrid algorithm","score":0.9240000247955322}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8579657077789307},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.717024028301239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6563881635665894},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6039402484893799},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.550445020198822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5259174108505249},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5253435969352722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5114895105361938},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4676871597766876},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4558708369731903},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4308852553367615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43074846267700195},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4252590537071228},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4216534495353699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22804102301597595},{"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/giis.2009.5307093","doi":"https://doi.org/10.1109/giis.2009.5307093","is_oa":false,"landing_page_url":"https://doi.org/10.1109/giis.2009.5307093","pdf_url":null,"source":{"id":"https://openalex.org/S4306418493","display_name":"Global Information Infrastructure and Networking Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 Global Information Infrastructure Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6773999929428101,"display_name":"Industry, innovation and infrastructure"}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1505660226","https://openalex.org/W1519139625","https://openalex.org/W1530490667","https://openalex.org/W1573676079","https://openalex.org/W1995367195","https://openalex.org/W2004617458","https://openalex.org/W2039568841","https://openalex.org/W2082795795","https://openalex.org/W2087440067","https://openalex.org/W2109493298","https://openalex.org/W2155754515","https://openalex.org/W2169528473","https://openalex.org/W7074640217"],"related_works":["https://openalex.org/W2104872182","https://openalex.org/W2756603214","https://openalex.org/W2087440067","https://openalex.org/W2067683633","https://openalex.org/W2024503419","https://openalex.org/W135596705","https://openalex.org/W2625693911","https://openalex.org/W2390138068","https://openalex.org/W3011127012","https://openalex.org/W2378699412"],"abstract_inverted_index":{"This":[0,51],"paper":[1],"presents":[2],"an":[3],"approach":[4,15,52],"to":[5,42],"the":[6,18,44,48,59],"shortest":[7,45],"path":[8,46],"problem":[9],"in":[10],"time-dependent":[11,37],"multimodal":[12],"networks.":[13],"The":[14],"derives,":[16],"from":[17],"initial":[19],"graph,":[20,29],"a":[21,36],"more":[22],"simplified":[23],"and":[24],"non-time-dependent":[25],"structure,":[26],"called":[27],"abstract":[28],"by":[30,58],"using":[31],"ant":[32],"colony":[33],"optimization.":[34],"Then,":[35],"Dijkstra's":[38],"algorithm":[39],"is":[40],"used":[41],"compute":[43],"on":[47],"new":[49],"structure.":[50],"improves":[53],"two":[54],"previous":[55],"solutions":[56],"proposed":[57],"authors.":[60]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2016-06-24T00:00:00"}