{"meta":{"query_hash":"2fec6a3f013b","filters":{"venue":"EURO Journal on Transportation and Logistics"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2fec6a3f013b","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028451525478535144,"score_gpt":0.2688076632308992,"score_spread":0.24035613775236409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974861471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02758525,0.0003096003,0.96674114,0.00018453645,0.000035247424,0.000071122886,0.00014397228,0.0001324574,0.004796752],"genre_scores_gemma":[0.70894897,0.00091120694,0.2799093,0.000115281575,0.000070040805,0.00028730097,0.00044829212,0.00015884388,0.009150773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.00027211162,0.00002139395,0.00010251824,0.00014122632,0.00009871691],"domain_scores_gemma":[0.99941325,0.0003194141,0.00008921814,0.00005542613,0.00006560302,0.000057028912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006841808,0.0005250866,0.0009836593,0.00046038683,0.00050919264,0.00085501425,0.0011534777,0.00086005783,0.0063157533],"category_scores_gemma":[0.0020257044,0.0004241117,0.0009046506,0.0012030125,0.00072660693,0.0010019266,0.0010256814,0.0011342949,0.0004852125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023802866,0.000015879157,0.00021142913,0.00004852433,0.000009086115,0.000054301356,0.000031206564,0.94523257,0.0006708185,0.042660035,0.0005648524,0.010477483],"study_design_scores_gemma":[0.000010962559,0.000054837947,0.00010521212,0.00000730884,0.0000050460653,0.00004961643,0.000020990894,0.9603302,0.00039117355,0.035986416,0.0030284335,0.000009856528],"about_ca_topic_score_codex":0.0029376517,"about_ca_topic_score_gemma":0.0035967405,"teacher_disagreement_score":0.0063157533,"about_ca_system_score_codex":0.0010341894,"about_ca_system_score_gemma":0.0010605995,"threshold_uncertainty_score":0.021128356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05427746854326112,"score_gpt":0.3282431087095666,"score_spread":0.2739656401663055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990106667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008564589,0.0028805155,0.9414475,0.012963049,0.00074748456,0.00008821722,0.00021240866,0.00015085921,0.032945342],"genre_scores_gemma":[0.43764752,0.010177745,0.50661516,0.0056554577,0.0035176505,0.00068561686,0.0002904599,0.00052121637,0.03488925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939904,0.0039414414,0.00022198736,0.00065038283,0.000932767,0.00026312374],"domain_scores_gemma":[0.98226696,0.015263368,0.0005563328,0.00095034245,0.00071223633,0.0002507488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071632364,0.0012590315,0.001112281,0.0014571263,0.0013573574,0.0031893193,0.0023786237,0.0031818692,0.013420406],"category_scores_gemma":[0.0291167,0.000776834,0.002376286,0.0037352035,0.005973016,0.009194241,0.0033671597,0.0070107332,0.0016009697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058746886,0.000038051614,0.00079619925,0.00011318187,0.000031245432,0.00016251674,0.00025257003,0.05290151,0.00027804304,0.91482145,0.006323809,0.024222655],"study_design_scores_gemma":[0.000028651275,0.000052970656,0.00038754786,0.0000755037,0.000018447881,0.000084407046,0.000052441028,0.11182884,0.00040563633,0.8639595,0.023050932,0.000055037868],"about_ca_topic_score_codex":0.00896857,"about_ca_topic_score_gemma":0.005963847,"teacher_disagreement_score":0.013420406,"about_ca_system_score_codex":0.0028288565,"about_ca_system_score_gemma":0.0013889009,"threshold_uncertainty_score":0.04489571},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023715562606487994,"score_gpt":0.26785541019620596,"score_spread":0.24413984758971796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116517820","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028796378,0.95790964,0.00834158,0.0028549538,0.00195736,0.000016130443,0.00024647047,0.000053318126,0.025741003],"genre_scores_gemma":[0.02736761,0.9588977,0.0048505524,0.00078201643,0.003816709,0.000022987348,0.00037538275,0.000034655553,0.0038523767],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994795,0.00011664877,0.000051166455,0.00019822121,0.00011214194,0.000042467538],"domain_scores_gemma":[0.9988984,0.0004954808,0.00013584146,0.00006248227,0.0003363725,0.00007142317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013898959,0.0009747638,0.00062169257,0.003184658,0.0006816224,0.0026444823,0.001103814,0.0011834183,0.0039964896],"category_scores_gemma":[0.002363187,0.0005298907,0.0003975427,0.0076604215,0.0010747659,0.0041158884,0.0011349217,0.0022572319,0.0020379866],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016826032,0.000120114535,0.0021963154,0.0074135303,0.0000941399,0.00042583913,0.0003516991,0.00918895,0.00079863,0.17356756,0.045906562,0.7597684],"study_design_scores_gemma":[0.000006469481,0.00009351627,0.0017388419,0.0020447748,0.00007619703,0.0009879821,0.00025558236,0.0018445179,0.00043186263,0.03399914,0.95847976,0.00004135726],"about_ca_topic_score_codex":0.0015157011,"about_ca_topic_score_gemma":0.0011156279,"teacher_disagreement_score":0.0039964896,"about_ca_system_score_codex":0.0012902127,"about_ca_system_score_gemma":0.00088255206,"threshold_uncertainty_score":0.01336962},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014529178717328553,"score_gpt":0.22272130247434482,"score_spread":0.20819212375701626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225208082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056420777,0.0005139536,0.9365079,0.0007813402,0.0001122389,0.00010631197,0.0004076843,0.00016646151,0.004983294],"genre_scores_gemma":[0.7731043,0.0011706469,0.20956078,0.0003101253,0.00034753594,0.00040206095,0.00077818555,0.00023201366,0.014094327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981166,0.0006897362,0.000074594805,0.000480777,0.00030636063,0.0003318651],"domain_scores_gemma":[0.99717855,0.0020232515,0.00036556757,0.00011696728,0.00013546902,0.00018019823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532825,0.001636607,0.001528579,0.00060831127,0.0006627214,0.0019232678,0.0018820532,0.002021326,0.0036443104],"category_scores_gemma":[0.005007684,0.00097133184,0.0013357907,0.0014249593,0.0011518258,0.0029020663,0.0012467982,0.0020157767,0.00036856014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074760566,0.000044018132,0.00031253163,0.00008829772,0.00004012723,0.0001381046,0.000038835384,0.9287358,0.0008640692,0.058765806,0.00089249643,0.010005185],"study_design_scores_gemma":[0.000025715952,0.000045831704,0.00016160539,0.0000071936456,0.00001530457,0.00007171928,0.000025616744,0.95195115,0.00049872097,0.045972727,0.0012097645,0.000014750327],"about_ca_topic_score_codex":0.0051622577,"about_ca_topic_score_gemma":0.003987554,"teacher_disagreement_score":0.0051622577,"about_ca_system_score_codex":0.0015357996,"about_ca_system_score_gemma":0.0017676365,"threshold_uncertainty_score":0.012191474},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08301966753873334,"score_gpt":0.33858687997178055,"score_spread":0.2555672124330472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943778955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015126534,0.021534842,0.9597862,0.0017391691,0.0005109706,0.00007183229,0.0012284486,0.00070651056,0.012909415],"genre_scores_gemma":[0.10499866,0.08819337,0.76452225,0.0026029274,0.003859163,0.0015569546,0.004892302,0.0009926901,0.028381675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926835,0.00033305507,0.00005564842,0.00013695628,0.00015274905,0.00005328083],"domain_scores_gemma":[0.99740183,0.0021006854,0.00013317936,0.00015956273,0.00014680119,0.00005788902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656343,0.0026018845,0.0013983906,0.0015245846,0.00040112121,0.0018247832,0.0018892222,0.00237653,0.019589419],"category_scores_gemma":[0.007080313,0.00095558894,0.0024196012,0.0026228589,0.00086351443,0.00340135,0.0012658125,0.0039096577,0.0055355583],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042822816,0.00016048306,0.0015841469,0.0012022877,0.00018552803,0.0003462476,0.00034542952,0.15787898,0.0019508469,0.6409087,0.05506811,0.14032643],"study_design_scores_gemma":[0.000016045795,0.00008391647,0.0009050831,0.0004351265,0.00008245764,0.00032933493,0.00005763618,0.3361216,0.00045140833,0.54159015,0.11985593,0.000071244736],"about_ca_topic_score_codex":0.00454351,"about_ca_topic_score_gemma":0.0042437064,"teacher_disagreement_score":0.019589419,"about_ca_system_score_codex":0.0010780263,"about_ca_system_score_gemma":0.0011173689,"threshold_uncertainty_score":0.06553316},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.032987308182205494,"score_gpt":0.28849050009934984,"score_spread":0.2555031919171443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009897573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09157637,0.00055009965,0.895721,0.00066178944,0.00009629479,0.00024457433,0.0005026372,0.0018063775,0.008840881],"genre_scores_gemma":[0.55399436,0.00016702189,0.44036266,0.00031202994,0.000064494816,0.00035655912,0.0010300411,0.00032801152,0.0033847315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991061,0.00029700968,0.000047847647,0.00025294392,0.00014662968,0.0001494651],"domain_scores_gemma":[0.99678886,0.0022065544,0.00025245087,0.00026752564,0.00035177657,0.00013290548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013757993,0.0012637097,0.0012120549,0.00090734,0.0005781455,0.0012743608,0.001422653,0.00127798,0.0066634407],"category_scores_gemma":[0.0065100957,0.00077951496,0.001074163,0.001303392,0.0008647343,0.0014737219,0.0012110658,0.0019713861,0.00075786037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047841404,0.000055507266,0.0007698822,0.000053286112,0.000025119572,0.000036744015,0.000045079258,0.9673692,0.00043233164,0.0040709856,0.0013976789,0.025696224],"study_design_scores_gemma":[0.000011374163,0.0000124537,0.000094931376,0.0000062303397,0.0000034328311,0.0000062711556,0.000013827952,0.9964012,0.00027684247,0.0026777878,0.0004932343,0.0000023880884],"about_ca_topic_score_codex":0.013113371,"about_ca_topic_score_gemma":0.015698675,"teacher_disagreement_score":0.013113371,"about_ca_system_score_codex":0.0016254399,"about_ca_system_score_gemma":0.0025865606,"threshold_uncertainty_score":0.026074111},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02748217703064264,"score_gpt":0.2509191413029552,"score_spread":0.22343696427231252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108778051","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090142083,0.15041314,0.06497415,0.022409767,0.7217529,0.000114194656,0.00085748726,0.000583904,0.037993163],"genre_scores_gemma":[0.0053553195,0.08506145,0.01903321,0.011279703,0.7651014,0.00013898883,0.001261645,0.0010096404,0.11175862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988066,0.00020781129,0.00013147166,0.00036913026,0.0004071748,0.00007786119],"domain_scores_gemma":[0.9959204,0.0019219341,0.00022093518,0.00029016353,0.001165827,0.00048065974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019703235,0.0020995182,0.0025930074,0.003271267,0.000841752,0.0041329144,0.0017139667,0.002882243,0.045218375],"category_scores_gemma":[0.0048541753,0.0006990873,0.0019342131,0.0033316053,0.0010115847,0.003263369,0.0015223005,0.0056633335,0.02335609],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039485647,0.0000925723,0.0002197459,0.00063984114,0.00006722958,0.00009204683,0.000020910538,0.0014811335,0.0006926211,0.0060675326,0.88538235,0.10520456],"study_design_scores_gemma":[0.000012380517,0.000096865966,0.00086565595,0.00035388247,0.000046323952,0.000296976,0.00002418042,0.0041616065,0.0003444611,0.011635239,0.9821253,0.000036984067],"about_ca_topic_score_codex":0.00093273906,"about_ca_topic_score_gemma":0.0021338267,"teacher_disagreement_score":0.045218375,"about_ca_system_score_codex":0.0009133527,"about_ca_system_score_gemma":0.0011230251,"threshold_uncertainty_score":0.15127057},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013122357018105244,"score_gpt":0.24962707871012074,"score_spread":0.2365047216920155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402615264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05507526,0.0009379903,0.93298155,0.0006694417,0.00019940174,0.00024427066,0.00037344158,0.0005431607,0.00897539],"genre_scores_gemma":[0.42718828,0.00071543857,0.5628966,0.00037618988,0.0001153078,0.0006475783,0.0007560628,0.00020680038,0.0070977593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.00019491815,0.000025839494,0.00009193067,0.00008241698,0.0000797251],"domain_scores_gemma":[0.99913824,0.00054927677,0.000107801636,0.000054596625,0.00007677266,0.000073194904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808373,0.0013582653,0.0009947527,0.0011351488,0.00049723336,0.0012008202,0.0015833947,0.0020128712,0.0027186961],"category_scores_gemma":[0.0016443728,0.00057503604,0.0016530905,0.0013152086,0.0005506481,0.0011069482,0.00092910556,0.0016117631,0.00030513183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044757,0.00006692288,0.00020395531,0.000059161954,0.00005536981,0.000058757112,0.00002125267,0.9768197,0.0006253496,0.007388079,0.0008342707,0.013822409],"study_design_scores_gemma":[0.000025497682,0.00004696679,0.00006731411,0.000012256786,0.000018582485,0.000019376943,0.000014682932,0.9954921,0.00024470154,0.002980036,0.0010735928,0.0000048083575],"about_ca_topic_score_codex":0.00505666,"about_ca_topic_score_gemma":0.004206041,"teacher_disagreement_score":0.00505666,"about_ca_system_score_codex":0.0013120577,"about_ca_system_score_gemma":0.0019232286,"threshold_uncertainty_score":0.0100544095},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04209613403359662,"score_gpt":0.28176092578484135,"score_spread":0.23966479175124472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402827990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28870597,0.002638377,0.701681,0.0009064518,0.000074310854,0.00016389423,0.00036324435,0.00018503057,0.0052816626],"genre_scores_gemma":[0.9464513,0.00090398634,0.05111794,0.000039262708,0.00004751033,0.00012482126,0.00023740105,0.0000659849,0.0010118737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884343,0.0006020062,0.000059914677,0.00014673898,0.00020558632,0.00014226702],"domain_scores_gemma":[0.99215126,0.0060483385,0.0009359071,0.000114764254,0.000500472,0.00024937867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036578246,0.0017129366,0.0011156678,0.0019883665,0.0006622757,0.0016915738,0.0009564538,0.0011152369,0.001212574],"category_scores_gemma":[0.009415747,0.0004620494,0.0011589222,0.0013995597,0.0011692067,0.001773546,0.0011077953,0.0012710412,0.00008812081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056730187,0.000025451112,0.0005560529,0.00006045483,0.000043506705,0.00004620831,0.000035479145,0.98779416,0.00068787765,0.0066603585,0.00018894576,0.0038447354],"study_design_scores_gemma":[0.000005107804,0.0000535388,0.0002183984,0.0000072765874,0.000012607972,0.000014981864,0.00001881033,0.9948171,0.00022615997,0.0045241164,0.00009560302,0.0000062275035],"about_ca_topic_score_codex":0.004171205,"about_ca_topic_score_gemma":0.0014101214,"teacher_disagreement_score":0.004171205,"about_ca_system_score_codex":0.0019465078,"about_ca_system_score_gemma":0.0011757911,"threshold_uncertainty_score":0.019344628},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025212255535546114,"score_gpt":0.26165148600368143,"score_spread":0.2364392304681353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404633920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69987893,0.0004459402,0.29085192,0.00025064018,0.000051406936,0.00010276677,0.00038793983,0.00071501755,0.0073154946],"genre_scores_gemma":[0.9934128,0.000038786424,0.0060442383,0.000010480202,0.0000032009239,0.000016601525,0.000062360996,0.000021790622,0.00038978228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997061,0.00008391627,0.000012998067,0.00005738923,0.000056204022,0.000083333936],"domain_scores_gemma":[0.9992343,0.00045340965,0.000103273924,0.00006907453,0.00008312716,0.000056763212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000692783,0.00088214054,0.0006987329,0.00036431628,0.00039485822,0.00104427,0.0007342058,0.0006291889,0.0018507306],"category_scores_gemma":[0.0018321056,0.00033502994,0.0003949288,0.00040001175,0.00038926565,0.0010090243,0.0006728454,0.0007422404,0.00015266801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000541628,0.000019330953,0.00036447204,0.000015093718,0.0000071739237,0.000014734345,0.00001291746,0.9952342,0.0006475923,0.00042617763,0.00008220502,0.0031220245],"study_design_scores_gemma":[0.0000041529493,0.000023584806,0.0002030052,0.0000016595272,0.0000030625838,0.000004149964,0.0000125019515,0.99899286,0.0003472766,0.00033781564,0.00006742332,0.0000025237312],"about_ca_topic_score_codex":0.012918843,"about_ca_topic_score_gemma":0.0074100355,"teacher_disagreement_score":0.012918843,"about_ca_system_score_codex":0.0008037503,"about_ca_system_score_gemma":0.00090158556,"threshold_uncertainty_score":0.025687277},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09736906072891235,"score_gpt":0.3346004612744917,"score_spread":0.23723140054557937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409885303","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017669527,0.20371795,0.49839252,0.03184874,0.0061143893,0.00050922873,0.0014850867,0.00055830105,0.2397043],"genre_scores_gemma":[0.28371543,0.3561397,0.29409736,0.007501706,0.0065091024,0.00090725615,0.0027872024,0.00070231926,0.047640037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950336,0.0016347634,0.00045093297,0.0006863561,0.0019022865,0.0002920285],"domain_scores_gemma":[0.9882395,0.00721442,0.0008019949,0.0009682627,0.0023852163,0.00039047454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008009519,0.0020877179,0.0017323055,0.0044906563,0.0017926729,0.0066600423,0.0018226235,0.002767663,0.021828983],"category_scores_gemma":[0.017578267,0.0012114173,0.0020821076,0.011340427,0.004282997,0.006789215,0.00382434,0.005661744,0.0039878455],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013525732,0.00021131578,0.001780025,0.0012685538,0.00014788701,0.00013220448,0.00052387343,0.05711933,0.0008178496,0.5279677,0.024560902,0.38533515],"study_design_scores_gemma":[0.000050733473,0.00034094596,0.0029223554,0.0032964235,0.000101623395,0.00021886105,0.0010091413,0.06067007,0.0010508582,0.23010151,0.700068,0.00016950151],"about_ca_topic_score_codex":0.013802621,"about_ca_topic_score_gemma":0.008944889,"teacher_disagreement_score":0.021828983,"about_ca_system_score_codex":0.007813016,"about_ca_system_score_gemma":0.0063718734,"threshold_uncertainty_score":0.07302523},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantile; Travel time; Distribution (mathematics); Environmental science; Computer science; Statistics; Operations research; Econometrics; Engineering; Mathematics; Transport engineering","score_opus":0.012376710756746798,"score_gpt":0.27956546266229604,"score_spread":0.26718875190554925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413332685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47388542,0.000104098275,0.51857775,0.00031428842,0.00001655338,0.00009656961,0.0007767905,0.00017799292,0.0060505336],"genre_scores_gemma":[0.9705512,0.000094362484,0.027010856,0.000028508333,0.000006359249,0.00009230043,0.00035110576,0.00004772836,0.0018176525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987288,0.0005944798,0.00005018973,0.0002058892,0.00021380118,0.0002067725],"domain_scores_gemma":[0.99406874,0.0035904355,0.00088516367,0.0007662784,0.00042780032,0.00026156547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003890827,0.0005906547,0.00052008184,0.0008196228,0.00024538845,0.0015448837,0.001113943,0.0006703138,0.004056021],"category_scores_gemma":[0.015389037,0.00033550683,0.00093381817,0.0009220268,0.00082278927,0.0017175538,0.0007540322,0.0015316906,0.00044562964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000629908,0.00019902497,0.021291513,0.00011184272,0.0000726872,0.00017184817,0.00041251522,0.6906918,0.0036071797,0.25002217,0.0016257213,0.031163767],"study_design_scores_gemma":[0.000051697207,0.00020658365,0.011607842,0.00004167447,0.00003092863,0.00010282031,0.00035823137,0.8857743,0.0019140559,0.098535836,0.0013108621,0.00006507377],"about_ca_topic_score_codex":0.0024414058,"about_ca_topic_score_gemma":0.0019711768,"teacher_disagreement_score":0.004056021,"about_ca_system_score_codex":0.0013697364,"about_ca_system_score_gemma":0.00072162534,"threshold_uncertainty_score":0.020576894},"labels":[],"label_agreement":null}]}