{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110207,0.001036868,0.001644136,0.0009386489,0.0007733193,0.001871763,0.002300451,0.001461712,0.006158783],"category_scores_gemma":[0.004073843,0.001006027,0.0009165168,0.001721952,0.0007349752,0.002596938,0.001340151,0.001292687,0.0004498953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002304121,"about_ca_system_score_gemma":0.00204771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009246689,"about_ca_topic_score_gemma":0.008903011,"domain_scores_codex":[0.9991848,0.0002244177,0.0000305546,0.0002373193,0.0001360674,0.0001868122],"domain_scores_gemma":[0.9985104,0.00098593,0.0001761381,0.00008923875,0.0001318469,0.0001063995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001380979,0.00007096947,0.0003560378,0.00009956284,0.00003231389,0.00006955214,0.00003827428,0.9658009,0.0005436967,0.0175844,0.002531244,0.01273498],"study_design_scores_gemma":[0.0000154665,0.00002666476,0.0001261237,0.000005467609,0.000009465327,0.00002443659,0.00002383398,0.9877067,0.000144511,0.01114747,0.0007614894,0.000008279695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1193144,0.0008027196,0.8552689,0.00226279,0.0002512449,0.0002749034,0.002221619,0.0005497216,0.01905379],"genre_scores_gemma":[0.8932707,0.0005691297,0.08832854,0.0001550016,0.0001425354,0.0001884862,0.001768518,0.0001708589,0.01540615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009246689,"threshold_uncertainty_score":0.02060312,"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."}}