{"id":"https://openalex.org/W2343297166","doi":"https://doi.org/10.5220/0005757101970203","title":"An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem","display_name":"An Efficient Label-setting Algorithm for the Bi-objective Shortest Path Problem","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2343297166","doi":"https://doi.org/10.5220/0005757101970203","mag":"2343297166"},"language":"en","primary_location":{"id":"doi:10.5220/0005757101970203","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005757101970203","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 5th the International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0005757101970203","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008714699","display_name":"Antoine Giret","orcid":"https://orcid.org/0000-0001-6623-5943"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Giret","raw_affiliation_strings":["Universit\u00e9 Fran\u00e7ois Rabelais de Tours, CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Fran\u00e7ois Rabelais de Tours, CNRS, France","institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014400532","display_name":"Yannick Kergosien","orcid":"https://orcid.org/0000-0002-9343-0266"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yannick Kergosien","raw_affiliation_strings":["Universit\u00e9 Fran\u00e7ois Rabelais de Tours, CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Fran\u00e7ois Rabelais de Tours, CNRS, France","institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088700382","display_name":"Ga\u00ebl Sauvanet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210134736","display_name":"Veolia (France)","ror":"https://ror.org/03mwypp50","country_code":"FR","type":"company","lineage":["https://openalex.org/I4210134736"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gael Sauvanet","raw_affiliation_strings":["La Compagnie des Mobilit\u00e9s, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"La Compagnie des Mobilit\u00e9s, France","institution_ids":["https://openalex.org/I4210134736"]}]},{"author_position":"last","author":{"id":null,"display_name":"Emmanuel Neron","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Emmanuel Neron","raw_affiliation_strings":["Universit\u00e9 Fran\u00e7ois Rabelais de Tours, CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Fran\u00e7ois Rabelais de Tours, CNRS, France","institution_ids":["https://openalex.org/I110017253","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02369668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"197","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9402999877929688,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9402999877929688,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9341999888420105,"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/T14025","display_name":"Educational Technology and Assessment","score":0.9187999963760376,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7402581572532654},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7219750881195068},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6562761068344116},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5781534910202026},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5625653862953186},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5175668597221375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5160765051841736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4503650665283203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36764246225357056},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.356577068567276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3134284019470215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24127617478370667},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.085137277841568},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07766154408454895}],"concepts":[{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7402581572532654},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7219750881195068},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6562761068344116},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5781534910202026},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5625653862953186},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5175668597221375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5160765051841736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4503650665283203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36764246225357056},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.356577068567276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3134284019470215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24127617478370667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.085137277841568},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07766154408454895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0005757101970203","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005757101970203","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 5th the International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0005757101970203","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0005757101970203","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 5th the International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2381419702","https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W4293054712","https://openalex.org/W1562631103","https://openalex.org/W2368964068","https://openalex.org/W2198982833","https://openalex.org/W2161960576"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}