{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"2fec6a3f013b","filters":{"venue":"EURO Journal on Transportation and Logistics"}},"results":[{"id":"W1974861471","doi":"10.1007/s13676-012-0005-x","title":"Districting for routing with stochastic customers","year":2012,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"National University of Defense Technology; National Natural Science Foundation of China","keywords":"Heuristic; Mathematical optimization; Routing (electronic design automation); Vehicle routing problem; Computer science; Compact space; Operations research; Mathematics","authors":[{"name":"Hongtao Lei","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Bo Guo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02845152547853514,"gpt":0.2688076632308992,"spread":0.2403561377523641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006841808,0.0005250866,0.0009836593,0.0004603868,0.0005091926,0.0008550143,0.001153478,0.0008600578,0.006315753],"category_scores_gemma":[0.002025704,0.0004241117,0.0009046506,0.001203013,0.0007266069,0.001001927,0.001025681,0.001134295,0.0004852125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001034189,"about_ca_system_score_gemma":0.001060599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002937652,"about_ca_topic_score_gemma":0.003596741,"domain_scores_codex":[0.9993641,0.0002721116,0.00002139395,0.0001025182,0.0001412263,0.00009871691],"domain_scores_gemma":[0.9994133,0.0003194141,0.00008921814,0.00005542613,0.00006560302,0.00005702891],"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.00002380287,0.00001587916,0.0002114291,0.00004852433,0.000009086115,0.00005430136,0.00003120656,0.9452326,0.0006708185,0.04266004,0.0005648524,0.01047748],"study_design_scores_gemma":[0.00001096256,0.00005483795,0.0001052121,0.00000730884,0.000005046065,0.00004961643,0.00002099089,0.9603302,0.0003911736,0.03598642,0.003028434,0.000009856528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02758525,0.0003096003,0.9667411,0.0001845364,0.00003524742,0.00007112289,0.0001439723,0.0001324574,0.004796752],"genre_scores_gemma":[0.708949,0.0009112069,0.2799093,0.0001152816,0.00007004081,0.000287301,0.0004482921,0.0001588439,0.009150773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006315753,"threshold_uncertainty_score":0.02112836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2225208082","doi":"10.1007/s13676-016-0101-4","title":"The vehicle routing problem with hard time windows and stochastic service times","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Probabilistic logic; Set (abstract data type); Stochastic dominance; Computer science; Service (business); Dimension (graph theory); Resource constraints; Routing (electronic design automation); Mathematics; Distributed computing; Artificial intelligence; Economics","authors":[{"name":"Fausto Errico","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Walter Rei","is_ca":true},{"name":"Louis Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01452917871732855,"gpt":0.2227213024743448,"spread":0.2081921237570163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532825,0.001636607,0.001528579,0.0006083113,0.0006627214,0.001923268,0.001882053,0.002021326,0.00364431],"category_scores_gemma":[0.005007684,0.0009713318,0.001335791,0.001424959,0.001151826,0.002902066,0.001246798,0.002015777,0.0003685601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0015358,"about_ca_system_score_gemma":0.001767637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005162258,"about_ca_topic_score_gemma":0.003987554,"domain_scores_codex":[0.9981166,0.0006897362,0.00007459481,0.000480777,0.0003063606,0.0003318651],"domain_scores_gemma":[0.9971786,0.002023251,0.0003655676,0.0001169673,0.000135469,0.0001801982],"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.00007476057,0.00004401813,0.0003125316,0.00008829772,0.00004012723,0.0001381046,0.00003883538,0.9287358,0.0008640692,0.05876581,0.0008924964,0.01000519],"study_design_scores_gemma":[0.00002571595,0.0000458317,0.0001616054,0.000007193646,0.00001530457,0.00007171928,0.00002561674,0.9519511,0.000498721,0.04597273,0.001209765,0.00001475033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05642078,0.0005139536,0.9365079,0.0007813402,0.0001122389,0.000106312,0.0004076843,0.0001664615,0.004983294],"genre_scores_gemma":[0.7731043,0.001170647,0.2095608,0.0003101253,0.0003475359,0.0004020609,0.0007781856,0.0002320137,0.01409433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005162258,"threshold_uncertainty_score":0.01219147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116517820","doi":"10.1007/s13676-013-0020-6","title":"Vehicle routing: historical perspective and recent contributions","year":2013,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Perspective (graphical); Vehicle routing problem; Set (abstract data type); Routing (electronic design automation); Computer science; Operations research; Engineering; Management science; Artificial intelligence; Computer network","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"Paolo Toth","is_ca":false},{"name":"Daniele Vigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02371556260648799,"gpt":0.267855410196206,"spread":0.244139847589718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389896,0.0009747638,0.0006216926,0.003184658,0.0006816224,0.002644482,0.001103814,0.001183418,0.00399649],"category_scores_gemma":[0.002363187,0.0005298907,0.0003975427,0.007660422,0.001074766,0.004115888,0.001134922,0.002257232,0.002037987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290213,"about_ca_system_score_gemma":0.0008825521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001515701,"about_ca_topic_score_gemma":0.001115628,"domain_scores_codex":[0.9994795,0.0001166488,0.00005116645,0.0001982212,0.0001121419,0.00004246754],"domain_scores_gemma":[0.9988984,0.0004954808,0.0001358415,0.00006248227,0.0003363725,0.00007142317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001682603,0.0001201145,0.002196315,0.00741353,0.0000941399,0.0004258391,0.0003516991,0.00918895,0.00079863,0.1735676,0.04590656,0.7597684],"study_design_scores_gemma":[0.000006469481,0.00009351627,0.001738842,0.002044775,0.00007619703,0.0009879821,0.0002555824,0.001844518,0.0004318626,0.03399914,0.9584798,0.00004135726],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.002879638,0.9579096,0.00834158,0.002854954,0.00195736,0.00001613044,0.0002464705,0.00005331813,0.025741],"genre_scores_gemma":[0.02736761,0.9588977,0.004850552,0.0007820164,0.003816709,0.00002298735,0.0003753827,0.00003465555,0.003852377],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.00399649,"threshold_uncertainty_score":0.01336962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990106667","doi":"10.1007/s13676-012-0007-8","title":"A note on logit choices in strategy transit assignment","year":2012,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Logit; Transit (satellite); Computation; Mathematical optimization; Computer science; Representation (politics); Tree (set theory); Path (computing); Sensitivity (control systems); Centroid; Mixed logit; Operations research; Public transport; Logistic regression; Mathematics; Algorithm; Transport engineering; Engineering; Artificial intelligence; Machine learning; Combinatorics; Computer network","authors":[{"name":"Michaël Florian","is_ca":true},{"name":"Isabelle Constantin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05427746854326112,"gpt":0.3282431087095666,"spread":0.2739656401663055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007163236,0.001259031,0.001112281,0.001457126,0.001357357,0.003189319,0.002378624,0.003181869,0.01342041],"category_scores_gemma":[0.0291167,0.000776834,0.002376286,0.003735204,0.005973016,0.009194241,0.00336716,0.007010733,0.00160097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002828856,"about_ca_system_score_gemma":0.001388901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00896857,"about_ca_topic_score_gemma":0.005963847,"domain_scores_codex":[0.9939904,0.003941441,0.0002219874,0.0006503828,0.000932767,0.0002631237],"domain_scores_gemma":[0.982267,0.01526337,0.0005563328,0.0009503425,0.0007122363,0.0002507488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005874689,0.00003805161,0.0007961993,0.0001131819,0.00003124543,0.0001625167,0.00025257,0.05290151,0.000278043,0.9148214,0.006323809,0.02422266],"study_design_scores_gemma":[0.00002865127,0.00005297066,0.0003875479,0.0000755037,0.00001844788,0.00008440705,0.00005244103,0.1118288,0.0004056363,0.8639595,0.02305093,0.00005503787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008564589,0.002880516,0.9414475,0.01296305,0.0007474846,0.00008821722,0.0002124087,0.0001508592,0.03294534],"genre_scores_gemma":[0.4376475,0.01017774,0.5066152,0.005655458,0.003517651,0.0006856169,0.0002904599,0.0005212164,0.03488925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01342041,"threshold_uncertainty_score":0.04489571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943778955","doi":"10.1016/j.ejtl.2020.100004","title":"A tutorial on recursive models for analyzing and predicting path choice behavior","year":2020,"lang":"en","type":"preprint","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intuition; Computer science; Path (computing); Discrete choice; Inverse; Theoretical computer science; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Cognitive science","authors":[{"name":"Maëlle Zimmermann","is_ca":true},{"name":"Emma Frejinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08301966753873334,"gpt":0.3385868799717806,"spread":0.2555672124330472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656343,0.002601885,0.001398391,0.001524585,0.0004011212,0.001824783,0.001889222,0.00237653,0.01958942],"category_scores_gemma":[0.007080313,0.0009555889,0.002419601,0.002622859,0.0008635144,0.00340135,0.001265813,0.003909658,0.005535558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078026,"about_ca_system_score_gemma":0.001117369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00454351,"about_ca_topic_score_gemma":0.004243706,"domain_scores_codex":[0.9992684,0.0003330551,0.00005564842,0.0001369563,0.0001527491,0.00005328083],"domain_scores_gemma":[0.9974018,0.002100685,0.0001331794,0.0001595627,0.0001468012,0.00005788902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004282282,0.0001604831,0.001584147,0.001202288,0.000185528,0.0003462476,0.0003454295,0.157879,0.001950847,0.6409087,0.05506811,0.1403264],"study_design_scores_gemma":[0.00001604579,0.00008391647,0.0009050831,0.0004351265,0.00008245764,0.0003293349,0.00005763618,0.3361216,0.0004514083,0.5415902,0.1198559,0.00007124474],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001512653,0.02153484,0.9597862,0.001739169,0.0005109706,0.00007183229,0.001228449,0.0007065106,0.01290942],"genre_scores_gemma":[0.1049987,0.08819337,0.7645223,0.002602927,0.003859163,0.001556955,0.004892302,0.0009926901,0.02838168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01958942,"threshold_uncertainty_score":0.06553316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402827990","doi":"10.1016/j.ejtl.2024.100146","title":"Stability metrics for a maritime inventory routing problem under sailing time uncertainty","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Routing (electronic design automation); Stability (learning theory); Vehicle routing problem; Operations research; Computer science; Marine engineering; Environmental science; Engineering; Computer network; Machine learning","authors":[{"name":"Homayoun Shaabani","is_ca":false},{"name":"Lars Magnus Hvattum","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Arild Hoff","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04209613403359662,"gpt":0.2817609257848414,"spread":0.2396647917512447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003657825,0.001712937,0.001115668,0.001988366,0.0006622757,0.001691574,0.0009564538,0.001115237,0.001212574],"category_scores_gemma":[0.009415747,0.0004620494,0.001158922,0.00139956,0.001169207,0.001773546,0.001107795,0.001271041,0.00008812081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001946508,"about_ca_system_score_gemma":0.001175791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004171205,"about_ca_topic_score_gemma":0.001410121,"domain_scores_codex":[0.9988434,0.0006020062,0.00005991468,0.000146739,0.0002055863,0.000142267],"domain_scores_gemma":[0.9921513,0.006048338,0.0009359071,0.0001147643,0.000500472,0.0002493787],"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.00005673019,0.00002545111,0.0005560529,0.00006045483,0.0000435067,0.00004620831,0.00003547914,0.9877942,0.0006878776,0.006660359,0.0001889458,0.003844735],"study_design_scores_gemma":[0.000005107804,0.0000535388,0.0002183984,0.000007276587,0.00001260797,0.00001498186,0.00001881033,0.9948171,0.00022616,0.004524116,0.00009560302,0.000006227503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.288706,0.002638377,0.701681,0.0009064518,0.00007431085,0.0001638942,0.0003632444,0.0001850306,0.005281663],"genre_scores_gemma":[0.9464513,0.0009039863,0.05111794,0.00003926271,0.00004751033,0.0001248213,0.0002374011,0.0000659849,0.001011874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004171205,"threshold_uncertainty_score":0.01934463,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409885303","doi":"10.1016/j.ejtl.2025.100157","title":"50 years of Operations Research for the tactical planning of consolidation-based freight transportation","year":2025,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Université de Montréal","keywords":"Consolidation (business); Transport engineering; Operations research; Engineering; Business; Finance","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09736906072891235,"gpt":0.3346004612744917,"spread":0.2372314005455794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008009519,0.002087718,0.001732306,0.004490656,0.001792673,0.006660042,0.001822624,0.002767663,0.02182898],"category_scores_gemma":[0.01757827,0.001211417,0.002082108,0.01134043,0.004282997,0.006789215,0.00382434,0.005661744,0.003987845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007813016,"about_ca_system_score_gemma":0.006371873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01380262,"about_ca_topic_score_gemma":0.008944889,"domain_scores_codex":[0.9950336,0.001634763,0.000450933,0.0006863561,0.001902287,0.0002920285],"domain_scores_gemma":[0.9882395,0.00721442,0.0008019949,0.0009682627,0.002385216,0.0003904745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001352573,0.0002113158,0.001780025,0.001268554,0.000147887,0.0001322045,0.0005238734,0.05711933,0.0008178496,0.5279677,0.0245609,0.3853351],"study_design_scores_gemma":[0.00005073347,0.000340946,0.002922355,0.003296423,0.0001016234,0.0002188611,0.001009141,0.06067007,0.001050858,0.2301015,0.700068,0.0001695015],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.01766953,0.2037179,0.4983925,0.03184874,0.006114389,0.0005092287,0.001485087,0.000558301,0.2397043],"genre_scores_gemma":[0.2837154,0.3561397,0.2940974,0.007501706,0.006509102,0.0009072562,0.002787202,0.0007023193,0.04764004],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.02182898,"threshold_uncertainty_score":0.07302523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3108778051","doi":"10.1016/j.ejtl.2020.100024","title":"Introduction to the special issue on combining optimization and machine learning: Application in vehicle routing, network design and crew scheduling","year":2020,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Crew; Computer science; Crew scheduling; Scheduling (production processes); Routing (electronic design automation); Engineering; Embedded system; Aeronautics; Operations management","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02748217703064264,"gpt":0.2509191413029552,"spread":0.2234369642723125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001970324,0.002099518,0.002593007,0.003271267,0.000841752,0.004132914,0.001713967,0.002882243,0.04521837],"category_scores_gemma":[0.004854175,0.0006990873,0.001934213,0.003331605,0.001011585,0.003263369,0.001522301,0.005663333,0.02335609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009133527,"about_ca_system_score_gemma":0.001123025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009327391,"about_ca_topic_score_gemma":0.002133827,"domain_scores_codex":[0.9988066,0.0002078113,0.0001314717,0.0003691303,0.0004071748,0.00007786119],"domain_scores_gemma":[0.9959204,0.001921934,0.0002209352,0.0002901635,0.001165827,0.0004806597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003948565,0.0000925723,0.0002197459,0.0006398411,0.00006722958,0.00009204683,0.00002091054,0.001481134,0.0006926211,0.006067533,0.8853824,0.1052046],"study_design_scores_gemma":[0.00001238052,0.00009686597,0.000865656,0.0003538825,0.00004632395,0.000296976,0.00002418042,0.004161607,0.0003444611,0.01163524,0.9821253,0.00003698407],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0009014208,0.1504131,0.06497415,0.02240977,0.7217529,0.0001141947,0.0008574873,0.000583904,0.03799316],"genre_scores_gemma":[0.005355319,0.08506145,0.01903321,0.0112797,0.7651014,0.0001389888,0.001261645,0.00100964,0.1117586],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.04521837,"threshold_uncertainty_score":0.1512706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404633920","doi":"10.1016/j.ejtl.2024.100147","title":"Dynamic rebalancing for Bike-sharing systems under inventory interval and target predictions","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; Transport Canada","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Bike sharing; Interval (graph theory); Environmental science; Computer science; Engineering; Mathematics; Transport engineering","authors":[{"name":"Jiaqi Liang","is_ca":true},{"name":"Maria Clara Martins Silva","is_ca":true},{"name":"Daniel Aloise","is_ca":true},{"name":"Sanjay Dominik Jena","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02521225553554611,"gpt":0.2616514860036814,"spread":0.2364392304681353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000692783,0.0008821405,0.0006987329,0.0003643163,0.0003948582,0.00104427,0.0007342058,0.0006291889,0.001850731],"category_scores_gemma":[0.001832106,0.0003350299,0.0003949288,0.0004000117,0.0003892657,0.001009024,0.0006728454,0.0007422404,0.000152668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008037503,"about_ca_system_score_gemma":0.0009015856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01291884,"about_ca_topic_score_gemma":0.007410035,"domain_scores_codex":[0.9997061,0.00008391627,0.00001299807,0.00005738923,0.00005620402,0.00008333394],"domain_scores_gemma":[0.9992343,0.0004534097,0.0001032739,0.00006907453,0.00008312716,0.00005676321],"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.0000541628,0.00001933095,0.000364472,0.00001509372,0.000007173924,0.00001473435,0.00001291746,0.9952342,0.0006475923,0.0004261776,0.00008220502,0.003122024],"study_design_scores_gemma":[0.000004152949,0.00002358481,0.0002030052,0.000001659527,0.000003062584,0.000004149964,0.00001250195,0.9989929,0.0003472766,0.0003378156,0.00006742332,0.000002523731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6998789,0.0004459402,0.2908519,0.0002506402,0.00005140694,0.0001027668,0.0003879398,0.0007150176,0.007315495],"genre_scores_gemma":[0.9934128,0.00003878642,0.006044238,0.0000104802,0.000003200924,0.00001660153,0.000062361,0.00002179062,0.0003897823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01291884,"threshold_uncertainty_score":0.02568728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3009897573","doi":"10.1016/j.ejtl.2020.100020","title":"Machine learning in airline crew pairing to construct initial clusters for dynamic constraint aggregation","year":2020,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute; Université de Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Solver; Crew; Heuristics; Computer science; Pairing; Sequence (biology); Aggregate (composite); Reduction (mathematics); Constraint (computer-aided design); Baseline (sea); Mathematical optimization; Set (abstract data type); Mathematics; Engineering","authors":[{"name":"Yassine Yaakoubi","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"Simon Lacoste-Julien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03298730818220549,"gpt":0.2884905000993498,"spread":0.2555031919171443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001375799,0.00126371,0.001212055,0.00090734,0.0005781455,0.001274361,0.001422653,0.00127798,0.006663441],"category_scores_gemma":[0.006510096,0.000779515,0.001074163,0.001303392,0.0008647343,0.001473722,0.001211066,0.001971386,0.0007578604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00162544,"about_ca_system_score_gemma":0.002586561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01311337,"about_ca_topic_score_gemma":0.01569868,"domain_scores_codex":[0.9991061,0.0002970097,0.00004784765,0.0002529439,0.0001466297,0.0001494651],"domain_scores_gemma":[0.9967889,0.002206554,0.0002524509,0.0002675256,0.0003517766,0.0001329055],"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.0000478414,0.00005550727,0.0007698822,0.00005328611,0.00002511957,0.00003674402,0.00004507926,0.9673692,0.0004323316,0.004070986,0.001397679,0.02569622],"study_design_scores_gemma":[0.00001137416,0.0000124537,0.00009493138,0.00000623034,0.000003432831,0.000006271156,0.00001382795,0.9964012,0.0002768425,0.002677788,0.0004932343,0.000002388088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09157637,0.0005500996,0.895721,0.0006617894,0.00009629479,0.0002445743,0.0005026372,0.001806378,0.008840881],"genre_scores_gemma":[0.5539944,0.0001670219,0.4403627,0.0003120299,0.00006449482,0.0003565591,0.001030041,0.0003280115,0.003384731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01311337,"threshold_uncertainty_score":0.02607411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402615264","doi":"10.1016/j.ejtl.2024.100143","title":"A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network","year":2024,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Metaheuristic; Synchronization (alternating current); Computer science; Arrival time; Travel time; Time synchronization; Routing (electronic design automation); Fleet management; Real-time computing; Engineering; Transport engineering; Computer network; Artificial intelligence","authors":[{"name":"Fernando O. Guillen Reyes","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01312235701810524,"gpt":0.2496270787101207,"spread":0.2365047216920155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808373,0.001358265,0.0009947527,0.001135149,0.0004972334,0.00120082,0.001583395,0.002012871,0.002718696],"category_scores_gemma":[0.001644373,0.000575036,0.00165309,0.001315209,0.0005506481,0.001106948,0.0009291056,0.001611763,0.0003051318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001312058,"about_ca_system_score_gemma":0.001923229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00505666,"about_ca_topic_score_gemma":0.004206041,"domain_scores_codex":[0.9995251,0.0001949181,0.00002583949,0.00009193067,0.00008241698,0.0000797251],"domain_scores_gemma":[0.9991382,0.0005492768,0.0001078016,0.00005459662,0.00007677266,0.0000731949],"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.000044757,0.00006692288,0.0002039553,0.00005916195,0.00005536981,0.00005875711,0.00002125267,0.9768197,0.0006253496,0.007388079,0.0008342707,0.01382241],"study_design_scores_gemma":[0.00002549768,0.00004696679,0.00006731411,0.00001225679,0.00001858248,0.00001937694,0.00001468293,0.9954921,0.0002447015,0.002980036,0.001073593,0.000004808358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05507526,0.0009379903,0.9329816,0.0006694417,0.0001994017,0.0002442707,0.0003734416,0.0005431607,0.00897539],"genre_scores_gemma":[0.4271883,0.0007154386,0.5628966,0.0003761899,0.0001153078,0.0006475783,0.0007560628,0.0002068004,0.007097759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00505666,"threshold_uncertainty_score":0.01005441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413332685","doi":"10.1016/j.ejtl.2025.100162","title":"Optimal departure time choices as quantiles and expectiles of the travel time distribution","year":2025,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Quantile; Travel time; Distribution (mathematics); Environmental science; Computer science; Statistics; Operations research; Econometrics; Engineering; Mathematics; Transport engineering","authors":[{"name":"Maria Osipenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0123767107567468,"gpt":0.279565462662296,"spread":0.2671887519055492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003890827,0.0005906547,0.0005200818,0.0008196228,0.0002453885,0.001544884,0.001113943,0.0006703138,0.004056021],"category_scores_gemma":[0.01538904,0.0003355068,0.0009338182,0.0009220268,0.0008227893,0.001717554,0.0007540322,0.001531691,0.0004456296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001369736,"about_ca_system_score_gemma":0.0007216253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002441406,"about_ca_topic_score_gemma":0.001971177,"domain_scores_codex":[0.9987288,0.0005944798,0.00005018973,0.0002058892,0.0002138012,0.0002067725],"domain_scores_gemma":[0.9940687,0.003590435,0.0008851637,0.0007662784,0.0004278003,0.0002615655],"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.000629908,0.000199025,0.02129151,0.0001118427,0.0000726872,0.0001718482,0.0004125152,0.6906918,0.00360718,0.2500222,0.001625721,0.03116377],"study_design_scores_gemma":[0.00005169721,0.0002065836,0.01160784,0.00004167447,0.00003092863,0.0001028203,0.0003582314,0.8857743,0.001914056,0.09853584,0.001310862,0.00006507377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4738854,0.0001040983,0.5185778,0.0003142884,0.00001655338,0.00009656961,0.0007767905,0.0001779929,0.006050534],"genre_scores_gemma":[0.9705512,0.00009436248,0.02701086,0.00002850833,0.000006359249,0.00009230043,0.0003511058,0.00004772836,0.001817652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004056021,"threshold_uncertainty_score":0.02057689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}