{"id":"W4320149362","doi":"10.1007/978-3-031-24866-5_8","title":"Learning to Solve a Stochastic Orienteering Problem with Time Windows","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Orienteering; Vehicle routing problem; Computer science; Reinforcement learning; Mathematical optimization; Combinatorial optimization; Variety (cybernetics); Travelling salesman problem; Routing (electronic design automation); Optimization problem; Artificial intelligence; Algorithm; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083792,0.0008414544,0.001135414,0.0003251239,0.0002384648,0.0007342134,0.001119711,0.001790372,0.003542798],"category_scores_gemma":[0.00395244,0.0006246164,0.0007361026,0.0006590723,0.0007340134,0.001530487,0.00120282,0.001478813,0.0002973767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006301476,"about_ca_system_score_gemma":0.0009384942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00562975,"about_ca_topic_score_gemma":0.003434804,"domain_scores_codex":[0.9996996,0.00008915787,0.00001799892,0.00009697609,0.00004961668,0.00004670328],"domain_scores_gemma":[0.9983522,0.001347748,0.00008919373,0.00005755058,0.00008511169,0.00006834965],"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.00007043211,0.00005278533,0.0003054627,0.00005753662,0.00002689032,0.00002922504,0.00002389841,0.9498581,0.0006081665,0.01137138,0.0009808344,0.03661533],"study_design_scores_gemma":[0.000007284827,0.00002257756,0.00002988868,0.000002634588,0.000003062051,0.000003766006,0.000002966602,0.9952477,0.0001159766,0.004424761,0.0001374955,0.000001872062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03967224,0.0003527205,0.9563624,0.0002925975,0.00006295498,0.00003798114,0.00006267169,0.0001781138,0.002978179],"genre_scores_gemma":[0.7088235,0.0006902025,0.2748674,0.0002324371,0.0002217522,0.000251592,0.0003781756,0.0001691536,0.0143659],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00562975,"threshold_uncertainty_score":0.01185191,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008960571633318136,"score_gpt":0.222514940281767,"score_spread":0.2135543686484488,"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."}}