{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006650491,0.0000631421,0.0001037962,0.00009234179,0.0009395552,0.0003698034,0.000147054,0.00001820089,0.00004489532],"category_scores_gemma":[0.0004271299,0.00005866123,0.00002491872,0.0003601548,0.00007098469,0.0004664373,0.00001109769,0.0002220202,0.00000303876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004398579,"about_ca_system_score_gemma":0.0009417322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001406177,"about_ca_topic_score_gemma":0.00003386345,"domain_scores_codex":[0.9969603,0.001769441,0.0002924469,0.0001493949,0.0006101994,0.0002182166],"domain_scores_gemma":[0.9963079,0.0005864452,0.00008426932,0.00006134468,0.002790397,0.0001696075],"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.00005006127,0.00004203264,0.00009629775,0.000006263725,0.00001700277,0.00006703198,0.009574198,0.9769752,0.0003486593,0.006337504,0.0006825338,0.005803203],"study_design_scores_gemma":[0.0007014429,0.0001715566,0.0009425328,0.00007364322,0.000009406764,0.00001029281,0.001616878,0.9930944,0.00007497016,0.0006275373,0.002589177,0.00008820109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007682956,0.0001673042,0.9896817,0.001208518,0.00006871171,0.0001710941,0.00001963019,0.000007843254,0.0009922602],"genre_scores_gemma":[0.2980055,0.0001012063,0.699598,0.0003308917,0.0006039175,0.000004101531,0.00004178811,0.0000189824,0.001295589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2903225,"threshold_uncertainty_score":0.7226394,"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."}}