{"id":"W1970712172","doi":"10.1016/j.ejor.2015.04.017","title":"Exact and heuristic algorithms for the design of hub networks with multiple lines","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Benchmark (surveying); Mathematical optimization; Heuristic; Variable neighborhood search; Set (abstract data type); Computer science; Algorithm; Greedy algorithm; Network planning and design; Greedy randomized adaptive search procedure; Descent (aeronautics); Constraint (computer-aided design); Mathematics; Metaheuristic","routes":{"ca_aff":true,"ca_fund":true,"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.001782581,0.001564274,0.001468934,0.00150836,0.0007901464,0.001412552,0.002002893,0.001962209,0.005881802],"category_scores_gemma":[0.005941154,0.001410964,0.0009763444,0.001616923,0.001307424,0.001451689,0.001226675,0.001630501,0.0006139349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002061015,"about_ca_system_score_gemma":0.002523237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01161663,"about_ca_topic_score_gemma":0.01242106,"domain_scores_codex":[0.9993025,0.0003148767,0.00002467855,0.00009340309,0.0001578237,0.0001067293],"domain_scores_gemma":[0.997184,0.002183882,0.00018939,0.0001191498,0.0002254919,0.00009805225],"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.00002693676,0.00002106831,0.00006748402,0.00003146554,0.000009249928,0.00001053727,0.00001783878,0.9841452,0.0001073512,0.004503455,0.0005493335,0.01050997],"study_design_scores_gemma":[0.00001520439,0.00001401064,0.00002121637,0.000005542829,0.000003517898,0.000003542765,0.000008957347,0.9949839,0.00005774444,0.004601906,0.0002816214,0.000002921662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0145782,0.000527227,0.978224,0.0002166589,0.00006442583,0.0001068388,0.0001296978,0.0003187885,0.005834271],"genre_scores_gemma":[0.3508437,0.0006421711,0.6409717,0.0001551483,0.0001049952,0.0005114062,0.0002783688,0.0002269542,0.006265533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01161663,"threshold_uncertainty_score":0.02309805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1833085812546163,"score_gpt":0.3762783758808916,"score_spread":0.1929697946262754,"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."}}