{"id":"W2014252819","doi":"10.3141/1894-20","title":"Bilevel Programming Approach to Optimizing a Logistic Distribution Network with Balancing Requirements","year":2004,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Bilevel optimization; Workload; Computer science; Operations research; Service (business); Logistic distribution; Minification; Mathematical optimization; Optimization problem; Engineering; Logistic regression; Algorithm; Economics","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.001918526,0.001330703,0.00188921,0.001041623,0.0006326866,0.002298077,0.001137968,0.001924948,0.003089958],"category_scores_gemma":[0.00390546,0.0009044007,0.00103462,0.002001021,0.001134988,0.001137592,0.001447226,0.002053914,0.0004020498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001593816,"about_ca_system_score_gemma":0.002231376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007786406,"about_ca_topic_score_gemma":0.004598613,"domain_scores_codex":[0.999033,0.0004827076,0.00004405789,0.0001315488,0.0001792797,0.0001294522],"domain_scores_gemma":[0.9984941,0.001087493,0.0001026625,0.00003586394,0.0002166279,0.00006321093],"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.00001384627,0.00001236473,0.0000888361,0.00003685451,0.0000126699,0.00002686042,0.00001961871,0.9907503,0.0001575397,0.005068148,0.0001523792,0.003660602],"study_design_scores_gemma":[0.000007860401,0.0000164833,0.000026416,0.00000571345,0.000004720094,0.00000748916,0.00001379439,0.9941385,0.00009666831,0.005207881,0.0004702497,0.000004259693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01109595,0.000390989,0.9837422,0.0002834473,0.00003370264,0.00004860856,0.00007805014,0.0001026097,0.004224325],"genre_scores_gemma":[0.540846,0.001480865,0.4462633,0.0001902142,0.00009669697,0.0007225423,0.0003801021,0.0001591716,0.009860966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007786406,"threshold_uncertainty_score":0.01548213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.143051038247125,"score_gpt":0.3523274438039702,"score_spread":0.2092764055568453,"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."}}