{"id":"W2957530701","doi":"","title":"Heuristics for the dynamic facility location problem with modular capacities","year":2019,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Heuristics; Benchmark (surveying); Mathematical optimization; Modular design; Heuristic; Time horizon; Genetic algorithm; Computer science; Facility location problem; Variable (mathematics); Integer programming; Point (geometry); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182671,0.0002641395,0.0002475843,0.0001293368,0.0001741036,0.0001143827,0.0003247795,0.0001677546,0.00001509486],"category_scores_gemma":[0.0001120421,0.0002109631,0.00007052068,0.0003864919,0.0000904337,0.0001927331,0.00004037094,0.0002921229,0.00001250892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003727477,"about_ca_system_score_gemma":0.00008486392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004776773,"about_ca_topic_score_gemma":0.0003348666,"domain_scores_codex":[0.9986396,0.00007145955,0.0003244114,0.0002699312,0.0002336532,0.0004609318],"domain_scores_gemma":[0.9986104,0.0002750141,0.00008982787,0.0007295682,0.0002043278,0.00009088997],"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.00003026902,0.00002101939,0.003404473,0.0001853485,0.00005363044,8.226681e-7,0.0003082314,0.9846149,0.002222883,0.002537168,0.0001784276,0.006442794],"study_design_scores_gemma":[0.0003376674,0.00007381474,0.004614019,0.00003853623,0.00003727795,0.00001842463,0.0002135204,0.9898189,0.002761986,0.0006560185,0.001153758,0.0002760274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06661488,0.0005578683,0.9293553,0.0005394744,0.0001053667,0.001568482,0.00008992628,0.001007267,0.0001613895],"genre_scores_gemma":[0.6807473,0.00005779724,0.3179361,0.0001412251,0.00002467754,0.000538243,0.00003818191,0.00005774172,0.0004587391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6141324,"threshold_uncertainty_score":0.8602825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008236871715568514,"score_gpt":0.2170081944015468,"score_spread":0.2087713226859783,"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."}}