{"id":"W2922070351","doi":"10.1007/978-3-030-19212-9_9","title":"A Constraint Programming Approach to Electric Vehicle Routing with Time Windows","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Vehicle routing problem; Mathematical optimization; Constraint programming; Electric vehicle; Integer programming; Linear programming; Routing (electronic design automation); Scheduling (production processes); Transformation (genetics); Range (aeronautics); Minification; Algorithm; Computer network; Stochastic programming; Mathematics; Engineering","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008900177,0.0004595814,0.0004911806,0.0006025149,0.0001158809,0.000284952,0.0007486249,0.0002459326,0.00001206523],"category_scores_gemma":[0.0000696415,0.0004214766,0.0000614236,0.0008793111,0.0001692441,0.0001514977,0.000173113,0.0007876342,0.00005822967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003592753,"about_ca_system_score_gemma":0.000280605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003976807,"about_ca_topic_score_gemma":0.000002312115,"domain_scores_codex":[0.9974527,0.00002945157,0.0003759815,0.0008508074,0.0005774879,0.0007135583],"domain_scores_gemma":[0.9987602,0.0002582139,0.0001040007,0.0005822682,0.0001360694,0.0001592457],"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.000003262282,0.00000692129,0.00004430894,0.00003686079,0.00001098298,0.000005415058,0.0003101798,0.7372764,0.0005193527,0.0002913982,0.000002278714,0.2614927],"study_design_scores_gemma":[0.0002160466,0.0001109923,0.00003820736,0.0002768891,0.00001215253,0.00005938391,3.221018e-7,0.997222,0.0009891049,0.0002405433,0.0002770351,0.0005573099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004768505,0.00007860336,0.987201,0.00004830604,0.0001904007,0.0008663846,0.000001779997,0.0004215076,0.01071515],"genre_scores_gemma":[0.1387623,0.000002127853,0.8604512,0.0002595727,0.0001953806,0.00001250204,0.000005338601,0.0001001295,0.0002114389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2609354,"threshold_uncertainty_score":0.9998237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0122183598048338,"score_gpt":0.225919186827576,"score_spread":0.2137008270227422,"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."}}