{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1187,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":1187,"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":"c746e7dad116","filters":{"topic":"Vehicle Routing Optimization Methods"}},"results":[{"id":"W2039568841","doi":"10.1007/s10479-005-3971-7","title":"Metaheuristics in Combinatorial Optimization","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2341,"is_retracted":false,"has_abstract":false,"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":"Metaheuristic; Theory of computation; Combinatorial optimization; Vehicle routing problem; Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Job shop scheduling; Parallel metaheuristic; Optimization problem; Management science; Routing (electronic design automation); Mathematics; Artificial intelligence; Algorithm; Engineering; Meta-optimization","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1739552011743806,"gpt":0.4498479164768863,"spread":0.2758927153025057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003129226,0.001517075,0.001879051,0.001605607,0.0006155329,0.002982959,0.001737782,0.002529718,0.004210023],"category_scores_gemma":[0.007943437,0.001061672,0.0009991446,0.003622778,0.002830903,0.003022393,0.001119818,0.005706437,0.0009714155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001398198,"about_ca_system_score_gemma":0.00154554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390951,"about_ca_topic_score_gemma":0.003463146,"domain_scores_codex":[0.9985676,0.0009112698,0.00006450839,0.00009566748,0.0003032971,0.00005757096],"domain_scores_gemma":[0.9960787,0.003205018,0.0001626656,0.0002100195,0.0002641341,0.00007949545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007069456,0.0001485113,0.0003276097,0.0004846745,0.0002063479,0.00006320349,0.0001239663,0.4361214,0.0005792695,0.4222832,0.01411946,0.1254716],"study_design_scores_gemma":[0.00004800542,0.00003825037,0.0001900845,0.0001424585,0.00004136412,0.00003612539,0.00003767212,0.6032754,0.0002749183,0.3731971,0.02270016,0.0000185543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007526171,0.08077475,0.8728635,0.004454797,0.002042246,0.00006233963,0.0001062395,0.000203355,0.03196669],"genre_scores_gemma":[0.2832522,0.08244648,0.5958306,0.001033203,0.005909564,0.0004495399,0.0003751776,0.0004243376,0.03027893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004210023,"threshold_uncertainty_score":0.01654917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2471190594","doi":"10.1109/tsmc.2016.2582745","title":"Vehicle Routing Problems for Drone Delivery","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1245,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Drone; Payload (computing); Computer science; Energy consumption; Mathematical optimization; Simulation; Mathematics; Engineering; Computer network; Network packet; Electrical engineering","authors":[{"name":"Kevin Dorling","is_ca":true},{"name":"Jordan Heinrichs","is_ca":true},{"name":"Geoffrey G. Messier","is_ca":true},{"name":"Sebastian Magierowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01946075877356595,"gpt":0.224061717961391,"spread":0.2046009591878251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118296,0.001690005,0.001290273,0.001110278,0.001009295,0.002514404,0.001437512,0.002385189,0.01045413],"category_scores_gemma":[0.005096628,0.0008575419,0.001347804,0.001813463,0.0009036246,0.002026135,0.001269872,0.002464748,0.0009970469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00287941,"about_ca_system_score_gemma":0.002059634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008773268,"about_ca_topic_score_gemma":0.008408448,"domain_scores_codex":[0.9987943,0.000508955,0.00005979956,0.0002848873,0.0002240907,0.0001279425],"domain_scores_gemma":[0.9977418,0.00165885,0.0002318138,0.00006294154,0.0002258555,0.00007867235],"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.00002638806,0.00004032502,0.0002617523,0.0002295453,0.00004462777,0.0001125446,0.00008137881,0.9235053,0.0004575845,0.05305758,0.003598903,0.01858406],"study_design_scores_gemma":[0.00002574051,0.00004010713,0.0001662162,0.00004754495,0.00002387151,0.00008703635,0.00009885676,0.9322229,0.0002858789,0.056133,0.01084926,0.00001958416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01721885,0.003508821,0.95019,0.001908454,0.0002820081,0.0002801075,0.000741431,0.0002545334,0.02561575],"genre_scores_gemma":[0.4768882,0.009419172,0.4669193,0.000874505,0.0005979438,0.001077914,0.001830845,0.0005952413,0.04179695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045413,"threshold_uncertainty_score":0.03497249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066086285","doi":"10.1287/trsc.1030.0056","title":"Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1112,"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":"Emil Aaltosen Säätiö","keywords":"Vehicle routing problem; Heuristic; Benchmark (surveying); Pareto principle; Mathematical optimization; Set (abstract data type); Metaheuristic; Point (geometry); Routing (electronic design automation); Computer science; Interval (graph theory); Local search (optimization); Algorithm; Mathematics","authors":[{"name":"Olli Bräysy","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0132602200802881,"gpt":0.2520301703643327,"spread":0.2387699502840446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006921121,0.0008593218,0.001199059,0.0005112438,0.0004280464,0.001739366,0.001104965,0.001046269,0.002686958],"category_scores_gemma":[0.001757251,0.0004570096,0.000693624,0.001842405,0.0005772199,0.002277653,0.0007035764,0.001134337,0.0006927949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008768331,"about_ca_system_score_gemma":0.0008683926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317902,"about_ca_topic_score_gemma":0.001495881,"domain_scores_codex":[0.9995932,0.0001782924,0.00002204409,0.00007712287,0.00008407429,0.000045201],"domain_scores_gemma":[0.9995158,0.0003216254,0.00007482785,0.00002987982,0.00003594926,0.00002196111],"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.0001125332,0.0001180791,0.0004349384,0.0006620647,0.00008650278,0.000104568,0.0001221566,0.7119612,0.002317845,0.06884886,0.008429431,0.2068018],"study_design_scores_gemma":[0.00004867565,0.000124751,0.0002882833,0.00008190468,0.00004707299,0.0002010457,0.00008024577,0.9339967,0.001749996,0.04503241,0.01832497,0.00002394806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01315447,0.01357576,0.9611138,0.0006160376,0.0001157268,0.0001162932,0.0001411804,0.0003826878,0.0107841],"genre_scores_gemma":[0.391856,0.02429761,0.5623655,0.0002983878,0.0005227569,0.0006538067,0.0005331952,0.000318725,0.01915395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002686958,"threshold_uncertainty_score":0.008988738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970355999","doi":"10.1287/opre.1050.0234","title":"Selected Topics in Column Generation","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1084,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Column (typography); Perspective (graphical); Integer programming; Computer science; Dual (grammatical number); Linear programming; Decomposition; Point (geometry); Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Algorithm","authors":[{"name":"Marco E. Lübbecke","is_ca":false},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08886315424571074,"gpt":0.393188984849525,"spread":0.3043258306038143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509967,0.00142912,0.00112661,0.002352679,0.00107036,0.002794864,0.001091675,0.001561758,0.02689739],"category_scores_gemma":[0.004806675,0.0005540552,0.001220259,0.005919798,0.001541774,0.004201859,0.001515895,0.003616584,0.01107154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622948,"about_ca_system_score_gemma":0.0009535975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009160536,"about_ca_topic_score_gemma":0.0008245014,"domain_scores_codex":[0.9988445,0.0003161812,0.00006350773,0.0003020097,0.0003891288,0.00008467086],"domain_scores_gemma":[0.997733,0.001222894,0.00009929913,0.0002093969,0.0005535962,0.0001818077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006440924,0.0001158323,0.000409872,0.001202988,0.00005674676,0.000123062,0.0001436935,0.004471062,0.0009091105,0.2836874,0.347655,0.3611608],"study_design_scores_gemma":[0.00002317726,0.0001076783,0.0005784791,0.0006156043,0.00003614925,0.0004742063,0.00009220582,0.007838759,0.001006903,0.2506611,0.7385133,0.00005244889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.003893927,0.4954194,0.2618449,0.02854413,0.04001889,0.0002139863,0.0007592695,0.0006445776,0.1686609],"genre_scores_gemma":[0.07265001,0.4451588,0.1435326,0.01641186,0.1283721,0.0006394152,0.002497162,0.001243962,0.1894941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02689739,"threshold_uncertainty_score":0.08998078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168210873","doi":"10.1287/trsc.1090.0301","title":"Fifty Years of Vehicle Routing","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":981,"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":"Vehicle routing problem; Heuristics; Truck; Metaheuristic; Routing (electronic design automation); Mathematical optimization; Decomposition; Computer science; Operations research; Engineering; Mathematics; Computer network","authors":[{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01620746114889389,"gpt":0.2787206248230034,"spread":0.2625131636741095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039514,0.0008693169,0.0008451911,0.001244606,0.001646757,0.004226537,0.001505749,0.00225613,0.02033138],"category_scores_gemma":[0.006019369,0.0004794796,0.0006010039,0.002548692,0.003809343,0.005895415,0.002992089,0.00326374,0.007691697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002986957,"about_ca_system_score_gemma":0.002220466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003921747,"about_ca_topic_score_gemma":0.0030042,"domain_scores_codex":[0.9982738,0.0004933621,0.00009077205,0.0003765583,0.0005877624,0.0001776407],"domain_scores_gemma":[0.9984965,0.000640352,0.00009089765,0.0002468429,0.0003934938,0.0001318236],"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.00005766696,0.00003647464,0.0004298721,0.0003187198,0.00002246585,0.00009079105,0.0003476184,0.004759351,0.0002143621,0.7631709,0.06584596,0.1647058],"study_design_scores_gemma":[0.000006431093,0.00002577373,0.0001846469,0.0003829936,0.000005900641,0.00009051956,0.0001420121,0.00109863,0.0001038839,0.1577395,0.8402022,0.00001747894],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.007724381,0.3224619,0.1232626,0.0624905,0.02192623,0.000150651,0.001231177,0.0005223372,0.4602303],"genre_scores_gemma":[0.211997,0.4424061,0.06825747,0.02073858,0.01537344,0.0003602171,0.00198146,0.0005632718,0.2383227],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.02033138,"threshold_uncertainty_score":0.06801528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116675171","doi":"10.1287/trsc.1030.0057","title":"Vehicle Routing Problem with Time Windows, Part II: Metaheuristics","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":826,"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":"Vehicle routing problem; Metaheuristic; Heuristics; Benchmark (surveying); Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Computer science; Point (geometry); Interval (graph theory); Operations research; Mathematics; Computer network","authors":[{"name":"Olli Bräysy","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0140215721847575,"gpt":0.2471341688413525,"spread":0.233112596656595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777043,0.001240173,0.001121524,0.0007549576,0.0004485593,0.002201799,0.001094625,0.001458238,0.002979913],"category_scores_gemma":[0.001497986,0.0004631282,0.001119492,0.002394651,0.00061522,0.002045488,0.0006767404,0.001475836,0.0007297143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056952,"about_ca_system_score_gemma":0.0011949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002511106,"about_ca_topic_score_gemma":0.001795576,"domain_scores_codex":[0.9995475,0.0001615892,0.00003091797,0.00007643548,0.0001138973,0.00006958209],"domain_scores_gemma":[0.9996296,0.0002100079,0.00006763038,0.0000384315,0.00003174585,0.00002255835],"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.00009594904,0.0001166201,0.0003596557,0.0004931364,0.0001360624,0.0001211564,0.00007702703,0.7426201,0.003233335,0.08553803,0.007893762,0.1593152],"study_design_scores_gemma":[0.00006688084,0.0001782811,0.0004227807,0.0001391946,0.00006183013,0.0002682604,0.00008670207,0.8544301,0.004163289,0.09145794,0.04869186,0.00003280327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01474734,0.01655858,0.9463648,0.00109548,0.000473079,0.0002264256,0.0003002514,0.0003987324,0.01983529],"genre_scores_gemma":[0.3238566,0.03047969,0.6104713,0.0007431524,0.001220289,0.0007888848,0.0007587948,0.0005366235,0.03114469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002979913,"threshold_uncertainty_score":0.009968758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114939271","doi":"10.1111/j.1475-3995.2000.tb00200.x","title":"Classical and modern heuristics for the vehicle routing problem","year":2000,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":705,"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; Group for Research in Decision Analysis; Computer Research Institute of Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Tabu search; Metaheuristic; Mathematical optimization; Vehicle routing problem; Computer science; Routing (electronic design automation); Algorithm; Mathematics","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"J‐Y. Potvin","is_ca":true},{"name":"Frédéric Semet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07150300697132775,"gpt":0.386507307404209,"spread":0.3150043004328812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203423,0.0007044419,0.0005356197,0.001162925,0.0004321152,0.0016456,0.001002699,0.0008973423,0.006544775],"category_scores_gemma":[0.002168156,0.0003415115,0.0005919613,0.002039296,0.0009423353,0.001488979,0.0006809572,0.001035349,0.001149558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195903,"about_ca_system_score_gemma":0.001288045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001961914,"about_ca_topic_score_gemma":0.002832228,"domain_scores_codex":[0.9987643,0.0004857819,0.00006175034,0.0001514359,0.0004244092,0.0001122846],"domain_scores_gemma":[0.9993759,0.0003840273,0.00005568021,0.00007370255,0.00008617555,0.00002465997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001027008,0.0001098452,0.0004927918,0.001004653,0.0001056552,0.0001109128,0.0001215675,0.2551542,0.002587392,0.3330486,0.02305906,0.3841025],"study_design_scores_gemma":[0.0001107778,0.0001988507,0.001273917,0.0003953551,0.00007237733,0.0004645179,0.000212204,0.4380561,0.002974557,0.3530762,0.203098,0.00006710459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01667801,0.05697884,0.8802198,0.001413101,0.0006986001,0.0001892031,0.0003770254,0.0006777706,0.04276767],"genre_scores_gemma":[0.2340909,0.03815598,0.7039711,0.0009084629,0.0009411952,0.0002703535,0.0006935949,0.0002177854,0.02075064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006544775,"threshold_uncertainty_score":0.02189445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082772228","doi":"10.1007/s11750-007-0009-0","title":"Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":698,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Pickup; Scheme (mathematics); Computer science; Vehicle routing problem; Class (philosophy); Classification scheme; Routing (electronic design automation); Field (mathematics); Operations research; Mathematical optimization; Artificial intelligence; Data science; Computer network; Mathematics","authors":[{"name":"Gerardo Berbeglia","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Irina Gribkovskaia","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04328352270591027,"gpt":0.2781970216619149,"spread":0.2349134989560046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001720403,0.001719556,0.002199367,0.004572636,0.0009548308,0.003098194,0.002864777,0.002036686,0.002811786],"category_scores_gemma":[0.002747904,0.0008342261,0.002016211,0.008736901,0.001280136,0.004663416,0.001497338,0.002074168,0.001162388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009122725,"about_ca_system_score_gemma":0.001255642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827293,"about_ca_topic_score_gemma":0.001841101,"domain_scores_codex":[0.998473,0.0002239024,0.0001421542,0.0004126121,0.0006025203,0.000145828],"domain_scores_gemma":[0.9981939,0.0009195559,0.0002332397,0.0001376791,0.0004157427,0.00009985088],"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.00009838361,0.0006001611,0.005860186,0.003159273,0.0001810109,0.0001889155,0.0002064837,0.05890815,0.00149568,0.0891289,0.02634109,0.8138318],"study_design_scores_gemma":[0.00006195868,0.0007916961,0.00902904,0.0015903,0.0003849045,0.003322335,0.001047626,0.5006545,0.003166365,0.2025061,0.2772492,0.0001959554],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.02602584,0.2756274,0.6511909,0.003877621,0.0009138039,0.0003262002,0.0006116644,0.0003228284,0.04110382],"genre_scores_gemma":[0.1977803,0.5082449,0.2548769,0.001371157,0.004898686,0.0004570435,0.002475266,0.000287235,0.02960849],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004572636,"threshold_uncertainty_score":0.009406388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119601963","doi":"10.1287/opre.1120.1048","title":"A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":685,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Population; Genetic algorithm; Routing (electronic design automation); Algorithm; Mathematics; Medicine","authors":[{"name":"Thibaut Vidal","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Nadia Lahrichi","is_ca":true},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06420246300526486,"gpt":0.3580434042946693,"spread":0.2938409412894044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106041,0.0006730292,0.0006855596,0.000745024,0.0003546001,0.0006270249,0.001390364,0.001169326,0.001597867],"category_scores_gemma":[0.0008821351,0.0002939891,0.0005936496,0.0009120122,0.000440652,0.0006613195,0.0007195642,0.0007064245,0.0003044246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005399536,"about_ca_system_score_gemma":0.0009768668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003076952,"about_ca_topic_score_gemma":0.003550785,"domain_scores_codex":[0.999712,0.0000816204,0.000009580685,0.00004593587,0.0001156619,0.0000351042],"domain_scores_gemma":[0.9998093,0.00009963055,0.00002204162,0.00002137515,0.00003439999,0.00001321143],"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.00002661946,0.00004873962,0.000356686,0.00003892423,0.00004446596,0.00006068718,0.00003701315,0.8929232,0.001727992,0.01646623,0.001079952,0.08718941],"study_design_scores_gemma":[0.00001749394,0.00002990865,0.00006682549,0.000004898899,0.000008230686,0.00002546192,0.000006561575,0.9949076,0.000289667,0.003201513,0.001437877,0.000003859448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01754556,0.0002958875,0.9775106,0.0001174308,0.00004588867,0.00005955933,0.00003590776,0.0003245699,0.004064623],"genre_scores_gemma":[0.2815878,0.0003446622,0.7133792,0.0001436761,0.0000538012,0.0003223346,0.0001807759,0.0000877467,0.003900068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003076952,"threshold_uncertainty_score":0.006118059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985290529","doi":"10.1016/s0191-2615(02)00045-0","title":"A tabu search heuristic for the static multi-vehicle dial-a-ride problem","year":2003,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":676,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Tabu search; Heuristic; Computer science; Duration (music); Set (abstract data type); Mathematical optimization; Vehicle routing problem; Operations research; Transport engineering; Engineering; Routing (electronic design automation); Mathematics; Computer network; Algorithm; Artificial intelligence","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4602205926685543,"gpt":0.4768557581067919,"spread":0.01663516543823756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001515532,0.0008770085,0.001545837,0.002021271,0.001224081,0.001453579,0.002623843,0.002614226,0.01241633],"category_scores_gemma":[0.004762924,0.0008201653,0.0009290967,0.002946705,0.001083137,0.001473536,0.001059918,0.001137577,0.001628503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001535289,"about_ca_system_score_gemma":0.002379101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01397881,"about_ca_topic_score_gemma":0.01202085,"domain_scores_codex":[0.9992237,0.0003991588,0.00002348406,0.00008703853,0.0001345644,0.0001320629],"domain_scores_gemma":[0.9983324,0.001096595,0.00009467753,0.0001293998,0.0002650111,0.00008183841],"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.0002105967,0.0001783929,0.0004127827,0.0001170674,0.00005886747,0.00007715707,0.000092022,0.8460909,0.0007039728,0.009674259,0.007961655,0.1344223],"study_design_scores_gemma":[0.00009350191,0.00008216241,0.0001651234,0.00002599945,0.00002754472,0.00002696327,0.00004452118,0.9920922,0.0002664684,0.005081326,0.002078487,0.00001564027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08664816,0.002383153,0.8803744,0.000799035,0.0005112038,0.0005195145,0.0007284829,0.002843064,0.02519308],"genre_scores_gemma":[0.3429472,0.0006119843,0.6456124,0.0003604822,0.0001036366,0.0005121038,0.0007611768,0.0004893577,0.008601672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01397881,"threshold_uncertainty_score":0.04153675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051358678","doi":"10.1287/opre.1060.0283","title":"A Branch-and-Cut Algorithm for the Dial-a-Ride Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":672,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Travelling salesman problem; Vehicle routing problem; Computer science; Integer programming; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Branch and price; 2-opt; Traveling purchaser problem; Algorithm; Mathematics; Computer network","authors":[{"name":"Jean‐François Cordeau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04499379721732293,"gpt":0.3588639218862965,"spread":0.3138701246689736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750509,0.001962798,0.002078095,0.001601548,0.001473163,0.002134279,0.002151936,0.002156107,0.009167028],"category_scores_gemma":[0.004261853,0.001070178,0.001147807,0.002727111,0.000716779,0.002395436,0.001715556,0.003264948,0.001729709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554235,"about_ca_system_score_gemma":0.00317965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006243069,"about_ca_topic_score_gemma":0.005555004,"domain_scores_codex":[0.9987479,0.0004076315,0.00006786813,0.0002659484,0.0003327074,0.0001779225],"domain_scores_gemma":[0.9983186,0.001147755,0.000118353,0.0000858784,0.0002325553,0.00009701683],"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.0002518666,0.0005234029,0.0006586224,0.0003535248,0.0001073546,0.0002298158,0.0001643839,0.5081094,0.002203861,0.0439832,0.01790589,0.4255087],"study_design_scores_gemma":[0.0001086192,0.00009192489,0.0001154471,0.00002976062,0.00003001435,0.00008673776,0.00004944785,0.9654167,0.0008860001,0.0276449,0.005524298,0.0000161453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004923471,0.0003663048,0.9894642,0.0003037144,0.00007065165,0.0002735541,0.0001850186,0.0005354437,0.003877584],"genre_scores_gemma":[0.03571329,0.0003505124,0.9599584,0.0001291871,0.00004856103,0.0004847005,0.0006215429,0.0002064232,0.002487418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009167028,"threshold_uncertainty_score":0.03066671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029341065","doi":"10.1002/net.20033","title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":665,"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":"Column generation; Shortest path problem; Path (computing); Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Computation; K shortest path routing; Longest path problem; Constrained Shortest Path First; Algorithm; Mathematics; Theoretical computer science; Graph","authors":[{"name":"Dominique Feillet","is_ca":false},{"name":"Pierre Dejax","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Cyrille Gueguen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008733564536156346,"gpt":0.2388332489582275,"spread":0.2300996844220712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011822,0.0006259591,0.0007390344,0.0005149218,0.0005305457,0.0005611134,0.001001948,0.0008630053,0.004313316],"category_scores_gemma":[0.003222576,0.0003526467,0.0004565828,0.0008551087,0.000597324,0.0010228,0.000792757,0.001098242,0.0004106498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006947512,"about_ca_system_score_gemma":0.001624104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004946777,"about_ca_topic_score_gemma":0.006324674,"domain_scores_codex":[0.99949,0.0001853801,0.00002285411,0.00009539873,0.0001331752,0.0000730422],"domain_scores_gemma":[0.9983544,0.001078356,0.00009562864,0.0002320971,0.0001949033,0.00004446101],"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.0001215599,0.0001117728,0.0004590939,0.0001332479,0.00002460926,0.00008006347,0.0001089518,0.7970908,0.003157179,0.02831965,0.002853314,0.1675397],"study_design_scores_gemma":[0.00005670058,0.00004036829,0.00008031318,0.000005979515,0.000005976055,0.00003885492,0.00002005282,0.9841042,0.001208794,0.01320619,0.001226064,0.000006549544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541918,0.00008671012,0.9714353,0.00015681,0.00002667244,0.00009335057,0.00006803677,0.0006087402,0.002105125],"genre_scores_gemma":[0.1461319,0.0000717707,0.8519684,0.00006075146,0.00001917615,0.0001290945,0.0001682304,0.0001009748,0.001349725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004946777,"threshold_uncertainty_score":0.01442951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991149726","doi":"10.1287/trsc.1030.0079","title":"Traveling Salesman Problems with Profits","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":617,"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":"Travelling salesman problem; Mathematical optimization; Profit (economics); Generalization; Vertex (graph theory); Heuristic; Traveling purchaser problem; Operations research; Computer science; Combinatorial optimization; Bottleneck traveling salesman problem; Mathematics; Economics; Combinatorics; Microeconomics; Graph","authors":[{"name":"Dominique Feillet","is_ca":false},{"name":"Pierre Dejax","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01684428022553878,"gpt":0.2527487551312724,"spread":0.2359044749057337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009350173,0.001264333,0.001061311,0.00073567,0.001166946,0.003406975,0.001256576,0.001575791,0.008671001],"category_scores_gemma":[0.003902011,0.0004559489,0.0009996531,0.002246797,0.001368004,0.003956824,0.001554218,0.002273081,0.002083281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001338027,"about_ca_system_score_gemma":0.00168969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003187202,"about_ca_topic_score_gemma":0.002228302,"domain_scores_codex":[0.9985986,0.0004746428,0.00009316691,0.0002630741,0.0003764267,0.0001939947],"domain_scores_gemma":[0.9990829,0.0005401075,0.0001102247,0.00006775945,0.0001374353,0.00006162593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004002436,0.00007855439,0.0003116656,0.0002839943,0.00004731483,0.0002748535,0.0002134597,0.1244379,0.0005798984,0.7858513,0.02030717,0.06757376],"study_design_scores_gemma":[0.00003209175,0.00004413597,0.0002177497,0.00006427198,0.00002817771,0.0003613229,0.0002193937,0.2301246,0.000391865,0.7072037,0.06128485,0.00002781983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02369482,0.007795152,0.84271,0.003565476,0.0008098664,0.0004563355,0.001067475,0.0004230738,0.1194779],"genre_scores_gemma":[0.492902,0.02102945,0.4049446,0.001106987,0.001756911,0.0008506504,0.002084245,0.0003198045,0.07500532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008671001,"threshold_uncertainty_score":0.02900743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2593704234","doi":"10.1016/j.trb.2017.02.004","title":"The electric vehicle routing problem with nonlinear charging function","year":2017,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":583,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal","funders":"Agence Nationale de la Recherche; Universidad EAFIT; Universidad de Antioquia; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Testbed; Nonlinear system; Electric vehicle; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Computer science; Metaheuristic; Range (aeronautics); Battery (electricity); Function (biology); Nonlinear programming; Engineering; Algorithm; Mathematics; Power (physics)","authors":[{"name":"Alejandro Montoya","is_ca":false},{"name":"Christelle Guéret","is_ca":false},{"name":"Jorge E. Mendoza","is_ca":true},{"name":"Juan G. Villegas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2329196114939603,"gpt":0.4196467031617125,"spread":0.1867270916677522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241602,0.0008561026,0.0007061037,0.0005121241,0.0004247564,0.001567292,0.001459444,0.001416802,0.003719872],"category_scores_gemma":[0.004137509,0.0005388106,0.0006465433,0.0009065813,0.001300587,0.002863532,0.001191862,0.001173725,0.0002872274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544098,"about_ca_system_score_gemma":0.001228849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004760253,"about_ca_topic_score_gemma":0.00286654,"domain_scores_codex":[0.9994636,0.0002636517,0.0000166198,0.000124939,0.00007180338,0.00005939423],"domain_scores_gemma":[0.9991272,0.0006126153,0.0000851275,0.00004346171,0.00008262376,0.00004895393],"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.00006489142,0.00004735832,0.000469331,0.0001406074,0.00002973868,0.0001682425,0.00005002661,0.8117636,0.00059465,0.1727698,0.002031327,0.01187049],"study_design_scores_gemma":[0.00001921515,0.00002028713,0.0001888508,0.00001098384,0.00001273867,0.00006782528,0.00005538769,0.9147674,0.0002634036,0.08221512,0.002365303,0.00001347702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05223501,0.000714199,0.919641,0.002262207,0.0002267471,0.00007115371,0.0003018459,0.00006085751,0.02448699],"genre_scores_gemma":[0.8367478,0.001515496,0.1007869,0.0003286708,0.0002986611,0.0001416005,0.0003656733,0.000117105,0.05969805],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004760253,"threshold_uncertainty_score":0.0124442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127654349","doi":"10.1287/trsc.2013.0472","title":"Thirty Years of Inventory Routing","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":578,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Vehicle routing problem; Operations research; Scheduling (production processes); Computer science; Routing (electronic design automation); Metaheuristic; Class (philosophy); Categorization; Operations management; Engineering; Artificial intelligence; Computer network","authors":[{"name":"Leandro C. Coelho","is_ca":true},{"name":"Jean-François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01910265373136389,"gpt":0.2644134794584833,"spread":0.2453108257271194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00324933,0.001217599,0.001072537,0.001851464,0.001648304,0.00576666,0.001939128,0.002344219,0.01530325],"category_scores_gemma":[0.008189115,0.0007156514,0.0008929766,0.004194365,0.00322097,0.006879554,0.003303064,0.003697654,0.006446871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004417795,"about_ca_system_score_gemma":0.003659859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004946911,"about_ca_topic_score_gemma":0.004037347,"domain_scores_codex":[0.9970378,0.0007950347,0.0002350968,0.0005814981,0.001128706,0.0002219257],"domain_scores_gemma":[0.9974942,0.001000633,0.0001826573,0.0003778476,0.0007402768,0.000204432],"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.0001029862,0.00005851407,0.0008135488,0.0006526064,0.00004902975,0.0001324481,0.0003524488,0.01097728,0.0003364745,0.6141763,0.05636186,0.3159866],"study_design_scores_gemma":[0.000009837901,0.00004106536,0.0002557306,0.0006181267,0.00001272301,0.0001551423,0.0001585324,0.002736313,0.0001790575,0.1895321,0.8062677,0.00003363944],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.006220654,0.4630833,0.1717853,0.04619439,0.01623334,0.0002167309,0.001310284,0.000548216,0.2944077],"genre_scores_gemma":[0.1557916,0.5691098,0.1110367,0.01305533,0.01367273,0.0003773102,0.00228734,0.0004316627,0.1342375],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01530325,"threshold_uncertainty_score":0.05119449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W311217234","doi":"10.1007/0-387-25486-2_2","title":"Shortest Path Problems with Resource Constraints","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":573,"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","funders":"","keywords":"Shortest path problem; Computer science; Column generation; Resource (disambiguation); Mathematical optimization; Scheduling (production processes); Path (computing); Vehicle routing problem; Operations research; Resource constraints; Routing (electronic design automation); Distributed computing; Engineering; Mathematics; Theoretical computer science; Graph; Computer network","authors":[{"name":"Stefan Irnich","is_ca":false},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01383972761132562,"gpt":0.2045635052047349,"spread":0.1907237775934093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166171,0.001794728,0.0009516303,0.0005778078,0.0004500997,0.001258772,0.001636129,0.0009412984,0.01507128],"category_scores_gemma":[0.0008206165,0.0006845122,0.0006255147,0.001949895,0.0006275606,0.002339791,0.0007868189,0.002114314,0.004514875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007612286,"about_ca_system_score_gemma":0.0008742882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00152746,"about_ca_topic_score_gemma":0.002970376,"domain_scores_codex":[0.9997302,0.00005257722,0.000009353208,0.00005250721,0.0001323908,0.00002300669],"domain_scores_gemma":[0.9998392,0.00008955449,0.000008737496,0.000023606,0.0000314736,0.000007497598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002303513,0.00007275205,0.00007409356,0.000577942,0.0000370475,0.00008281735,0.00009112986,0.1479068,0.001738204,0.3607278,0.09495655,0.3937118],"study_design_scores_gemma":[0.00002061132,0.00003169139,0.0001377932,0.0002001775,0.00002593054,0.000187727,0.00006767105,0.1869359,0.001728641,0.4945023,0.316135,0.00002653648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002612327,0.007043863,0.7845934,0.0009537805,0.0008557276,0.00008242282,0.0003845134,0.0004733075,0.2030007],"genre_scores_gemma":[0.05265585,0.02124572,0.6310285,0.0004067144,0.000773782,0.0003974341,0.001467905,0.00079602,0.2912281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01507128,"threshold_uncertainty_score":0.05041844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070637511","doi":"10.1007/s10489-006-6926-z","title":"Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows","year":2006,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":510,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Benchmark (surveying); Computer science; Set (abstract data type); Pareto principle; Mathematical optimization; Genetic algorithm; Extension (predicate logic); Ranking (information retrieval); Multi-objective optimization; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Beatrice M. Ombuki","is_ca":true},{"name":"Brian J. Ross","is_ca":true},{"name":"Franklin T. Hanshar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01597300508623297,"gpt":0.2513967951754557,"spread":0.2354237900892227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00135668,0.0009050563,0.001000009,0.0008686719,0.0003910174,0.0008595379,0.001169374,0.001478309,0.001461781],"category_scores_gemma":[0.002717255,0.0005728148,0.0007285036,0.001194851,0.0005284584,0.001095934,0.0006886353,0.001183992,0.0001843571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001053405,"about_ca_system_score_gemma":0.001034193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006558589,"about_ca_topic_score_gemma":0.004396129,"domain_scores_codex":[0.9996213,0.0001642523,0.00001584932,0.00005376617,0.00009953821,0.00004528891],"domain_scores_gemma":[0.9991801,0.0005960017,0.0000835316,0.00002649733,0.00008545754,0.00002847049],"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.00002724512,0.00002301454,0.00009112348,0.00002262306,0.00002332644,0.00001333753,0.00001527527,0.9799255,0.0003079183,0.004330155,0.0002264353,0.01499414],"study_design_scores_gemma":[0.000007221969,0.00001088752,0.000027032,0.000003079813,0.000005179429,0.000002934247,0.000002558517,0.9981552,0.00009255905,0.00156403,0.000127857,0.000001535105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02364123,0.0008109584,0.9725008,0.0002189972,0.00006182963,0.00004207285,0.00003486887,0.0001104216,0.002578751],"genre_scores_gemma":[0.5437388,0.001035542,0.4491156,0.0001380981,0.000104541,0.0003089215,0.0001227472,0.00009396898,0.005341719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006558589,"threshold_uncertainty_score":0.01304084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146004814","doi":"10.1016/j.cor.2012.04.007","title":"An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":506,"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; HEC Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Vehicle routing problem; Heuristic; Computer science; Context (archaeology); Routing (electronic design automation); Mathematical optimization; Scheme (mathematics); Local search (optimization); Operations research; Mathematics; Algorithm; Artificial intelligence; Computer network","authors":[{"name":"Vera Hemmelmayr","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1379065368142567,"gpt":0.4106109157336956,"spread":0.2727043789194389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957475,0.0004744751,0.001037241,0.0006161207,0.0004815903,0.0005373624,0.001291592,0.0009352362,0.001652474],"category_scores_gemma":[0.00185552,0.0003251911,0.0006078384,0.0006649304,0.0004542594,0.001110429,0.0007749419,0.0007073685,0.0002074696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006975832,"about_ca_system_score_gemma":0.001023307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00412501,"about_ca_topic_score_gemma":0.00553263,"domain_scores_codex":[0.9995246,0.00023811,0.00001881758,0.00006771265,0.00009680011,0.00005405741],"domain_scores_gemma":[0.9992448,0.0005388925,0.0000657227,0.00003591539,0.00007124437,0.0000434655],"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.00006852511,0.00009249676,0.0004293886,0.00006178925,0.00003186747,0.00006101338,0.0000414385,0.944086,0.0006772919,0.01000507,0.001214839,0.04323033],"study_design_scores_gemma":[0.00001429034,0.00002791682,0.00004793127,0.000003793272,0.000004431423,0.00001326058,0.00001133503,0.9971737,0.0001377797,0.00207068,0.000491287,0.000003553326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03702108,0.000681737,0.9580293,0.0001900952,0.00006636023,0.0001333294,0.00004906115,0.0001940271,0.003634963],"genre_scores_gemma":[0.5061894,0.0004250878,0.4899481,0.0001567698,0.0000574783,0.0003276016,0.0002152426,0.00007913992,0.002601133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00412501,"threshold_uncertainty_score":0.008201957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119097848","doi":"10.1287/trsc.1090.0272","title":"Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":462,"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":"Column generation; Pickup; Mathematical optimization; Set (abstract data type); Branch and cut; Relaxation (psychology); Linear programming relaxation; Lagrangian relaxation; Computer science; Path (computing); Integer programming; Linear programming; Shortest path problem; Branch and price; Vehicle routing problem; Column (typography); Mathematics; Routing (electronic design automation); Theoretical computer science","authors":[{"name":"Stefan Røpke","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01091285829767171,"gpt":0.2396820738027333,"spread":0.2287692155050615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002761626,0.001510949,0.001454093,0.001072482,0.0009632545,0.002171499,0.001221931,0.001568153,0.008339729],"category_scores_gemma":[0.005771148,0.001007996,0.0009848014,0.002121234,0.001183659,0.003266426,0.001176827,0.003376141,0.0009445466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001986709,"about_ca_system_score_gemma":0.00236851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005807045,"about_ca_topic_score_gemma":0.005661741,"domain_scores_codex":[0.9988907,0.0004792873,0.00004220205,0.0001386231,0.0002933465,0.0001558651],"domain_scores_gemma":[0.9973282,0.002217482,0.0001380711,0.00008319155,0.0001478869,0.00008519931],"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.0003486796,0.0001654791,0.0005905412,0.0002982766,0.00007196159,0.0001956714,0.0001457787,0.6558555,0.002124065,0.184007,0.006503978,0.1496931],"study_design_scores_gemma":[0.00004561171,0.00007508999,0.0001195148,0.00002154668,0.00002038103,0.00004715887,0.00002435385,0.9302652,0.0007401511,0.06610714,0.002522007,0.00001186117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01488439,0.0008208994,0.978522,0.000441834,0.00007222658,0.000160879,0.0001070962,0.0002053263,0.004785365],"genre_scores_gemma":[0.1844822,0.001871499,0.8043836,0.0001881749,0.0001548016,0.0005467353,0.0005857067,0.0002951708,0.007492225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008339729,"threshold_uncertainty_score":0.02789921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040075495","doi":"10.1016/j.ejor.2013.08.002","title":"The bi-objective Pollution-Routing Problem","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":442,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"University of Southampton","keywords":"Weighting; Mathematical optimization; Computer science; Normalization (sociology); Vehicle routing problem; Set (abstract data type); Routing (electronic design automation); Minification; Constraint (computer-aided design); Extension (predicate logic); Mathematics","authors":[{"name":"Emrah Demir","is_ca":false},{"name":"Tolga Bektaş","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05395561392824383,"gpt":0.3389584209137308,"spread":0.285002806985487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002420792,0.002405648,0.002477805,0.001791399,0.0007872169,0.002849477,0.003178787,0.004031653,0.006984025],"category_scores_gemma":[0.005601871,0.001199315,0.001398995,0.003383814,0.001244307,0.002678829,0.00319794,0.002138967,0.0007963873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393581,"about_ca_system_score_gemma":0.001491334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005830547,"about_ca_topic_score_gemma":0.004017903,"domain_scores_codex":[0.9981685,0.0007624555,0.00006950404,0.0003578064,0.0004095543,0.0002322332],"domain_scores_gemma":[0.9986581,0.0007399572,0.0001690614,0.00008055095,0.0001875661,0.0001647003],"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.0001415132,0.0001276169,0.0007990171,0.0003277379,0.0001976243,0.000258419,0.00004820657,0.939626,0.0008330254,0.03295912,0.003271437,0.02141039],"study_design_scores_gemma":[0.00003743989,0.0000614118,0.0003247724,0.00002406453,0.00004262643,0.0001037606,0.00003596187,0.9708263,0.0002617823,0.02613928,0.002125346,0.00001723691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05013501,0.001895422,0.9198974,0.002020563,0.0003503021,0.0001884931,0.001474586,0.000251848,0.02378626],"genre_scores_gemma":[0.6640889,0.002712347,0.2841935,0.0007964784,0.0003761773,0.0006376082,0.002470524,0.0004013222,0.04432303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006984025,"threshold_uncertainty_score":0.02336389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136871443","doi":"10.1287/trsc.1060.0188","title":"A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":426,"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":"Mathematical optimization; Stockout; Integer programming; Operations research; Vendor; Time horizon; Purchasing; Computer science; Economic order quantity; Linear programming; Set (abstract data type); Order (exchange); Vendor-managed inventory; Routing (electronic design automation); Branch and cut; Supply chain; Vehicle routing problem; Product (mathematics); Supply chain management; Mathematics; Operations management; Economics; Business","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Luca Bertazzi","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"M. Grazia Speranza","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02032142200990912,"gpt":0.2890078836574357,"spread":0.2686864616475266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891517,0.00168344,0.001747279,0.001127562,0.000991624,0.001735632,0.001971448,0.002599655,0.008339256],"category_scores_gemma":[0.003250452,0.001063727,0.0009267543,0.001965107,0.0006985285,0.001658119,0.001230264,0.002068748,0.0009955794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001762416,"about_ca_system_score_gemma":0.002573722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007885685,"about_ca_topic_score_gemma":0.007389176,"domain_scores_codex":[0.999122,0.0003877978,0.00003679685,0.0001567609,0.000154304,0.0001423066],"domain_scores_gemma":[0.9983143,0.001278874,0.0001048727,0.00005510407,0.0001551296,0.00009177773],"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.000123158,0.0001779967,0.0003482532,0.0001233005,0.00003797553,0.00009222465,0.00006567124,0.9254643,0.0005134252,0.01371935,0.003501456,0.05583303],"study_design_scores_gemma":[0.00005681417,0.00003284253,0.00004194819,0.00001019554,0.000008926593,0.00001517682,0.00001755482,0.9910942,0.0001617004,0.007711772,0.000844285,0.000004549277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01940219,0.0003985747,0.9725762,0.0005686253,0.00005288899,0.0002767355,0.000358078,0.0005573193,0.005809417],"genre_scores_gemma":[0.1158651,0.0003608709,0.8791915,0.0001482287,0.00004697202,0.000544472,0.0007874909,0.0001582129,0.002897108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008339256,"threshold_uncertainty_score":0.0278976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123789618","doi":"","title":"Construcción de aplicativo web para la gestión y prestación del servicio de ambulancias en la ciudad de Pereira, utilizando inteligencia artificial","year":2021,"lang":"es","type":"article","venue":"Repository Technological University of Pereira (Technological University of Pereira)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":353,"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; University of New Brunswick","funders":"","keywords":"Arc routing; Arc (geometry); Routing (electronic design automation); Computer science; Mathematical optimization; Operations research; Mathematics; Computer network; Geometry","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02668394925971116,"gpt":0.2532070197623499,"spread":0.2265230705026387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001807768,0.001076131,0.0005246671,0.001589948,0.001443935,0.005611002,0.001252785,0.001193408,0.006151654],"category_scores_gemma":[0.005454821,0.0006374047,0.0009810911,0.001001429,0.001346047,0.003761273,0.002653278,0.001548495,0.001750646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901408,"about_ca_system_score_gemma":0.004533323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02050495,"about_ca_topic_score_gemma":0.02010466,"domain_scores_codex":[0.9983377,0.0005221819,0.000142273,0.0002570045,0.0005676107,0.0001733036],"domain_scores_gemma":[0.997301,0.0007819916,0.0002050517,0.0004402245,0.0009989289,0.0002728481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002991007,0.0005544462,0.02059121,0.002693835,0.000231018,0.002145673,0.01123157,0.04134426,0.03517681,0.1522515,0.01981961,0.713661],"study_design_scores_gemma":[0.0001132427,0.000619335,0.02519432,0.001705978,0.0005108942,0.001780209,0.01138431,0.3288917,0.02539852,0.07721126,0.526907,0.0002832187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1374434,0.004962476,0.7296484,0.003032166,0.0004113352,0.001153238,0.0006182728,0.009091,0.1136398],"genre_scores_gemma":[0.5388985,0.00352445,0.4197343,0.0003596243,0.00007880529,0.0007100226,0.001120169,0.0006019011,0.03497225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02050495,"threshold_uncertainty_score":0.04077119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008806816","doi":"10.1016/s0377-2217(02)00915-3","title":"Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":347,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Vehicle routing problem; Fleet management; Time horizon; Field (mathematics); Routing (electronic design automation); Operations research; Routing algorithm; Algorithm; Emphasis (telecommunications); Mathematical optimization; Telecommunications; Computer network; Routing protocol; Engineering","authors":[{"name":"Gianpaolo Ghiani","is_ca":false},{"name":"Francesca Guerriero","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Roberto Musmanno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06723250682678367,"gpt":0.3664937950685185,"spread":0.2992612882417349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152663,0.00127267,0.0009910634,0.0007300333,0.0004562833,0.002255522,0.00203316,0.001260512,0.002978391],"category_scores_gemma":[0.00256635,0.0006201495,0.0006349612,0.002077117,0.001198607,0.002961275,0.0008503335,0.001742818,0.0007712969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001132238,"about_ca_system_score_gemma":0.0009728298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00228749,"about_ca_topic_score_gemma":0.002134189,"domain_scores_codex":[0.9995027,0.0001733819,0.00002404743,0.0001016265,0.0001511651,0.00004705205],"domain_scores_gemma":[0.9994654,0.0002637976,0.00006433149,0.00007034973,0.0001083509,0.00002778932],"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.00008676443,0.00007247207,0.0001797079,0.0002652623,0.00004172522,0.00004443572,0.00007751678,0.6362897,0.002135038,0.2363766,0.005538374,0.1188925],"study_design_scores_gemma":[0.00001523792,0.00001721805,0.00004151029,0.00001373466,0.000009864872,0.00003387509,0.00001749931,0.8948182,0.0005795049,0.1006011,0.003844366,0.00000783382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00269512,0.002241594,0.9915507,0.0004664412,0.0001044712,0.0000163522,0.00002312279,0.0001309557,0.002771316],"genre_scores_gemma":[0.2404726,0.00939317,0.7371466,0.0002968661,0.0006543234,0.0002336223,0.0001727692,0.0003271434,0.01130302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002978391,"threshold_uncertainty_score":0.009963691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046280257","doi":"10.1002/nav.20261","title":"What you should know about the vehicle routing problem","year":2007,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":324,"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":"Vehicle routing problem; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Algorithm; Computer network","authors":[{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1509400784947585,"gpt":0.4200791947934686,"spread":0.26913911629871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003842909,0.001045057,0.001231148,0.001261003,0.001550442,0.005553321,0.002030477,0.005131774,0.01805118],"category_scores_gemma":[0.02356099,0.0003978664,0.000912792,0.001749743,0.003768509,0.0191173,0.001401071,0.007782343,0.007928578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001425846,"about_ca_system_score_gemma":0.00173637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002690592,"about_ca_topic_score_gemma":0.001604719,"domain_scores_codex":[0.997458,0.001085774,0.0001618265,0.0004025258,0.0007235532,0.0001683006],"domain_scores_gemma":[0.9842726,0.009315971,0.0006647492,0.001008138,0.003773514,0.0009651515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002122225,0.0001769731,0.001708536,0.002596875,0.0001505252,0.0004004377,0.0005371238,0.006489118,0.0004033079,0.1765527,0.407414,0.4033581],"study_design_scores_gemma":[0.00003613751,0.00008411489,0.0006910006,0.00281481,0.00004649006,0.0007264665,0.001190465,0.00411091,0.0004049351,0.4763196,0.513501,0.00007397968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"review","genre_scores_codex":[0.003988977,0.2159455,0.07165062,0.6243197,0.03708114,0.00005251154,0.0005708003,0.000381103,0.04600963],"genre_scores_gemma":[0.1579559,0.3883091,0.08810495,0.2227243,0.08892414,0.0002166099,0.001419821,0.0006699429,0.05167528],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01805118,"threshold_uncertainty_score":0.06038719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126043710","doi":"10.1111/j.1937-5956.2012.01338.x","title":"Analysis of Travel Times and CO <sub>2</sub> Emissions in Time‐Dependent Vehicle Routing","year":2012,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":319,"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":"Vehicle routing problem; Fuel efficiency; Greenhouse gas; Context (archaeology); Computer science; Scheduling (production processes); Limiting; Operations research; Environmental economics; Transport engineering; Routing (electronic design automation); Environmental science; Automotive engineering; Operations management; Economics; Engineering","authors":[{"name":"Ola Jabali","is_ca":true},{"name":"A.G. de Kok","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01247377138778854,"gpt":0.2547284891803219,"spread":0.2422547177925333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007870641,0.0007357004,0.0003630034,0.0007447947,0.0002796473,0.000819004,0.0007895111,0.0007316529,0.001994291],"category_scores_gemma":[0.003281155,0.0004705427,0.0006793743,0.001101099,0.0004552575,0.0008684104,0.0002976288,0.0006584555,0.0001208017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002511638,"about_ca_system_score_gemma":0.0009415218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02077314,"about_ca_topic_score_gemma":0.01272479,"domain_scores_codex":[0.9995647,0.0001566702,0.00001427008,0.0000707181,0.00009069531,0.0001029702],"domain_scores_gemma":[0.9975823,0.001680773,0.000339857,0.00008464803,0.0002301382,0.00008222902],"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.00003081501,0.00001263947,0.0005122446,0.00001382654,0.0000131079,0.00001795929,0.000009531334,0.9945681,0.0007068545,0.002751865,0.0001182463,0.001244784],"study_design_scores_gemma":[0.00000178889,0.000008632847,0.0004510756,0.000001446732,0.000005173757,0.00000803204,0.00001210932,0.9982829,0.0002737893,0.0008418148,0.0001100354,0.000003197385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8195189,0.0005695216,0.170147,0.0005134571,0.00004403132,0.0000714123,0.0007024629,0.0002197188,0.008213497],"genre_scores_gemma":[0.9854503,0.0002008507,0.01154556,0.00002772759,0.00000627785,0.00003178265,0.0002565884,0.00004988477,0.002431177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02077314,"threshold_uncertainty_score":0.04130447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3122956505","doi":"10.1002/net.20177","title":"Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":310,"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":"Pickup; Computer science; Branch and cut; Vehicle routing problem; Set (abstract data type); Mathematical optimization; Limit (mathematics); Algorithm; Time limit; Running time; Integer programming; Mathematics; Routing (electronic design automation); Computer network; Engineering; Artificial intelligence","authors":[{"name":"Stefan Røpke","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01662834278793372,"gpt":0.2314751382640148,"spread":0.2148467954760811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003635863,0.00215142,0.002133409,0.001415931,0.001031131,0.003710793,0.002458785,0.002351137,0.008164994],"category_scores_gemma":[0.007110833,0.001793191,0.001631629,0.00254125,0.001441832,0.004132433,0.001740441,0.00377647,0.0007569885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0032,"about_ca_system_score_gemma":0.002538991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01087178,"about_ca_topic_score_gemma":0.007358776,"domain_scores_codex":[0.9983317,0.0008809216,0.00006390107,0.000204776,0.0002689625,0.0002496723],"domain_scores_gemma":[0.9953241,0.003777651,0.0003614108,0.0001344522,0.0002280554,0.0001744128],"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.00008504208,0.00006971102,0.0001711459,0.00005642012,0.00003061809,0.00003820166,0.00005113639,0.9426184,0.0001947682,0.04624123,0.001181663,0.009261613],"study_design_scores_gemma":[0.00002380794,0.00001565619,0.00002354054,0.000009629061,0.000007919782,0.000005808871,0.00001158898,0.9787162,0.0001114183,0.02048378,0.0005871232,0.000003547429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02977185,0.00145947,0.9590946,0.0006918155,0.0001037036,0.0001926568,0.0002937416,0.0002890999,0.008103068],"genre_scores_gemma":[0.4242588,0.00292712,0.5583687,0.0002412439,0.0002145001,0.001005683,0.0009442765,0.0002912959,0.01174831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01087178,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059559546","doi":"10.1287/trsc.35.4.375.10432","title":"Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":308,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew scheduling; Crew; Column generation; Scheduling (production processes); Integer programming; Mathematical optimization; Benders' decomposition; Engineering; Routing (electronic design automation); Branch and bound; Decomposition; Heuristic; Computer science; Iterated local search; Operations research; Metaheuristic; Aeronautics; Mathematics; Computer network","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Goran Stojković","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02012691727956976,"gpt":0.3079237455336067,"spread":0.287796828254037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344655,0.002002661,0.001471811,0.001253293,0.0005750505,0.001291895,0.0009872316,0.001197045,0.007737903],"category_scores_gemma":[0.002155819,0.001088224,0.001534789,0.001927138,0.0005065522,0.001165673,0.0008184056,0.001899898,0.001238312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00137337,"about_ca_system_score_gemma":0.001841119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007838444,"about_ca_topic_score_gemma":0.00836853,"domain_scores_codex":[0.9990358,0.0004182278,0.00003447212,0.0001546332,0.0002113394,0.000145525],"domain_scores_gemma":[0.9993892,0.0003803383,0.00007680285,0.00004290021,0.00006556441,0.00004517634],"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.0001299404,0.00009405935,0.0002362197,0.0001672902,0.00005565556,0.0000663189,0.0000697413,0.9251002,0.00168091,0.02703256,0.004038175,0.04132888],"study_design_scores_gemma":[0.00004430579,0.00004911183,0.0001293711,0.00001754956,0.00001521617,0.00002384734,0.00002391441,0.9718581,0.00052719,0.02361278,0.003688943,0.000009636747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01427108,0.0007987769,0.9747546,0.0002678141,0.00007856101,0.000214559,0.0005844328,0.0005700661,0.008460123],"genre_scores_gemma":[0.164467,0.001389364,0.8183726,0.0001393716,0.0001340971,0.0007587943,0.002063939,0.0003563692,0.01231851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007838444,"threshold_uncertainty_score":0.02588588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1650780448","doi":"10.1109/tase.2015.2461213","title":"Planning Paths for Package Delivery in Heterogeneous Multirobot Teams","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":295,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Truck; Scheduling (production processes); Computer science; Job shop scheduling; Motion planning; Mathematical optimization; Heuristic; Vehicle routing problem; Traveling purchaser problem; Task (project management); Graph; Shortest path problem; 2-opt; Distributed computing; Operations research; Routing (electronic design automation); Robot; Engineering; Artificial intelligence; Computer network; Theoretical computer science; Mathematics; Algorithm","authors":[{"name":"Neil Mathew","is_ca":true},{"name":"Stephen L. Smith","is_ca":true},{"name":"Steven L. Waslander","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03005034896176269,"gpt":0.2773482127765395,"spread":0.2472978638147768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876368,0.0008102757,0.0005694993,0.0006589835,0.0008734018,0.000723739,0.0009970816,0.000801007,0.003907723],"category_scores_gemma":[0.001659568,0.0004893978,0.000756306,0.0007253368,0.0006279902,0.001029924,0.001281454,0.0005839861,0.0004636467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009356978,"about_ca_system_score_gemma":0.0009470446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006788511,"about_ca_topic_score_gemma":0.005955796,"domain_scores_codex":[0.9997247,0.00008929311,0.00001129683,0.00007714111,0.00004528608,0.00005219908],"domain_scores_gemma":[0.9995782,0.0002566393,0.00005522674,0.00003575544,0.00003503038,0.00003924645],"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.00003949392,0.00002190498,0.0002950536,0.0000383289,0.00001342704,0.0000789174,0.00006720654,0.9764574,0.0005604206,0.005677409,0.0004822827,0.01626824],"study_design_scores_gemma":[0.00001235271,0.00003336437,0.0001020021,0.000004800464,0.000006080676,0.00001978688,0.00006702451,0.9901446,0.0005470666,0.007944616,0.001113091,0.000005238942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.051487,0.000124427,0.9454908,0.0001115702,0.00002120612,0.00008517473,0.0001148503,0.0002361166,0.002328916],"genre_scores_gemma":[0.5069221,0.000276711,0.4868301,0.00004577296,0.00001990595,0.000297022,0.0004807909,0.0001629918,0.004964559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006788511,"threshold_uncertainty_score":0.01349801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152304735","doi":"10.1023/a:1011336210885","title":"Variable Neighborhood Decomposition Search","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":291,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Variable neighborhood search; Metaheuristic; Local search (optimization); Descent (aeronautics); Mathematical optimization; Variable (mathematics); Node (physics); Gradient descent; Decomposition; Computer science; Local optimum; Algorithm; Mathematics; Artificial intelligence; Artificial neural network","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Dionisio Perez-Britos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01601429448935615,"gpt":0.2909555204022765,"spread":0.2749412259129203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008397948,0.0007308543,0.001346164,0.001189443,0.0008501987,0.001151011,0.001009304,0.001313914,0.0117669],"category_scores_gemma":[0.002976638,0.0007105193,0.0008246004,0.001257326,0.0007583617,0.001242996,0.0009921413,0.001308342,0.001449068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006955572,"about_ca_system_score_gemma":0.001037311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342286,"about_ca_topic_score_gemma":0.004327512,"domain_scores_codex":[0.9995141,0.0002167201,0.00001465332,0.00009970034,0.0001024715,0.00005235987],"domain_scores_gemma":[0.9994209,0.0003177328,0.00003564373,0.00008463098,0.0001060135,0.00003517771],"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.0002750498,0.0002165728,0.0008103232,0.0001521831,0.0001142569,0.00006522565,0.0001071005,0.5623479,0.001691158,0.09347977,0.02394345,0.3167969],"study_design_scores_gemma":[0.00005320726,0.00005991343,0.000146834,0.00002968924,0.00002411615,0.00003700827,0.00002534601,0.9695092,0.0005676379,0.02379402,0.005745017,0.000007869416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02367569,0.001328686,0.9366207,0.0005354781,0.0004037144,0.0001351745,0.0001952057,0.0004945616,0.03661082],"genre_scores_gemma":[0.2767416,0.0007174031,0.6928264,0.000403617,0.000195966,0.0003676661,0.0007025736,0.0003823941,0.02766237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0117669,"threshold_uncertainty_score":0.03936422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023482164","doi":"10.1287/opre.50.3.415.7751","title":"An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":282,"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; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Integer (computer science); Mathematical optimization; Computer science; Integer programming; Routing (electronic design automation); Operations research; TRIPS architecture; Mathematics","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"François Louveaux","is_ca":false},{"name":"Luc van Hamme","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07063186204221393,"gpt":0.3441733096093075,"spread":0.2735414475670935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228053,0.00127272,0.0008162195,0.0009563901,0.0006975752,0.001123042,0.001931292,0.001531297,0.00559072],"category_scores_gemma":[0.003229768,0.0005734054,0.0009541697,0.001226386,0.0007919793,0.001228211,0.001405983,0.00150131,0.001303108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510852,"about_ca_system_score_gemma":0.002272944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003487478,"about_ca_topic_score_gemma":0.004505265,"domain_scores_codex":[0.999275,0.0002462699,0.00003656128,0.0001603087,0.0001547776,0.0001270412],"domain_scores_gemma":[0.9992048,0.0003979319,0.0001200484,0.00008828114,0.0001288507,0.00006007771],"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.0004009783,0.0002714519,0.0007731057,0.0001690162,0.00005372412,0.0001340523,0.0002208667,0.5975805,0.004325187,0.04451222,0.01035451,0.3412044],"study_design_scores_gemma":[0.0000774475,0.0001016333,0.00007252665,0.00001991979,0.00001038325,0.00005507012,0.00003603288,0.983947,0.001220344,0.01090913,0.003536226,0.00001436535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006151945,0.0001050222,0.9889351,0.000215243,0.00004295121,0.00009754793,0.000066285,0.0005810854,0.003804858],"genre_scores_gemma":[0.07859681,0.0001144881,0.9174724,0.0002364251,0.00002566073,0.0003424039,0.0002982079,0.0001812416,0.002732388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00559072,"threshold_uncertainty_score":0.01870281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041183433","doi":"10.1287/opre.48.1.129.12455","title":"A Tabu Search Heuristic for the Capacitated arc Routing Problem","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":278,"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":"Arc routing; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Routing (electronic design automation); Computer science; Heuristic; Arc (geometry); Vehicle routing problem; Guided Local Search; Operations research; Mathematics; Computer network","authors":[{"name":"Alain Hertz","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Michel Mittaz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09081247834877422,"gpt":0.380172694943396,"spread":0.2893602165946217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987519,0.001179339,0.001333235,0.00212998,0.001307837,0.001541015,0.001822309,0.001907767,0.009327731],"category_scores_gemma":[0.00384791,0.0006399369,0.0009967126,0.004459372,0.0008457687,0.00137482,0.0009246195,0.00128552,0.00240915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433795,"about_ca_system_score_gemma":0.00195216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008599272,"about_ca_topic_score_gemma":0.007976663,"domain_scores_codex":[0.9991865,0.0004154255,0.00002425761,0.0000958309,0.0001527272,0.0001252671],"domain_scores_gemma":[0.9988387,0.000716011,0.0001029486,0.0001010083,0.0001872747,0.00005403809],"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.0001697272,0.0002354119,0.0005416672,0.0002259959,0.00008014071,0.0001186286,0.0001047297,0.718159,0.001304543,0.01371425,0.01970162,0.2456442],"study_design_scores_gemma":[0.00007605346,0.0001314863,0.0002704266,0.00005326555,0.00003629008,0.00008471513,0.00005642496,0.9834442,0.0009438155,0.00830187,0.006573922,0.00002747534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06774749,0.005774642,0.8828891,0.0009682736,0.0005433288,0.0008681667,0.001814306,0.005207073,0.03418778],"genre_scores_gemma":[0.253492,0.001971334,0.7283376,0.0005527455,0.0001533758,0.00124485,0.002753682,0.0007637619,0.01073062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009327731,"threshold_uncertainty_score":0.0312044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098090443","doi":"10.1287/trsc.1040.0103","title":"A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":273,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Benchmark (surveying); Algorithm; Computer science; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Residual; Route planning; Mathematics; Computer network","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"M. Grazia Speranza","is_ca":false},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01970802792664043,"gpt":0.2744546307225553,"spread":0.2547466027959149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065057,0.000990817,0.00100013,0.001122452,0.00093657,0.001024953,0.001305698,0.001205682,0.00801649],"category_scores_gemma":[0.002062394,0.0005186138,0.0007391861,0.002135758,0.0005978679,0.001035474,0.0008725617,0.001269393,0.002485376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007121965,"about_ca_system_score_gemma":0.001303614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004545253,"about_ca_topic_score_gemma":0.004394821,"domain_scores_codex":[0.9994844,0.0001989348,0.00002092926,0.00006983156,0.0001666289,0.0000591783],"domain_scores_gemma":[0.9996361,0.0001784877,0.00003354395,0.00004203929,0.00009229334,0.00001768063],"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.0001090863,0.0001544529,0.0004671993,0.0002491245,0.00007884741,0.0001117985,0.0001569923,0.5209718,0.003549822,0.03234218,0.01714841,0.4246604],"study_design_scores_gemma":[0.00008952298,0.0001064324,0.0002278717,0.00003820201,0.00003192388,0.0001571019,0.00004984254,0.9586847,0.001490791,0.0201511,0.01894943,0.00002308822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008983225,0.00098965,0.9779889,0.0002278461,0.0001013106,0.0002209327,0.0002962517,0.001772376,0.009419561],"genre_scores_gemma":[0.06337054,0.0005983866,0.9297497,0.0001419755,0.00004399271,0.0004388265,0.0006018922,0.0003406681,0.004713966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00801649,"threshold_uncertainty_score":0.02681786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099860183","doi":"10.1016/j.ejor.2009.06.034","title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":272,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Column generation; Mathematical optimization; Benchmark (surveying); Computer science; Routing (electronic design automation); Shortest path problem; Lagrangian relaxation; Set (abstract data type); Linear programming; Dynamic programming; Mathematics; Computer network","authors":[{"name":"Nabila Azi","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.06359111993787328,"gpt":0.3323522610403489,"spread":0.2687611411024756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487884,0.001258173,0.002036127,0.00103484,0.0009845992,0.001666775,0.002606223,0.002307818,0.007029866],"category_scores_gemma":[0.004315475,0.001147106,0.001221938,0.001800454,0.0009736504,0.002542959,0.001932048,0.001597118,0.0008752876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001955867,"about_ca_system_score_gemma":0.004140304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01419672,"about_ca_topic_score_gemma":0.01386775,"domain_scores_codex":[0.9991114,0.000167688,0.00004631195,0.0002125901,0.0002832191,0.0001787585],"domain_scores_gemma":[0.9985691,0.000911638,0.00009627333,0.0001431073,0.0002047463,0.00007501143],"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.0001563863,0.0001157026,0.0002842391,0.0001227311,0.00004515421,0.00007079786,0.00007073577,0.8553041,0.001014554,0.01712256,0.002945725,0.1227473],"study_design_scores_gemma":[0.00005834566,0.00002738369,0.00006027841,0.000007411865,0.00001217564,0.00002494432,0.00001474179,0.9895362,0.0001779637,0.009289299,0.0007844,0.000006894368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009460258,0.0002856512,0.9856397,0.0001988297,0.0001207305,0.0001080652,0.0001019637,0.0005628989,0.003521799],"genre_scores_gemma":[0.1395732,0.0003111245,0.8550409,0.000143575,0.00009920709,0.0003588284,0.0002407567,0.0001525176,0.004079866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01419672,"threshold_uncertainty_score":0.02822816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2884929083","doi":"10.1016/j.ijpe.2018.07.016","title":"Electric vehicle routing problem with recharging stations for minimizing energy consumption","year":2018,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":269,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; McMaster University","funders":"","keywords":"Energy consumption; Computer science; Heuristics; Vehicle routing problem; Greenhouse gas; Electric vehicle; Routing (electronic design automation); Mathematical optimization; Automotive engineering; Engineering; Computer network; Electrical engineering; Mathematics; Power (physics)","authors":[{"name":"Shuai Zhang","is_ca":true},{"name":"Yuvraj Gajpal","is_ca":true},{"name":"S. S. Appadoo","is_ca":true},{"name":"M.M.S. Abdulkader","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02196577315842007,"gpt":0.2677034716093187,"spread":0.2457376984508987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008894684,0.001890896,0.001724597,0.0008359302,0.0006039335,0.001695903,0.001984905,0.002619583,0.008419918],"category_scores_gemma":[0.001957082,0.0009415325,0.001167942,0.001430721,0.0006625951,0.001657089,0.000858242,0.001181424,0.0005964322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245542,"about_ca_system_score_gemma":0.001198613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005382704,"about_ca_topic_score_gemma":0.003883973,"domain_scores_codex":[0.9995615,0.0001829636,0.00001379804,0.0001146777,0.00005807371,0.00006902787],"domain_scores_gemma":[0.9995435,0.0002832834,0.00005121543,0.00002650411,0.00006142622,0.00003391725],"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.00007919654,0.00005105599,0.000186191,0.00007425741,0.00003684643,0.0001146857,0.00002280323,0.9799999,0.0006933903,0.00879083,0.001471203,0.008479541],"study_design_scores_gemma":[0.00003066755,0.00005347965,0.0001241515,0.000008660548,0.00003033423,0.00003490011,0.00003313238,0.9913809,0.0003998618,0.006763302,0.001133018,0.000007523186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09504169,0.0007140898,0.8705143,0.001692405,0.0003054695,0.0003800513,0.0009021446,0.0004022553,0.03004747],"genre_scores_gemma":[0.8044582,0.0007308566,0.1501571,0.0002702566,0.000192447,0.0004088742,0.000739592,0.0002464101,0.0427962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008419918,"threshold_uncertainty_score":0.02816749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2332834184","doi":"10.1016/j.ejor.2016.03.040","title":"An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Synchronization (alternating current); Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Real-time computing; Operations research; Computer network; Mathematics","authors":[{"name":"Philippe Grangier","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Fabien Lehuédé","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0590928165349166,"gpt":0.340670755225449,"spread":0.2815779386905324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001270712,0.0006153531,0.001586115,0.0007224252,0.0004777396,0.0008293975,0.001830282,0.001663534,0.002531434],"category_scores_gemma":[0.004022388,0.0005950771,0.0006216469,0.000804402,0.0007424799,0.00138904,0.00149802,0.0009332791,0.00021199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008120207,"about_ca_system_score_gemma":0.001187538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008650142,"about_ca_topic_score_gemma":0.006238843,"domain_scores_codex":[0.9996347,0.000179651,0.00001333913,0.00007105825,0.00006215325,0.00003895683],"domain_scores_gemma":[0.9984167,0.001204434,0.0001253429,0.00004367632,0.0001250717,0.00008477541],"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.00007383151,0.0000328002,0.00022999,0.00003670752,0.00002226797,0.00003157435,0.00002343311,0.9837168,0.0002465935,0.005921503,0.0007885314,0.008875942],"study_design_scores_gemma":[0.000008346438,0.0000125384,0.00002111799,0.000001753705,0.000001853495,0.000002897996,0.000004361815,0.9990014,0.00001861384,0.0008315084,0.00009424696,0.000001352883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04585023,0.0006483452,0.9476935,0.0005380745,0.0001193924,0.00009318136,0.00009830478,0.0001235402,0.004835544],"genre_scores_gemma":[0.7330157,0.000500758,0.2581994,0.0001907303,0.0001108746,0.0003763909,0.000275901,0.0001000386,0.007230172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008650142,"threshold_uncertainty_score":0.01719964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081363577","doi":"10.1016/j.trb.2014.09.008","title":"The fleet size and mix pollution-routing problem","year":2014,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Fuel efficiency; Benchmark (surveying); Routing (electronic design automation); Computer science; Pollution; Homogeneous; Transport engineering; Operations research; Metaheuristic; Environmental economics; Environmental science; Engineering; Economics; Automotive engineering; Mathematics; Computer network","authors":[{"name":"Çağrı Koç","is_ca":false},{"name":"Tolga Bektaş","is_ca":false},{"name":"Ola Jabali","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2067050982487565,"gpt":0.4203752284752951,"spread":0.2136701302265386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002315861,0.001206058,0.001578468,0.001585481,0.0007399695,0.002087231,0.002798802,0.002917435,0.007943418],"category_scores_gemma":[0.007394777,0.001248973,0.001392283,0.002353922,0.001442513,0.004553952,0.002264538,0.001572895,0.0003711251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002693094,"about_ca_system_score_gemma":0.00124193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006024558,"about_ca_topic_score_gemma":0.006050033,"domain_scores_codex":[0.9984572,0.0007314784,0.0000469825,0.0003623986,0.0002533504,0.0001485683],"domain_scores_gemma":[0.9970968,0.002148962,0.0002874648,0.000115539,0.0001553483,0.0001959095],"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.0001393509,0.0001136983,0.001696809,0.0002075883,0.0001604578,0.0002986715,0.00007459805,0.8564366,0.001054799,0.1206947,0.003412765,0.01570998],"study_design_scores_gemma":[0.00004953318,0.00007818398,0.001262874,0.00002505238,0.00007178329,0.0001832451,0.00009876021,0.8672934,0.0006002436,0.1265353,0.003775867,0.00002582757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1488646,0.00126059,0.8055262,0.004447536,0.0002242715,0.0002258878,0.001945885,0.000255972,0.03724914],"genre_scores_gemma":[0.8146506,0.001152592,0.1385741,0.0004452341,0.0003019583,0.000390854,0.0008748284,0.0002877454,0.04332199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007943418,"threshold_uncertainty_score":0.02657342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136611127","doi":"10.1287/trsc.1060.0187","title":"Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":260,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Tabu search; Mathematical optimization; Vehicle routing problem; Routing (electronic design automation); Heuristics; Metaheuristic; Computer science; Relaxation (psychology); Heuristic; Local search (optimization); Mathematics; Computer network","authors":[{"name":"Christian Prins","is_ca":false},{"name":"Caroline Prodhon","is_ca":false},{"name":"Ángel Ruiz","is_ca":true},{"name":"Patrick Soriano","is_ca":true},{"name":"Roberto Wolfler Calvo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01782215380448123,"gpt":0.2770757188440929,"spread":0.2592535650396117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133452,0.0008051686,0.001021371,0.001023378,0.0005338847,0.001215558,0.001672167,0.001264395,0.002647427],"category_scores_gemma":[0.001977241,0.0006608,0.0007428936,0.001890322,0.0006208204,0.0009570121,0.0008012983,0.0007616233,0.0004102292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009698563,"about_ca_system_score_gemma":0.001663171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007916004,"about_ca_topic_score_gemma":0.00724509,"domain_scores_codex":[0.9993207,0.0003188008,0.00002171214,0.0000792129,0.0001439586,0.0001156218],"domain_scores_gemma":[0.9993686,0.000376045,0.00008594104,0.00008097409,0.00005411592,0.00003440063],"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.00006799828,0.00006222504,0.0002912495,0.00004543884,0.00002648648,0.00004500928,0.00005321035,0.9683143,0.0006685,0.00574737,0.0008142503,0.02386388],"study_design_scores_gemma":[0.0000265588,0.00002428324,0.00005749457,0.000006423945,0.000009067979,0.00001415901,0.00002335151,0.9968432,0.0002407758,0.002310338,0.0004407227,0.000003638703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039776,0.0004751849,0.8840522,0.000262922,0.00003843413,0.0001895118,0.0001592935,0.0009419507,0.009902953],"genre_scores_gemma":[0.5816013,0.0002607675,0.4149249,0.0001178646,0.00002695933,0.0004128485,0.0003113197,0.0001222232,0.002221673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007916004,"threshold_uncertainty_score":0.01573986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943956374","doi":"10.1155/2019/5075671","title":"A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":259,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"European Regional Development Fund; Hrvatska Zaklada za Znanost","keywords":"Vehicle routing problem; Heuristics; Computer science; Algorithm; Electric vehicle; Greenhouse gas; Operations research; Routing (electronic design automation); Mathematics; Physics","authors":[{"name":"Tomislav Erdelić","is_ca":false},{"name":"Tonči Carić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02666724517741675,"gpt":0.2407231984742481,"spread":0.2140559532968313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002173841,0.003583003,0.002557393,0.002751697,0.0008721976,0.003804682,0.003163745,0.002854873,0.004875193],"category_scores_gemma":[0.003973243,0.001291447,0.003015516,0.009270006,0.0009767039,0.004473417,0.002011585,0.003118649,0.00182144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634973,"about_ca_system_score_gemma":0.002237418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004232106,"about_ca_topic_score_gemma":0.002767505,"domain_scores_codex":[0.9979303,0.0005884366,0.0002050038,0.0005774631,0.0005147008,0.0001840712],"domain_scores_gemma":[0.9983667,0.001106251,0.0001132107,0.0001113943,0.0002373176,0.00006526189],"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.0001690779,0.0004167664,0.001565685,0.006901474,0.0003157681,0.0002994924,0.0002929781,0.1568954,0.001126363,0.08262657,0.04015636,0.7092341],"study_design_scores_gemma":[0.0001179431,0.0006236405,0.002227675,0.002646765,0.000368829,0.001518873,0.0008768564,0.4193073,0.001077063,0.2480454,0.3230286,0.0001610755],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.008394098,0.4450507,0.5011335,0.00372751,0.001646528,0.0003053274,0.000728637,0.0004859494,0.03852778],"genre_scores_gemma":[0.09194732,0.552095,0.3326697,0.001967404,0.004378202,0.0006491488,0.003002037,0.0004653738,0.01282577],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004875193,"threshold_uncertainty_score":0.01630908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108911946","doi":"10.1287/ijoc.2013.0550","title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Routing (electronic design automation); Index (typography); Production (economics); Branch and cut; Algorithm; Order (exchange); Enumeration; Integer programming; Operations research; Mathematics; Economics","authors":[{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Raf Jans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02831864026295009,"gpt":0.2741303086561243,"spread":0.2458116683931742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001985895,0.002059252,0.002040935,0.001531191,0.0008625737,0.00246641,0.002196633,0.001955056,0.006907423],"category_scores_gemma":[0.004341541,0.001073559,0.001281625,0.002945084,0.0009260601,0.002029324,0.001493097,0.003097437,0.001057476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792751,"about_ca_system_score_gemma":0.002303587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005980784,"about_ca_topic_score_gemma":0.005287342,"domain_scores_codex":[0.9988397,0.0004122475,0.00006844925,0.0002062371,0.0003285257,0.0001448979],"domain_scores_gemma":[0.9980329,0.001302887,0.0002067745,0.00009721113,0.0002851956,0.00007501413],"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.00005178081,0.00009166099,0.0002091327,0.0001303935,0.00003556495,0.00006055823,0.0000496114,0.9157146,0.0004507655,0.02783003,0.002638188,0.05273772],"study_design_scores_gemma":[0.00002726143,0.00002076739,0.00003591346,0.00001671918,0.000009413842,0.0000193143,0.00002273975,0.9794589,0.0002489371,0.01855033,0.001583911,0.000005807394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005575381,0.0007061398,0.9879746,0.0003066277,0.00006188166,0.0001483937,0.0001877104,0.0002799911,0.004759222],"genre_scores_gemma":[0.09317124,0.001086393,0.90005,0.000181538,0.0001224281,0.0006261446,0.0007101484,0.0002129716,0.00383911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006907423,"threshold_uncertainty_score":0.02310765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088243692","doi":"10.1007/s10288-008-0089-1","title":"Variable neighbourhood search: methods and applications","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Metaheuristic; Heuristics; Neighbourhood (mathematics); Mathematical optimization; Computer science; Variable neighborhood search; Tabu search; Variable (mathematics); Heuristic; Simulated annealing; Local search (optimization); Mathematics","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"José Andrés Moreno Pérez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03730997085608331,"gpt":0.3194639916222266,"spread":0.2821540207661433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475628,0.0006947499,0.001042906,0.001202156,0.000482896,0.001068124,0.00122457,0.00162568,0.004807254],"category_scores_gemma":[0.005246222,0.0004552846,0.0007011039,0.00185817,0.0008759905,0.001389503,0.001006443,0.001223565,0.001135182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005329819,"about_ca_system_score_gemma":0.0006317463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0033493,"about_ca_topic_score_gemma":0.003381332,"domain_scores_codex":[0.9993861,0.0003298396,0.00002071503,0.00008203197,0.000152161,0.00002914954],"domain_scores_gemma":[0.9985356,0.001036251,0.00008548537,0.0001049639,0.0002050539,0.00003259682],"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.00008900173,0.00007178227,0.0007054405,0.0004281713,0.00009937433,0.00005905201,0.0001545398,0.4518483,0.001102727,0.249188,0.008991936,0.2872617],"study_design_scores_gemma":[0.00002014391,0.0000226773,0.0001726921,0.00004266532,0.00001449791,0.0000292084,0.00001849401,0.9183522,0.0003288665,0.07247429,0.008510866,0.0000132434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002614791,0.002825878,0.9895813,0.0002082227,0.0001343887,0.00002331416,0.00005256989,0.0001056986,0.004453821],"genre_scores_gemma":[0.1639588,0.005924525,0.8004272,0.0002028272,0.0003692336,0.0003956422,0.0002956014,0.0002614584,0.02816475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004807254,"threshold_uncertainty_score":0.01608187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481088856","doi":"10.1016/s0927-0507(06)14006-2","title":"Chapter 6 Vehicle Routing","year":2006,"lang":"en","type":"book-chapter","venue":"Handbooks in operations research and management science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":257,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Computer network","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Martin Savelsbergh","is_ca":false},{"name":"Daniele Vigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0595897319446535,"gpt":0.3357477211135783,"spread":0.2761579891689248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002056379,0.001533766,0.0007636317,0.001519454,0.0008534372,0.002136906,0.001455104,0.001303074,0.1799611],"category_scores_gemma":[0.0005483979,0.0006363022,0.0007623578,0.001638777,0.0003804002,0.002163578,0.001146754,0.001928918,0.1051263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009041068,"about_ca_system_score_gemma":0.00108614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001994103,"about_ca_topic_score_gemma":0.003413538,"domain_scores_codex":[0.9996554,0.00002461629,0.00001145177,0.00006418522,0.0002159064,0.00002846087],"domain_scores_gemma":[0.999872,0.00001673519,0.000005106921,0.00002614238,0.0000668057,0.00001321564],"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.00002321645,0.00009560903,0.00007081114,0.0003700542,0.00001319252,0.00006615397,0.00009829709,0.007034966,0.002702305,0.09330861,0.458802,0.4374148],"study_design_scores_gemma":[0.00000262791,0.00001476695,0.00007316523,0.0001050118,0.000005281252,0.00007629902,0.00002406359,0.001168509,0.0007721387,0.01738159,0.980369,0.00000742665],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0006330682,0.01170971,0.06158827,0.000994273,0.003470978,0.0001300531,0.001156076,0.001799792,0.9185177],"genre_scores_gemma":[0.004648298,0.009489235,0.01612923,0.0004007593,0.0004973591,0.00008956215,0.001583447,0.0005108563,0.9666512],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1799611,"threshold_uncertainty_score":0.60203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125883116","doi":"10.1287/mnsc.2020.3741","title":"On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors","year":2020,"lang":"en","type":"article","venue":"Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":252,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Heuristics; Unobservable; Vehicle routing problem; Operations research; Order (exchange); Last mile (transportation); Analytics; Big data; Service provider; Routing (electronic design automation); Mathematical optimization; Service (business); Data mining; Mile; Econometrics; Engineering","authors":[{"name":"Sheng Liu","is_ca":true},{"name":"Long He","is_ca":false},{"name":"Zuo‐Jun Max Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008366144430866654,"gpt":0.2046425094906613,"spread":0.1962763650597946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003951196,0.001107789,0.00151356,0.0006990443,0.0004325092,0.001291129,0.001821637,0.001064207,0.00252378],"category_scores_gemma":[0.01405188,0.0007817028,0.000589882,0.001327291,0.0007813106,0.002137948,0.001078693,0.002471139,0.0003290554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001694783,"about_ca_system_score_gemma":0.002408282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02183948,"about_ca_topic_score_gemma":0.01401398,"domain_scores_codex":[0.9988841,0.0005639038,0.00003151159,0.0002196205,0.0001329848,0.0001677224],"domain_scores_gemma":[0.9935603,0.004416728,0.0008318271,0.0004123456,0.0004873643,0.0002913373],"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.00006206209,0.00006331701,0.001260837,0.0000264268,0.00001841207,0.00001582142,0.00001319612,0.9856445,0.0001004167,0.003561653,0.0004671031,0.008766322],"study_design_scores_gemma":[0.000003730815,0.00001821081,0.0001811663,0.00000248997,0.000004485295,0.000002537048,0.000005092189,0.9983674,0.00008294012,0.001212073,0.0001173498,0.000002547573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1739284,0.001049828,0.8181576,0.001981943,0.000192905,0.0001486198,0.0007214821,0.0005375013,0.003281842],"genre_scores_gemma":[0.9247585,0.0006268418,0.07057907,0.0001501297,0.0001430598,0.0001092548,0.0005282921,0.00008449396,0.003020346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02183948,"threshold_uncertainty_score":0.04342473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955472062","doi":"10.1016/j.trb.2019.06.006","title":"The electric vehicle routing problem with energy consumption uncertainty","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":249,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Energy consumption; Context (archaeology); Electric vehicle; Routing (electronic design automation); Operations research; Robust optimization; Engineering; Mathematics","authors":[{"name":"Samuel Pelletier","is_ca":true},{"name":"Ola Jabali","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1688924189623227,"gpt":0.3911624713733028,"spread":0.2222700524109801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002159944,0.0008665559,0.001061704,0.0006411448,0.0003891479,0.001815764,0.001433354,0.001608711,0.002072253],"category_scores_gemma":[0.006438216,0.0008274044,0.0008547592,0.001445501,0.001217607,0.003252249,0.001137627,0.001470015,0.0001178162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00177966,"about_ca_system_score_gemma":0.001195244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005462497,"about_ca_topic_score_gemma":0.00302104,"domain_scores_codex":[0.9989408,0.0005314805,0.00003392843,0.0002608114,0.0001456122,0.00008732464],"domain_scores_gemma":[0.9976904,0.001905219,0.0001765801,0.00006628819,0.0001049298,0.0000565234],"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.00003205632,0.00002093615,0.0002587735,0.00005856047,0.00004252795,0.00007160461,0.00002445556,0.9167082,0.0001410206,0.07630053,0.0006745745,0.005666779],"study_design_scores_gemma":[0.00001171841,0.00001774254,0.0001940379,0.00001459718,0.00001958739,0.00003226968,0.00003612454,0.9047297,0.0001488465,0.09338602,0.001398375,0.00001108981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05116072,0.001670474,0.9294297,0.003095882,0.0001718823,0.0000487785,0.0004601896,0.00005698995,0.01390551],"genre_scores_gemma":[0.8849723,0.002270167,0.09470975,0.0003175606,0.000291584,0.0001359829,0.0004602487,0.00009645295,0.01674595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005462497,"threshold_uncertainty_score":0.01291239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2233419640","doi":"10.1016/j.cor.2015.06.001","title":"Time-dependent routing problems: A review","year":2015,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":244,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tree traversal; Arc routing; Computer science; Time horizon; Routing (electronic design automation); Graph traversal; Arc (geometry); Point (geometry); Graph; Vehicle routing problem; Point of interest; Field (mathematics); Operations research; Node (physics); Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Computer network; Mathematics","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Gianpaolo Ghiani","is_ca":true},{"name":"Emanuela Guerriero","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1917023661751183,"gpt":0.4491348750788929,"spread":0.2574325089037747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000969794,0.001603336,0.002386082,0.003050872,0.0003461133,0.001875827,0.001692825,0.001460462,0.004582291],"category_scores_gemma":[0.0017567,0.0007447791,0.001038897,0.005805187,0.0005710446,0.002776269,0.001047698,0.001425451,0.001823466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932989,"about_ca_system_score_gemma":0.00193281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001770032,"about_ca_topic_score_gemma":0.002598157,"domain_scores_codex":[0.9996295,0.00005033829,0.00006048954,0.00008698458,0.0001424803,0.00003009606],"domain_scores_gemma":[0.9990308,0.0005655774,0.0001073679,0.00003195762,0.000217686,0.00004656339],"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.00006852335,0.000159393,0.0003276085,0.03108327,0.0002114556,0.0001009877,0.00004657067,0.004867695,0.0009088966,0.008222591,0.03076406,0.9232389],"study_design_scores_gemma":[0.00005191172,0.0002086288,0.00117921,0.01049597,0.0006453964,0.0008933257,0.0001484862,0.004063651,0.0009353583,0.01234947,0.9689311,0.00009751473],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002080859,0.9966454,0.001757949,0.0001615381,0.0002293608,0.00000893683,0.00004057201,0.00001427219,0.0009338382],"genre_scores_gemma":[0.001045633,0.9966034,0.001507922,0.00009380416,0.0002326729,0.000008369528,0.00005949338,0.000004311938,0.0004444055],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004582291,"threshold_uncertainty_score":0.0153293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108538642","doi":"10.1287/trsc.34.4.426.12325","title":"Diversion Issues in Real-Time Vehicle Dispatching","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":238,"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; Computer Research Institute of Montréal","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Heuristic; Vehicle routing problem; Operations research; Routing (electronic design automation); Service (business); Engineering; Computer network; Operations management; Algorithm","authors":[{"name":"Soumia Ichoua","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.0119139913638161,"gpt":0.2780669214422083,"spread":0.2661529300783922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752811,0.0005339024,0.0004756577,0.0004980149,0.0005970661,0.001193327,0.0006667341,0.0007549425,0.002106861],"category_scores_gemma":[0.003599459,0.0003072995,0.0002576207,0.000839168,0.001206741,0.001667442,0.0008218999,0.0008371754,0.0001887483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007837348,"about_ca_system_score_gemma":0.0005346811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001528156,"about_ca_topic_score_gemma":0.001121286,"domain_scores_codex":[0.9991745,0.0004807265,0.00002598079,0.00006076671,0.0001770197,0.00008099682],"domain_scores_gemma":[0.9985219,0.001001967,0.0002069366,0.00007274958,0.0001300228,0.0000665956],"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.00009761817,0.00002700626,0.0005716063,0.00006379022,0.00001800924,0.0001397136,0.0001367948,0.9244711,0.001240424,0.02562557,0.0006962345,0.04691222],"study_design_scores_gemma":[0.00001620057,0.00008514462,0.0002888765,0.00002060009,0.000008750337,0.0001150521,0.0001192058,0.9573106,0.001277707,0.03806095,0.002682624,0.00001430474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2009622,0.005477774,0.7705454,0.001359523,0.0001558945,0.00008707456,0.00004458145,0.0002549627,0.02111266],"genre_scores_gemma":[0.9631982,0.001096461,0.03179807,0.00008866586,0.00007733899,0.00004007365,0.00002779068,0.00003865579,0.003634654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002106861,"threshold_uncertainty_score":0.009269834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157158960","doi":"10.1287/opre.1110.0965","title":"Benders Decomposition for Large-Scale Uncapacitated Hub Location","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Robustness (evolution); Heuristic; Computer science; Decomposition; Set (abstract data type); Algorithm; Reduction (mathematics); Mathematics","authors":[{"name":"Ivan Contreras","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1269248190035982,"gpt":0.4001214067080162,"spread":0.273196587704418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009744178,0.001303367,0.0009531085,0.0007526155,0.0005448179,0.0008629271,0.001030734,0.0008528079,0.00545474],"category_scores_gemma":[0.002173779,0.0007350396,0.0008554542,0.0009974655,0.0006363771,0.001053094,0.0009800782,0.001675806,0.001091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009059009,"about_ca_system_score_gemma":0.001363834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00260539,"about_ca_topic_score_gemma":0.00356355,"domain_scores_codex":[0.9994701,0.0001982258,0.00001889613,0.00008277058,0.0001719627,0.00005808302],"domain_scores_gemma":[0.9994697,0.000326948,0.00005376171,0.00006431102,0.00006097306,0.00002436766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005094583,0.00004043258,0.0001352936,0.0001091508,0.00002345834,0.00005907571,0.0000364033,0.9081748,0.001414805,0.03064162,0.002230324,0.05708377],"study_design_scores_gemma":[0.00001556563,0.00001619173,0.00004637254,0.000009517466,0.000004685288,0.000017772,0.0000119236,0.9762891,0.0005731061,0.02120681,0.001803807,0.000005201997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00460643,0.0001371319,0.991832,0.00009065852,0.00002488,0.00005595513,0.00007258963,0.0002863232,0.002894117],"genre_scores_gemma":[0.1175781,0.0003407945,0.8764148,0.00006270266,0.00005131238,0.0003186561,0.0004602954,0.0002520203,0.00452132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00545474,"threshold_uncertainty_score":0.01824796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980175144","doi":"10.1016/j.trb.2003.09.002","title":"Waiting strategies for the dynamic pickup and delivery problem with time windows","year":2003,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":229,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Simon Fraser University","funders":"","keywords":"Pickup; Computer science; Dynamic problem; Algorithm; Artificial intelligence","authors":[{"name":"Snežana Mitrović-Minić","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1976879323996146,"gpt":0.3989842575124488,"spread":0.2012963251128342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003557443,0.001749946,0.001977903,0.001204975,0.0008813521,0.002609198,0.004552763,0.002120265,0.01102505],"category_scores_gemma":[0.008368527,0.001794538,0.001388915,0.001539516,0.00139281,0.004777981,0.001586854,0.002877125,0.000925993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002522469,"about_ca_system_score_gemma":0.002485829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01049474,"about_ca_topic_score_gemma":0.004856254,"domain_scores_codex":[0.9987952,0.0003521874,0.00006827904,0.0002249437,0.0002041702,0.0003553251],"domain_scores_gemma":[0.9955383,0.003348734,0.0003769597,0.0001108489,0.0002658546,0.0003593765],"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.0003725222,0.0001868558,0.0005069888,0.0003558989,0.0001006484,0.000192602,0.0002623492,0.743203,0.002309134,0.2265262,0.004088144,0.02189555],"study_design_scores_gemma":[0.00004393116,0.00006440777,0.0001386761,0.00002070689,0.00004020028,0.00002621959,0.00006790604,0.961058,0.0003150348,0.03706487,0.001138086,0.00002208227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06303912,0.001613362,0.9253428,0.001065678,0.0001965901,0.0001515447,0.0002825632,0.0002239488,0.008084352],"genre_scores_gemma":[0.7876517,0.002976698,0.1551345,0.0003602321,0.0003290384,0.0004467264,0.0006228813,0.0005221351,0.05195621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01102505,"threshold_uncertainty_score":0.03688246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046064436","doi":"10.1016/j.cor.2011.09.021","title":"A parallel iterated tabu search heuristic for vehicle routing problems","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":228,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Heuristics; Guided Local Search; Iterated local search; Heuristic; Incremental heuristic search; Computer science; Mathematics; Algorithm; Routing (electronic design automation); Beam search; Search algorithm","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Mirko Maischberger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1569513745849268,"gpt":0.3647560928907695,"spread":0.2078047183058427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106107,0.0007375948,0.00130878,0.001041164,0.0009304917,0.001027521,0.002209227,0.001460049,0.006515986],"category_scores_gemma":[0.002407031,0.0007594213,0.001052002,0.001536332,0.0006667115,0.00097248,0.0009422271,0.00102985,0.001161791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009523034,"about_ca_system_score_gemma":0.001710612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009492086,"about_ca_topic_score_gemma":0.008440282,"domain_scores_codex":[0.999447,0.0002105125,0.00002272343,0.00006134916,0.0001750361,0.00008335128],"domain_scores_gemma":[0.9992322,0.0003985355,0.00005160857,0.000102852,0.0001766139,0.00003826524],"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.0002197942,0.0001444948,0.0002902786,0.0000923784,0.00006085139,0.00007263397,0.00005477729,0.8706467,0.002035625,0.005246831,0.003144546,0.1179911],"study_design_scores_gemma":[0.00006109828,0.00005080334,0.00006398272,0.000005574361,0.00001462377,0.00001408894,0.000008145987,0.9969929,0.0003492407,0.001738445,0.0006952293,0.000005863967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08097167,0.0009272585,0.8910635,0.0003757457,0.0004047716,0.0004009917,0.0002423455,0.00273513,0.0228786],"genre_scores_gemma":[0.3372993,0.0003142759,0.6543365,0.0002084897,0.0001137238,0.0006300909,0.000291134,0.00044084,0.00636579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009492086,"threshold_uncertainty_score":0.02179813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135680984","doi":"10.1287/trsc.1070.0223","title":"Tabu Search, Partial Elementarity, and Generalized <i>k</i>-Path Inequalities for the Vehicle Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Tabu search; Mathematical optimization; Benchmark (surveying); Generalization; Heuristic; Routing (electronic design automation); Path (computing); Set (abstract data type); Computer science; Relaxation (psychology); Shortest path problem; Mathematics; Graph; Theoretical computer science","authors":[{"name":"Guy Desaulniers","is_ca":true},{"name":"François Lessard","is_ca":true},{"name":"Ahmed Hadjar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03526509438761437,"gpt":0.2763590414941016,"spread":0.2410939471064872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508993,0.001421567,0.0009618422,0.001120099,0.000595175,0.001411768,0.001522246,0.001037508,0.004516162],"category_scores_gemma":[0.006394053,0.0005059646,0.001074006,0.002681453,0.001515343,0.001887312,0.001066274,0.002461868,0.0003799711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001534865,"about_ca_system_score_gemma":0.001972693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007191292,"about_ca_topic_score_gemma":0.008210295,"domain_scores_codex":[0.9990096,0.0004858437,0.00003105744,0.0000975019,0.0002150323,0.000160883],"domain_scores_gemma":[0.9974174,0.001969033,0.0003067331,0.0001249124,0.0001206467,0.00006119259],"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.0001383801,0.00009248943,0.000622934,0.0002842276,0.00007658741,0.0000995233,0.00009799285,0.825759,0.0008936346,0.1241485,0.003517582,0.04426929],"study_design_scores_gemma":[0.00003882135,0.00007792945,0.0003067595,0.00004095955,0.00002280668,0.00004063568,0.00003265418,0.9305932,0.0007524157,0.06581043,0.002266987,0.00001635046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0908509,0.002650295,0.8796239,0.001104003,0.0001311461,0.0002441196,0.0006875446,0.0003527004,0.02435532],"genre_scores_gemma":[0.5558431,0.002670863,0.4331247,0.0004038009,0.0002250433,0.000578347,0.001314114,0.0002459171,0.005594268],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007191292,"threshold_uncertainty_score":0.01510805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055819286","doi":"10.1007/s00291-008-0135-6","title":"Dynamic transportation of patients in hospitals","year":2008,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":224,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Heuristic; Context (archaeology); Scheme (mathematics); Tabu search; Service (business); Quality (philosophy); Operations research; Simple (philosophy); Phase (matter); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","authors":[{"name":"Alexandre Beaudry","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Teresa Melo","is_ca":false},{"name":"Stefan Nickel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006537182786802548,"gpt":0.2320161659181334,"spread":0.2254789831313309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000932931,0.000828136,0.0008791319,0.0008369875,0.0006751707,0.001592588,0.001483577,0.001355633,0.006257386],"category_scores_gemma":[0.002989781,0.0005997913,0.0007197325,0.001317941,0.0006338584,0.001616691,0.001197942,0.0008678553,0.0004036323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002110756,"about_ca_system_score_gemma":0.001568545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01640225,"about_ca_topic_score_gemma":0.01146315,"domain_scores_codex":[0.998983,0.0005091749,0.00002674675,0.0001960597,0.00008713582,0.0001978126],"domain_scores_gemma":[0.999398,0.0003171643,0.000100802,0.00002912013,0.00006423862,0.00009074757],"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.0001079366,0.00004721792,0.001248959,0.00003184754,0.00003534836,0.00009162916,0.00005254103,0.9676051,0.0002267982,0.0157627,0.002331654,0.01245824],"study_design_scores_gemma":[0.00001552986,0.00002986827,0.0003936088,0.000008800956,0.00001504398,0.00003126621,0.0001775679,0.9870589,0.0001041326,0.01107561,0.001082094,0.000007524735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2753653,0.0009324872,0.6878406,0.004564086,0.0004632289,0.0002140437,0.001282305,0.0003481369,0.02898985],"genre_scores_gemma":[0.9706391,0.0003342812,0.02073829,0.0001430477,0.00007578848,0.00007966117,0.0003529814,0.00005259275,0.007584411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01640225,"threshold_uncertainty_score":0.03261358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}