{"id":"W4402125184","doi":"10.1287/ijoc.2023.0404","title":"The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Multigraph; Vehicle routing problem; Scheduling (production processes); Computer science; Parallel computing; Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0007704683,0.001120516,0.0009134114,0.0007417536,0.0009110521,0.001382083,0.001216608,0.001674685,0.009378132],"category_scores_gemma":[0.002290762,0.0005688418,0.001066003,0.001912462,0.0006614862,0.002262995,0.001069392,0.001202411,0.0009472932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001740067,"about_ca_system_score_gemma":0.001387285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007214888,"about_ca_topic_score_gemma":0.009311055,"domain_scores_codex":[0.9992217,0.0002757371,0.00003197513,0.0002410289,0.00009863048,0.0001309513],"domain_scores_gemma":[0.9986309,0.0009878114,0.0001314961,0.00007372984,0.00007396436,0.0001019947],"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.0002126281,0.0001811528,0.001163338,0.0003728257,0.00008262736,0.000467404,0.0001894585,0.90465,0.002625996,0.04046879,0.009551987,0.04003365],"study_design_scores_gemma":[0.00005201863,0.00008218711,0.0008918638,0.0000312664,0.00003997786,0.0001951797,0.0001770374,0.9447328,0.001112255,0.04280948,0.009856436,0.000019373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1718773,0.0008123225,0.7940673,0.002812962,0.0002124815,0.0004717067,0.003955625,0.0007372295,0.0250531],"genre_scores_gemma":[0.5627583,0.001163114,0.411229,0.0004869665,0.0001736905,0.000413356,0.003833705,0.0003776106,0.01956437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009378132,"threshold_uncertainty_score":0.03137296,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01068219619837272,"score_gpt":0.2540957879198738,"score_spread":0.243413591721501,"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."}}