{"id":"https://openalex.org/W2136296256","doi":"https://doi.org/10.1109/icnsc.2004.1297096","title":"An exact method to find the intermodal shortest path (ISP)","display_name":"An exact method to find the intermodal shortest path (ISP)","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2136296256","doi":"https://doi.org/10.1109/icnsc.2004.1297096","mag":"2136296256"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2004.1297096","doi":"https://doi.org/10.1109/icnsc.2004.1297096","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2004.1297096","pdf_url":null,"source":{"id":"https://openalex.org/S4363608241","display_name":"IEEE International Conference on Networking, Sensing and Control (ICNSC)","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":"IEEE International Conference on Networking, Sensing and Control, 2004","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/A5035921668","display_name":"Mounir Boussedjra","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Boussedjra","raw_affiliation_strings":["Systems and Transport Laboratory (S.e.T), University of Technology of Belfort-Montb\u00e9liard, Belfort, France","Syst. & Transp. lab., Univ. of Technol. of Belfort-Montbeliard, Belfort, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems and Transport Laboratory (S.e.T), University of Technology of Belfort-Montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]},{"raw_affiliation_string":"Syst. & Transp. lab., Univ. of Technol. of Belfort-Montbeliard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012721018","display_name":"Christelle Rosse Bloch","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C. Bloch","raw_affiliation_strings":["Systems and Transport Laboratory (S.e.T), University of Technology of Belfort-Montb\u00e9liard, Belfort, France","Syst. & Transp. lab., Univ. of Technol. of Belfort-Montbeliard, Belfort, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems and Transport Laboratory (S.e.T), University of Technology of Belfort-Montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]},{"raw_affiliation_string":"Syst. & Transp. lab., Univ. of Technol. of Belfort-Montbeliard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090946345","display_name":"Abdellah El Moudni","orcid":"https://orcid.org/0000-0002-4516-7168","observed_orcids":["https://orcid.org/0000-0002-4516-7168"]},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A.E. Moudni","raw_affiliation_strings":["Systems and Transport Laboratory (S.e.T), University of Technology of Belfort-Montb\u00e9liard, Belfort, France","Syst. & Transp. lab., Univ. of Technol. of Belfort-Montbeliard, Belfort, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems and Transport Laboratory (S.e.T), University of Technology of Belfort-Montb\u00e9liard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]},{"raw_affiliation_string":"Syst. & Transp. lab., Univ. of Technol. of Belfort-Montbeliard, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I37553959"],"apc_list":null,"apc_paid":null,"fwci":1.7687,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.89904502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":null,"first_page":"1075","last_page":"1080"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.31929999589920044,"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.31929999589920044,"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/T12725","display_name":"transportation and logistics systems","score":0.30250000953674316,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2175000011920929,"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/label-correcting-algorithm","display_name":"label-correcting algorithm","score":0.9819999933242798},{"id":"https://openalex.org/keywords/travel-time-minimization","display_name":"travel time minimization","score":0.9430000185966492},{"id":"https://openalex.org/keywords/exact-algorithms","display_name":"exact algorithms","score":0.3619999885559082}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8621877431869507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6901527643203735},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6608750820159912},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6456961035728455},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6076570153236389},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.517414927482605},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.46699443459510803},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46691039204597473},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4377746880054474},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4207620620727539},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31571558117866516},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.26793140172958374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21968179941177368},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13390842080116272}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2004.1297096","doi":"https://doi.org/10.1109/icnsc.2004.1297096","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2004.1297096","pdf_url":null,"source":{"id":"https://openalex.org/S4363608241","display_name":"IEEE International Conference on Networking, Sensing and Control (ICNSC)","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":"IEEE International Conference on Networking, Sensing and Control, 2004","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4943999946117401,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"sustainable_development_goals_aurora":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1998426416","https://openalex.org/W2006116392","https://openalex.org/W2010687205","https://openalex.org/W2079274727","https://openalex.org/W2082795795","https://openalex.org/W2098882935","https://openalex.org/W2129673493","https://openalex.org/W2130156572","https://openalex.org/W2144844724","https://openalex.org/W2163595279","https://openalex.org/W2166236009","https://openalex.org/W2166739719","https://openalex.org/W3123283118","https://openalex.org/W6635822606"],"related_works":["https://openalex.org/W7049173757","https://openalex.org/W3144760303","https://openalex.org/W2269184848","https://openalex.org/W2410350060","https://openalex.org/W1995367195","https://openalex.org/W2383998039","https://openalex.org/W1986797609","https://openalex.org/W2378699412","https://openalex.org/W4234243195","https://openalex.org/W2187895060"],"abstract_inverted_index":{"In":[0],"this":[1,78],"paper,":[2],"we":[3],"study":[4],"the":[5,9,21,28,55,72,81],"problem":[6,43],"of":[7,35,77],"finding":[8],"origin-destination":[10],"(O-D)":[11],"shortest":[12,41],"path":[13,42,56],"in":[14],"intermodal":[15,40],"transportation":[16,25],"networks,":[17],"aiming":[18],"at":[19],"minimizing":[20],"travel":[22],"time.":[23],"The":[24,39,50,75],"network":[26],"and":[27,44,80],"corresponding":[29],"data":[30],"are":[31,47],"modeled":[32],"by":[33,60],"means":[34],"a":[36,62],"multi-label":[37],"graph.":[38],"its":[45,86],"definition":[46],"briefly":[48],"described.":[49],"algorithm":[51],"developed":[52],"to":[53],"find":[54],"is":[57],"presented,":[58],"especially":[59],"detailing":[61],"label":[63],"correcting":[64],"approach":[65,79],"that":[66],"updates":[67],"some":[68],"labels":[69],"associated":[70],"with":[71],"graph":[73],"nodes.":[74],"implementation":[76],"results":[82],"it":[83],"provides":[84],"show":[85],"validity.":[87]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}