{"id":"https://openalex.org/W2029839856","doi":"https://doi.org/10.1007/s12159-010-0022-9","title":"Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers\u2019 rules","display_name":"Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers\u2019 rules","publication_year":2010,"publication_date":"2010-06-11","ids":{"openalex":"https://openalex.org/W2029839856","doi":"https://doi.org/10.1007/s12159-010-0022-9","mag":"2029839856"},"language":"en","primary_location":{"id":"doi:10.1007/s12159-010-0022-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12159-010-0022-9","pdf_url":null,"source":{"id":"https://openalex.org/S63515265","display_name":"Logistics Research","issn_l":"1865-035X","issn":["1865-035X","1865-0368"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313874","host_organization_name":"Bundesvereinigung Logistik","host_organization_lineage":["https://openalex.org/P4310313874"],"host_organization_lineage_names":["Bundesvereinigung Logistik"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logistics Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5007114747","display_name":"Michael Drexl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114863","display_name":"Fraunhofer Center for Applied Research on Supply Chain Services","ror":"https://ror.org/0263r2546","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210114863","https://openalex.org/I4210124274","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Drexl","raw_affiliation_strings":["Fraunhofer SCS, Nordostpark 93, 90411, Nuremberg, Germany","Fraunhofer SCS"],"affiliations":[{"raw_affiliation_string":"Fraunhofer SCS, Nordostpark 93, 90411, Nuremberg, Germany","institution_ids":["https://openalex.org/I4210114863"]},{"raw_affiliation_string":"Fraunhofer SCS","institution_ids":["https://openalex.org/I4210114863"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051167464","display_name":"Eric Prescott\u2010Gagnon","orcid":null},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]},{"id":"https://openalex.org/I4210133247","display_name":"Group for Research in Decision Analysis","ror":"https://ror.org/02pkvpx84","country_code":"CA","type":"facility","lineage":["https://openalex.org/I108192572","https://openalex.org/I159129438","https://openalex.org/I4210133247","https://openalex.org/I45683168","https://openalex.org/I49663120","https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Eric Prescott-Gagnon","raw_affiliation_strings":["\u00c9cole Polytechnique de Montr\u00e9al and GERAD, C.P. 6079, Succursale Centre-Ville, Montr\u00e9al, QC, H3C 3AT, Canada","\u00c9cole Polytechnique de Montr\u00e9al, and GERAD"],"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique de Montr\u00e9al and GERAD, C.P. 6079, Succursale Centre-Ville, Montr\u00e9al, QC, H3C 3AT, Canada","institution_ids":["https://openalex.org/I45683168","https://openalex.org/I4210133247"]},{"raw_affiliation_string":"\u00c9cole Polytechnique de Montr\u00e9al, and GERAD","institution_ids":["https://openalex.org/I45683168","https://openalex.org/I4210133247"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007114747"],"corresponding_institution_ids":["https://openalex.org/I4210114863"],"apc_list":null,"apc_paid":null,"fwci":6.4983,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95813165,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":"2","first_page":"79","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9988999962806702,"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.9988999962806702,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.754625141620636},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6803914308547974},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.613592267036438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5744936466217041},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5629587173461914},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5091685652732849},{"id":"https://openalex.org/keywords/legislation","display_name":"Legislation","score":0.4760073125362396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3760487735271454},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.32247036695480347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2823476791381836},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2719252407550812},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2314167320728302},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22661328315734863},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.09756910800933838},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.0742458701133728}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.754625141620636},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6803914308547974},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.613592267036438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5744936466217041},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5629587173461914},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5091685652732849},{"id":"https://openalex.org/C2777351106","wikidata":"https://www.wikidata.org/wiki/Q49371","display_name":"Legislation","level":2,"score":0.4760073125362396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3760487735271454},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.32247036695480347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2823476791381836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2719252407550812},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2314167320728302},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22661328315734863},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.09756910800933838},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0742458701133728},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s12159-010-0022-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12159-010-0022-9","pdf_url":null,"source":{"id":"https://openalex.org/S63515265","display_name":"Logistics Research","issn_l":"1865-035X","issn":["1865-035X","1865-0368"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313874","host_organization_name":"Bundesvereinigung Logistik","host_organization_lineage":["https://openalex.org/P4310313874"],"host_organization_lineage_names":["Bundesvereinigung Logistik"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logistics Research","raw_type":"journal-article"},{"id":"pmh:oai:fraunhofer.de:N-137811","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-137811.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer IIS","raw_type":"Journal Article"},{"id":"pmh:oai:publica.fraunhofer.de:publica/222065","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/222065","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W311217234","https://openalex.org/W1487895343","https://openalex.org/W1526056715","https://openalex.org/W1601649239","https://openalex.org/W1966462781","https://openalex.org/W1977199485","https://openalex.org/W2016472402","https://openalex.org/W2017387414","https://openalex.org/W2039766013","https://openalex.org/W2053697731","https://openalex.org/W2057192462","https://openalex.org/W2092284539","https://openalex.org/W2097378706","https://openalex.org/W2103025187","https://openalex.org/W2103480272","https://openalex.org/W2129487943","https://openalex.org/W2135195886","https://openalex.org/W2138596841","https://openalex.org/W2172237755","https://openalex.org/W2188856445","https://openalex.org/W4230268831","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2380896940","https://openalex.org/W2372275786","https://openalex.org/W2360757248","https://openalex.org/W2391297446","https://openalex.org/W2495499255","https://openalex.org/W2374527051","https://openalex.org/W2351532294","https://openalex.org/W2387901866","https://openalex.org/W2397086203","https://openalex.org/W2387108638"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"how":[3,20],"drivers\u2019":[4],"rules":[5],"according":[6],"to":[7],"EU":[8],"social":[9],"legislation":[10],"can":[11,26],"be":[12,27],"formally":[13],"modelled":[14],"using":[15],"the":[16,37],"resource":[17,43],"concept":[18],"and":[19,24,31],"\u2018legal\u2019":[21],"vehicle":[22],"routes":[23],"schedules":[25],"computed":[28],"by":[29],"exact":[30],"heuristic":[32],"labelling":[33],"algorithms":[34],"for":[35],"solving":[36],"elementary":[38],"shortest":[39],"path":[40],"problem":[41],"with":[42],"constraints.":[44]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}