{"id":"https://openalex.org/W2736751709","doi":"https://doi.org/10.1007/s10951-017-0535-z","title":"Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem","display_name":"Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem","publication_year":2017,"publication_date":"2017-07-22","ids":{"openalex":"https://openalex.org/W2736751709","doi":"https://doi.org/10.1007/s10951-017-0535-z","mag":"2736751709"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-017-0535-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-017-0535-z","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-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/A5022230459","display_name":"Lunce Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lunce Fu","raw_affiliation_strings":["Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA, 90089, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA, 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017400963","display_name":"Maged Dessouky","orcid":"https://orcid.org/0000-0002-9630-6201"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maged Dessouky","raw_affiliation_strings":["Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA, 90089, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA, 90089, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017400963"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.2693,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65221431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"21","issue":"3","first_page":"367","last_page":"386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.998199999332428,"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/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.998199999332428,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9930999875068665,"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.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7256444692611694},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6949886083602905},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6945286989212036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6568911075592041},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6029244661331177},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5977897047996521},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5312252640724182},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.49099281430244446},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4830946922302246},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.48043298721313477},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4776557683944702},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.47319576144218445},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.44745275378227234},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4111575186252594},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4014902710914612},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3753175735473633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25796693563461304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2571597695350647},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1811307668685913},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1222902238368988},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09213197231292725},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08784297108650208}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7256444692611694},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6949886083602905},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6945286989212036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6568911075592041},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6029244661331177},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5977897047996521},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5312252640724182},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.49099281430244446},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4830946922302246},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.48043298721313477},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4776557683944702},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.47319576144218445},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.44745275378227234},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4111575186252594},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4014902710914612},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3753175735473633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25796693563461304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2571597695350647},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1811307668685913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1222902238368988},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09213197231292725},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08784297108650208},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10951-017-0535-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-017-0535-z","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0535-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10951-017-0535-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1601277319","https://openalex.org/W1985327268","https://openalex.org/W1986652726","https://openalex.org/W1987074583","https://openalex.org/W1987916269","https://openalex.org/W2049130335","https://openalex.org/W2052118269","https://openalex.org/W2065006817","https://openalex.org/W2079274727","https://openalex.org/W2089338760","https://openalex.org/W2093805145","https://openalex.org/W2133957320","https://openalex.org/W2166236009"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1972487624","https://openalex.org/W2186932829","https://openalex.org/W1997440971","https://openalex.org/W2064711473","https://openalex.org/W104942727","https://openalex.org/W1579931977","https://openalex.org/W1515277195","https://openalex.org/W1971025399","https://openalex.org/W2121598558"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}