{"id":"W4388888810","doi":"10.1016/j.trc.2023.104411","title":"Dynamic routing for the Electric Vehicle Shortest Path Problem with charging station occupancy information","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"Horizon 2020; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Charging station; Electric vehicle; Markov decision process; Routing (electronic design automation); Computer science; Occupancy; Queue; Battery (electricity); Dijkstra's algorithm; Mathematical optimization; Real-time computing; Markov process; Computer network; Engineering; Mathematics; Physics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006339449,0.0001634626,0.0001386236,0.0005042359,0.0005282374,0.00009846462,0.0002961257,0.0001170874,0.000006349291],"category_scores_gemma":[0.00007344496,0.0001200666,0.00004153851,0.002629335,0.00006331384,0.0005724159,0.000008462438,0.0005136261,0.00001534159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009348813,"about_ca_system_score_gemma":0.00004948227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003751671,"about_ca_topic_score_gemma":0.0001112727,"domain_scores_codex":[0.9983356,0.00001741856,0.0003386434,0.0001811954,0.0004541441,0.0006730142],"domain_scores_gemma":[0.9991799,0.0002501998,0.00006097006,0.0002407309,0.0002411449,0.00002703758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000128056,0.00002575616,0.01734563,0.0006662362,0.0002427034,0.00001144279,0.004521079,0.4003538,0.01819512,0.01832669,0.01132851,0.5288549],"study_design_scores_gemma":[0.0004771331,0.0001919212,0.0332025,0.0001176637,0.0000250524,0.000001139469,0.004882393,0.9429569,0.00612412,0.002403892,0.009340783,0.0002764926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9208228,0.0005001085,0.06696709,0.002800778,0.0001073756,0.002034891,0.0001012509,0.006514561,0.0001511701],"genre_scores_gemma":[0.9965989,0.0009273535,0.001444207,0.000009361164,0.00001501008,0.000663764,0.0002815701,0.00003332723,0.00002648321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5426031,"threshold_uncertainty_score":0.4896176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01864459973064319,"score_gpt":0.2836045077326228,"score_spread":0.2649599080019796,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}