{"id":"W3188442502","doi":"10.1016/j.ejor.2021.07.052","title":"An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Belgian Federal Science Policy Office","keywords":"Computer science; Mathematical optimization; Solver; Bilevel optimization; Heuristic; Network planning and design; Neighbourhood (mathematics); Integer programming; Operations research; Service (business); Algorithm; Optimization problem; Mathematics; Economics; Artificial intelligence","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.00171376,0.001283959,0.002444246,0.001219322,0.00100636,0.001699425,0.00259339,0.002944713,0.00596038],"category_scores_gemma":[0.004072344,0.001486903,0.00149236,0.001382753,0.0009030518,0.0013763,0.002014537,0.002154069,0.0008463032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371105,"about_ca_system_score_gemma":0.003638354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01405655,"about_ca_topic_score_gemma":0.01122396,"domain_scores_codex":[0.9992025,0.0003216633,0.00003422248,0.0001137657,0.000194116,0.000133758],"domain_scores_gemma":[0.9984916,0.0009815982,0.00007845423,0.00007163921,0.0002826113,0.00009404949],"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.00007045972,0.00008019136,0.0001731626,0.00008274811,0.00002537244,0.00005110463,0.00005562735,0.9610483,0.000700838,0.005863027,0.0007734264,0.03107571],"study_design_scores_gemma":[0.00001687786,0.0000174278,0.00002177456,0.000004244944,0.000004837589,0.000006170729,0.000006538643,0.9983569,0.0001056434,0.001249863,0.000205352,0.000004456132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006792293,0.00008226477,0.9898812,0.00009265645,0.0000347982,0.0001133084,0.00004416749,0.0002596318,0.002699603],"genre_scores_gemma":[0.2160464,0.0001255309,0.7798139,0.0001099835,0.00004205371,0.0006369613,0.0001859754,0.0001504721,0.002888596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01405655,"threshold_uncertainty_score":0.02794951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1614804341083736,"score_gpt":0.4214360052813088,"score_spread":0.2599555711729352,"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."}}