{"id":"W2982060258","doi":"10.1051/matecconf/201929602009","title":"Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem","year":2019,"lang":"en","type":"article","venue":"MATEC Web of Conferences","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Public Safety Canada; Defence Research and Development Canada","funders":"","keywords":"Pickup; Heuristic; Computer science; Descent (aeronautics); Mathematical optimization; Ground transportation; Vehicle routing problem; Depot; Range (aeronautics); Greedy algorithm; Operations research; Transport engineering; Engineering; Routing (electronic design automation); Computer network; Mathematics; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003250155,0.0001471946,0.0003127123,0.0001157753,0.00001769783,0.0000253426,0.0002082835,0.0001090762,0.00064708],"category_scores_gemma":[0.00003877504,0.000144451,0.00005028563,0.0002153505,0.00005269163,0.0001433311,0.00004042606,0.00009078765,0.00002348362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002805664,"about_ca_system_score_gemma":0.0002275563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007451737,"about_ca_topic_score_gemma":0.00001043802,"domain_scores_codex":[0.9989262,0.00005616621,0.0004432872,0.0001603575,0.000243602,0.0001703764],"domain_scores_gemma":[0.9992397,0.00007796439,0.000152151,0.0002272823,0.0002641587,0.00003878881],"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.000009317136,0.00002665221,0.01135623,0.0003441751,0.00003571819,3.08334e-7,0.0001814775,0.973395,0.01140765,0.001140946,0.00003234233,0.002070152],"study_design_scores_gemma":[0.0005266205,0.00005083327,0.002315508,0.0001557136,0.00001908407,0.000001316493,0.0001508706,0.968341,0.02787144,0.0000518212,0.0003392139,0.0001765927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7396459,0.0003212602,0.2140549,0.00003605767,0.0003973143,0.0005156501,0.00002649735,0.0003767863,0.04462562],"genre_scores_gemma":[0.7775342,0.000100557,0.2220892,0.000004547622,0.00001036647,0.000006520384,0.000007441771,0.00001945314,0.0002277085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04439791,"threshold_uncertainty_score":0.7085072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01846601141010913,"score_gpt":0.2434645176002425,"score_spread":0.2249985061901334,"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."}}