{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":201,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":201,"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":"a271bf8dbb5b","filters":{"venue":"Transportation Science"}},"results":[{"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":"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":"W2096658257","doi":"10.1287/trsc.1090.0279","title":"Models for Evaluating and Planning City Logistics Systems","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":641,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"City logistics; Consolidation (business); Scheduling (production processes); Humanitarian Logistics; Traffic management; Computer science; Integrated business planning; Integrated logistics support; Operations research; Transport engineering; Business; Process management; Operations management; Engineering; Marketing","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Nicoletta Ricciardi","is_ca":false},{"name":"Giovanni Storchi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.161385543755704,"gpt":0.3205551225706211,"spread":0.1591695788149171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003595623,0.002616734,0.002275707,0.001789038,0.0009428059,0.00435608,0.003445285,0.003850735,0.00814967],"category_scores_gemma":[0.01047288,0.001223896,0.001605372,0.002787161,0.001837709,0.004074086,0.002133834,0.002786944,0.0007897689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005320536,"about_ca_system_score_gemma":0.003150274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01813234,"about_ca_topic_score_gemma":0.01794964,"domain_scores_codex":[0.9978599,0.001132359,0.0001097511,0.000278494,0.0003697679,0.0002496885],"domain_scores_gemma":[0.9950432,0.003550553,0.000496545,0.0001901963,0.0005008601,0.000218675],"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.000009588804,0.0000129522,0.0001654082,0.00004237102,0.00002183188,0.00003329954,0.000025823,0.9477713,0.00004996056,0.0484012,0.0007915817,0.002674706],"study_design_scores_gemma":[0.00001163181,0.00001059386,0.00005843292,0.00001598647,0.00001079967,0.000009492152,0.000024907,0.9571862,0.00004453919,0.04098528,0.001634068,0.000007955228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01412833,0.001695389,0.9601554,0.001850759,0.0001536802,0.0002871309,0.001370175,0.0003943779,0.0199647],"genre_scores_gemma":[0.6523756,0.004842842,0.3182386,0.0003870832,0.0004662378,0.001960902,0.002216805,0.0002979363,0.0192139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01813234,"threshold_uncertainty_score":0.03860337,"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":"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":"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":"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":"W1968350460","doi":"10.1287/trsc.1050.0120","title":"Models and Tabu Search Heuristics for the Berth-Allocation Problem","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":397,"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":"HEC Montréal; Università della Calabria; Canada Research Chairs","keywords":"Tabu search; Heuristics; Mathematical optimization; Heuristic; Schedule; Computer science; Set (abstract data type); Minification; Branch and bound; Operations research; Mathematics","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Pasquale Legato","is_ca":false},{"name":"Luigi Moccia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03399212553211606,"gpt":0.2645859461542923,"spread":0.2305938206221762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001799547,0.001667003,0.001577944,0.00164968,0.0009565519,0.00337773,0.002592917,0.002834974,0.009198117],"category_scores_gemma":[0.006490262,0.001345048,0.001201108,0.003916352,0.001552867,0.002355394,0.001010171,0.002261715,0.001723666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002972597,"about_ca_system_score_gemma":0.002338525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01558359,"about_ca_topic_score_gemma":0.02008783,"domain_scores_codex":[0.9985312,0.0009926127,0.00003393393,0.00009710527,0.0001716477,0.0001734903],"domain_scores_gemma":[0.9963375,0.00301431,0.0002443898,0.0001477931,0.0001798777,0.00007617257],"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.00005919874,0.00005246574,0.00009866923,0.00006078533,0.00001838893,0.00002503223,0.00003859751,0.9679201,0.00007514596,0.02243512,0.001380917,0.007835607],"study_design_scores_gemma":[0.00003208699,0.00002069893,0.00003076113,0.00001681722,0.000006415686,0.000008784395,0.00001920781,0.9852945,0.00005926626,0.01354185,0.0009630829,0.000006594755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05453035,0.004713257,0.901874,0.001294023,0.0002530637,0.0004831157,0.001343532,0.001811285,0.03369738],"genre_scores_gemma":[0.4257572,0.003824427,0.5527963,0.0005212599,0.000165248,0.001661579,0.001629577,0.0005751093,0.01306924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01558359,"threshold_uncertainty_score":0.03098571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126475333","doi":"10.1287/trsc.1050.0145","title":"A Tabu Search Algorithm for a Routing and Container Loading Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":325,"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é de Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Routing (electronic design automation); Guided Local Search; Container (type theory); Mathematical optimization; Algorithm; Computer science; Search algorithm; Engineering; Mathematics; Computer network","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Manuel Iori","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Silvano Martello","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01246921401535756,"gpt":0.2430320924813416,"spread":0.2305628784659841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822031,0.001092812,0.00112681,0.001349825,0.001286182,0.001418491,0.001364897,0.001756059,0.007635905],"category_scores_gemma":[0.003337154,0.0006538049,0.000761508,0.002842076,0.0007096059,0.001142463,0.0008388798,0.001264742,0.002276864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001077711,"about_ca_system_score_gemma":0.001967238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007160286,"about_ca_topic_score_gemma":0.006328925,"domain_scores_codex":[0.9993473,0.0003022372,0.00002367413,0.00008463507,0.000161459,0.00008066622],"domain_scores_gemma":[0.9991793,0.0004943598,0.00006374173,0.0000725594,0.0001624211,0.00002760068],"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.0001685032,0.0001910073,0.000646781,0.0001985476,0.00008634017,0.0001074126,0.0001653344,0.6205952,0.002604345,0.02608142,0.0145433,0.3346118],"study_design_scores_gemma":[0.0000661987,0.00007690865,0.0001873426,0.00002781494,0.00002611649,0.00007823207,0.00004477805,0.9830898,0.001113994,0.008182419,0.007089355,0.00001698558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02012994,0.0008638652,0.9615005,0.0003124666,0.0001150293,0.0002755292,0.0003469399,0.00327769,0.01317803],"genre_scores_gemma":[0.09944912,0.0003798855,0.89443,0.0001742635,0.00004163772,0.0004989229,0.0006602907,0.000483373,0.00388241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007635905,"threshold_uncertainty_score":0.02554458,"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":"W2255469947","doi":"10.1287/trsc.2015.0646","title":"50th Anniversary Invited Article—Goods Distribution with Electric Vehicles: Review and Research Perspectives","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":299,"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":"Popularity; Distribution (mathematics); Electric vehicle; Marketing; Transport engineering; Market research; Business; Driving range; Engineering; Industrial organization; Operations research; Political science","authors":[{"name":"Samuel Pelletier","is_ca":true},{"name":"Ola Jabali","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01209062669391626,"gpt":0.2664546609831448,"spread":0.2543640342892285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348368,0.0009728756,0.001523257,0.004616802,0.0004036718,0.002340189,0.001392759,0.002308493,0.01615194],"category_scores_gemma":[0.002913821,0.0003945493,0.0008114997,0.004673,0.0006634264,0.003560039,0.001645404,0.002513784,0.007722639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019125,"about_ca_system_score_gemma":0.001371064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159167,"about_ca_topic_score_gemma":0.002336084,"domain_scores_codex":[0.9994403,0.00008110997,0.00008958238,0.000126315,0.0001998824,0.00006277737],"domain_scores_gemma":[0.9973711,0.0008743976,0.0003369068,0.0000588184,0.001041871,0.0003169076],"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.0002250295,0.0001716829,0.0007067688,0.02260252,0.0001792749,0.0005276981,0.0001568368,0.0004791435,0.001932401,0.004383174,0.5238361,0.4447993],"study_design_scores_gemma":[0.000009513935,0.0001001279,0.001143586,0.004835499,0.0001262352,0.0005974142,0.00008341655,0.00008651255,0.0003115229,0.000904001,0.9917779,0.00002415584],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002399661,0.9769186,0.0001276199,0.00318126,0.01636475,0.000007721251,0.00005701973,0.00001426612,0.003088765],"genre_scores_gemma":[0.00225874,0.9665571,0.0002123443,0.002577297,0.02373482,0.00001460327,0.000152125,0.00001217517,0.004480728],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01615194,"threshold_uncertainty_score":0.05403358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134422508","doi":"10.1287/trsc.1030.0065","title":"Designing a Road Network for Hazardous Materials Transportation","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":290,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"McGill University","funders":"McGill University","keywords":"Hazardous waste; Deregulation; Dangerous goods; Transport engineering; Bilevel optimization; Government (linguistics); Business; Risk analysis (engineering); Flow network; Transport network; Engineering; Environmental planning; Computer science; Economics; Environmental science; Waste management; Optimization problem","authors":[{"name":"Bahar Y. Kara","is_ca":false},{"name":"Vedat Verter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07623691227594778,"gpt":0.3678143486371205,"spread":0.2915774363611727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002851,0.0007046923,0.0005514688,0.001974516,0.001639286,0.001459687,0.001357356,0.00145821,0.006630275],"category_scores_gemma":[0.00265217,0.0006030184,0.0006246867,0.001578917,0.0009014102,0.001856715,0.001454947,0.0005850574,0.001055451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002900469,"about_ca_system_score_gemma":0.00372545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0261616,"about_ca_topic_score_gemma":0.0483422,"domain_scores_codex":[0.9990552,0.000392837,0.00003089104,0.0001829723,0.0001752796,0.0001628483],"domain_scores_gemma":[0.9991553,0.0002466234,0.000113559,0.00005547358,0.0003164057,0.0001126994],"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.00007844138,0.00008538956,0.001487931,0.0001283152,0.00002709574,0.0002186348,0.0002035985,0.9013855,0.00634742,0.0479939,0.001804086,0.04023968],"study_design_scores_gemma":[0.00003749312,0.000121042,0.0006045399,0.00003031506,0.00004401167,0.00009564275,0.0004468997,0.9587766,0.00325073,0.02259446,0.01396677,0.00003157026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05772084,0.0001593291,0.919227,0.00049598,0.00005042162,0.0004514961,0.0002848535,0.0003811867,0.02122894],"genre_scores_gemma":[0.5269989,0.0005354995,0.4581453,0.00006710105,0.00002148015,0.0006424043,0.0004180702,0.0001158081,0.01305549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0261616,"threshold_uncertainty_score":0.05201864,"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":"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":"W2070175767","doi":"10.1287/trsc.1050.0114","title":"Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":245,"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; Université Laval","funders":"","keywords":"Exploit; Probabilistic logic; Vehicle routing problem; Computer science; Operations research; Real-time data; Field (mathematics); Travel time; Routing (electronic design automation); Transport engineering; Engineering; Computer security; Artificial intelligence; Computer network","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.008531559982207816,"gpt":0.2504757629453988,"spread":0.241944202963191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008486,0.0009236552,0.0009240853,0.0005682351,0.0004050487,0.001502539,0.001520535,0.001188385,0.00156127],"category_scores_gemma":[0.009942055,0.0007130923,0.0004437228,0.0007428674,0.0007646548,0.004113669,0.0008115066,0.001463114,0.0003137447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007389562,"about_ca_system_score_gemma":0.0009890825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003732371,"about_ca_topic_score_gemma":0.004378244,"domain_scores_codex":[0.9993609,0.0002333394,0.00004013412,0.0001304776,0.000139248,0.00009585988],"domain_scores_gemma":[0.9934481,0.004694683,0.0007109775,0.0005405062,0.0003929891,0.0002128732],"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.0001573356,0.00003941504,0.001363987,0.00003465254,0.00002128075,0.00005863511,0.00004271499,0.9832955,0.001047818,0.002925847,0.000233694,0.01077919],"study_design_scores_gemma":[0.00001131731,0.00003631787,0.0005637142,0.000003227384,0.00001042379,0.00002200644,0.00002052805,0.9941788,0.0007096138,0.004244151,0.0001882471,0.00001171372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2910648,0.0002773495,0.7033927,0.0009969819,0.00006969929,0.00004782182,0.0004119579,0.0003685435,0.003370004],"genre_scores_gemma":[0.9822891,0.0001170776,0.01698367,0.00002830449,0.0000271727,0.00001682429,0.000173734,0.00002378777,0.0003403184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003732371,"threshold_uncertainty_score":0.01062202,"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":"W2163826616","doi":"10.1287/trsc.1030.0045","title":"Existence, Uniqueness, and Trip Cost Function Properties of User Equilibrium in the Bottleneck Model with Multiple User Classes","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":235,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Bottleneck; Uniqueness; Schedule; Travel time; Function (biology); Unit (ring theory); Computer science; Mathematical optimization; Unit of time; Total cost; Retard; Average cost; Operations research; Mathematics; Transport engineering; Economics; Engineering; Microeconomics","authors":[{"name":"Robin Lindsey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04486344256649982,"gpt":0.279911263394904,"spread":0.2350478208284042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002442995,0.0005985824,0.001526443,0.001167481,0.000876958,0.001552059,0.001978152,0.001239667,0.007585525],"category_scores_gemma":[0.01129107,0.0006170071,0.001152511,0.0008571388,0.00160271,0.003563416,0.001625221,0.001207039,0.0005764691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00159924,"about_ca_system_score_gemma":0.001361467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006307074,"about_ca_topic_score_gemma":0.003750534,"domain_scores_codex":[0.9988519,0.0004052103,0.00003801459,0.0001933369,0.0001562249,0.000355357],"domain_scores_gemma":[0.9940399,0.003589936,0.0009045528,0.0003064128,0.0007362316,0.0004230585],"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.0005741164,0.000249721,0.009837572,0.0002005623,0.0001502175,0.0005459331,0.0006832714,0.5368451,0.004218196,0.4255461,0.002180159,0.01896899],"study_design_scores_gemma":[0.00003980313,0.00009001393,0.001953842,0.00002333029,0.00004323231,0.0002146838,0.0003566305,0.909267,0.0006608865,0.08659411,0.0007085157,0.00004801252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4891902,0.0003072112,0.4979082,0.000692499,0.00001872721,0.0001073606,0.0004265632,0.0001541031,0.01119512],"genre_scores_gemma":[0.9836507,0.0001901171,0.01335186,0.0000334022,0.00001727873,0.0001248895,0.0001065343,0.00002676558,0.00249835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007585525,"threshold_uncertainty_score":0.02537608,"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":"W1978976115","doi":"10.1287/trsc.1090.0262","title":"An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":225,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Heuristics; Linear programming; Revenue management; Column generation; Computer science; Heuristic; Markov decision process; Bellman equation; Multinomial logistic regression; Affine transformation; Revenue; Operations research; Markov process; Mathematics; Economics","authors":[{"name":"Dan Zhang","is_ca":true},{"name":"Daniel Adelman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01442272745720435,"gpt":0.2521892451499171,"spread":0.2377665176927128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885785,0.001041111,0.001494719,0.0008544901,0.0005693061,0.001817009,0.001996069,0.001436202,0.004779652],"category_scores_gemma":[0.005504318,0.0009001884,0.0008760217,0.001640271,0.001148316,0.002011775,0.001179119,0.001732594,0.0003720029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002684568,"about_ca_system_score_gemma":0.002289945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01331386,"about_ca_topic_score_gemma":0.009778366,"domain_scores_codex":[0.9986759,0.0006734658,0.00003079353,0.0001743475,0.0002652158,0.0001801519],"domain_scores_gemma":[0.9980021,0.001523205,0.0001423394,0.00009004406,0.0001509153,0.00009135134],"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.00001601929,0.0000203613,0.00009435453,0.00001599651,0.000009752812,0.00001726939,0.00001359707,0.9826041,0.00006870903,0.01278364,0.0002528099,0.004103381],"study_design_scores_gemma":[0.00000418034,0.000006293299,0.00001279909,0.00000199301,0.000002061704,0.00000390202,0.000004229455,0.9937402,0.00003666201,0.006008324,0.0001776519,0.000001632643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01593851,0.0002806533,0.9779772,0.0003942056,0.00003149531,0.00009149776,0.0001081239,0.0001523578,0.005026092],"genre_scores_gemma":[0.627753,0.0006339215,0.3637281,0.0002199002,0.00009389759,0.0005189269,0.0002483618,0.0001290951,0.006674801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01331386,"threshold_uncertainty_score":0.02647275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114778474","doi":"10.1287/trsc.1120.0443","title":"Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":201,"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":"Heuristics; Mathematical optimization; Benchmark (surveying); Routing (electronic design automation); Heuristic; Computer science; Production (economics); Set (abstract data type); Vehicle routing problem; 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.03499057401878422,"gpt":0.297467522666346,"spread":0.2624769486475618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001088624,0.000649779,0.001079176,0.0006971592,0.0005123175,0.0005268445,0.0009448,0.0008741715,0.001718062],"category_scores_gemma":[0.002797355,0.0004046952,0.0004571054,0.0009032553,0.0005832293,0.0009222179,0.0006578094,0.0008588082,0.0002284145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008024222,"about_ca_system_score_gemma":0.001029518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005361679,"about_ca_topic_score_gemma":0.00610383,"domain_scores_codex":[0.9995074,0.0002778631,0.00001623434,0.00007316025,0.00008769606,0.00003764139],"domain_scores_gemma":[0.9988651,0.0008857664,0.00009511603,0.00003681434,0.00008167361,0.00003546063],"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.00003204753,0.00003488561,0.0001646341,0.00002909212,0.00001392585,0.00002874205,0.00001666274,0.9795958,0.0003175355,0.004339445,0.0006323771,0.01479486],"study_design_scores_gemma":[0.000009629697,0.00001390226,0.00002799729,0.000002717111,0.00000246945,0.000006851589,0.000004505443,0.9977399,0.0000812255,0.001857432,0.0002514458,0.000001889726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02602937,0.0007032398,0.9686342,0.0002389456,0.00004536858,0.0001095021,0.00004887731,0.0002170305,0.003973462],"genre_scores_gemma":[0.4572096,0.0005932886,0.5379686,0.0001647313,0.00006297237,0.0005060084,0.0002607591,0.0001175943,0.00311658],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005361679,"threshold_uncertainty_score":0.01066095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035893651","doi":"10.1287/trsc.35.4.345.10433","title":"A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":199,"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; Université de Montréal","funders":"","keywords":"Toll; Bilevel optimization; Mathematical optimization; Flow network; Revenue; Set (abstract data type); Computer science; Mathematics; Operations research; Optimization problem; Economics","authors":[{"name":"Luce Brotcorne","is_ca":false},{"name":"Martine Labbé","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06522803791999959,"gpt":0.3404594592474697,"spread":0.2752314213274701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247971,0.001312879,0.002385564,0.001007348,0.0009370463,0.003811897,0.002119642,0.002807047,0.005464072],"category_scores_gemma":[0.004010227,0.0008806632,0.001226023,0.003241339,0.001630759,0.003372974,0.002235448,0.002738939,0.0009400186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001967514,"about_ca_system_score_gemma":0.001811739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009147476,"about_ca_topic_score_gemma":0.007445169,"domain_scores_codex":[0.9987198,0.000487895,0.00005023793,0.0002730672,0.000202811,0.0002662562],"domain_scores_gemma":[0.999023,0.0005001792,0.0001358996,0.00005810777,0.0001658693,0.0001169592],"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.00004344544,0.00004292418,0.0002174054,0.00009044717,0.0000278511,0.00009493864,0.00006561586,0.9081237,0.00030798,0.08404746,0.0009323212,0.006005914],"study_design_scores_gemma":[0.00001589402,0.00002617531,0.00004196944,0.00001229273,0.00001043658,0.00002183245,0.00002861177,0.9434953,0.00007691546,0.05475046,0.001510932,0.000009211035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02948159,0.0009417697,0.9539737,0.0008920732,0.00009092328,0.0000692204,0.0004428676,0.0001878801,0.01392012],"genre_scores_gemma":[0.7735924,0.002187644,0.198567,0.0002589464,0.0001814157,0.0004279581,0.0008895924,0.0001571909,0.02373793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009147476,"threshold_uncertainty_score":0.01827914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128178859","doi":"10.1287/trsc.1090.0265","title":"A Study of Demand Stochasticity in Service Network Design","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":199,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Consolidation (business); Flexibility (engineering); A priori and a posteriori; Computer science; Service (business); Operations research; Mathematical optimization; Demand patterns; Engineering; Economics; Demand management; Business; Mathematics; Marketing","authors":[{"name":"Arnt-Gunnar Lium","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Stein W. Wallace","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05179541063175576,"gpt":0.3351415942230508,"spread":0.2833461835912951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294497,0.0005763535,0.0006603899,0.0004374037,0.0004849471,0.001149963,0.0007492586,0.001023816,0.001673665],"category_scores_gemma":[0.01028551,0.0007150747,0.000628592,0.0006804798,0.001420032,0.002177679,0.001051892,0.00148919,0.00009119914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001739769,"about_ca_system_score_gemma":0.0009575622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002912781,"about_ca_topic_score_gemma":0.001930411,"domain_scores_codex":[0.998569,0.0008125019,0.00004479901,0.000137932,0.0002973611,0.0001383702],"domain_scores_gemma":[0.9938571,0.004822352,0.0005235557,0.0001983375,0.0004147655,0.0001838788],"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.00003299534,0.00002200046,0.0007848235,0.00005682659,0.00002183272,0.00006519657,0.00008660906,0.8493326,0.0008673503,0.1440907,0.0002761717,0.004362884],"study_design_scores_gemma":[0.000008411245,0.00003590296,0.0002488699,0.00001230935,0.000008182189,0.0000284472,0.0000369971,0.9241416,0.0002715985,0.07434262,0.0008574469,0.000007608506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.082851,0.0005073605,0.9083697,0.001231353,0.00004483827,0.0000263619,0.00007320439,0.00004378193,0.006852399],"genre_scores_gemma":[0.9719751,0.0004725447,0.025851,0.0001014081,0.00006442302,0.00003658767,0.00004616706,0.00003075431,0.001421893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00294497,"threshold_uncertainty_score":0.01557469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124521189","doi":"10.1287/trsc.1060.0166","title":"Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":198,"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":"Norges Forskningsråd","keywords":"Vehicle routing problem; Heuristic; Mathematical optimization; Stochastic programming; Routing (electronic design automation); Sample (material); Dynamic programming; Problem statement; Computer science; Statement (logic); Operations research; Mathematics; Engineering; Management science","authors":[{"name":"Lars Magnus Hvattum","is_ca":false},{"name":"Arne Løkketangen","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007078761078080346,"gpt":0.2323668125458855,"spread":0.2252880514678052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001879069,0.0008365083,0.001363209,0.0007185582,0.0003493746,0.0009497494,0.001313202,0.001650904,0.002535275],"category_scores_gemma":[0.002855649,0.0008664763,0.0007306865,0.0009938793,0.0008112759,0.001120176,0.0007776716,0.001025256,0.0001613109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001021783,"about_ca_system_score_gemma":0.001571245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005138972,"about_ca_topic_score_gemma":0.00437988,"domain_scores_codex":[0.9994239,0.000302112,0.00002342157,0.00009917879,0.0000688387,0.00008254391],"domain_scores_gemma":[0.9981592,0.001427347,0.0001360607,0.00007466276,0.0001105393,0.00009218142],"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.0000256262,0.00002187444,0.0001165332,0.00001417524,0.00001392732,0.0000209681,0.00001016225,0.9932066,0.0001064006,0.002640014,0.0001525327,0.003671204],"study_design_scores_gemma":[0.00001160976,0.00001666296,0.00003360328,0.000001942752,0.000003924466,0.000004306407,0.000006428269,0.9978472,0.00006182734,0.001923884,0.00008625045,0.000002355687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09429652,0.0003001849,0.9005771,0.0003500133,0.0000372205,0.0001564345,0.0001294406,0.0001876872,0.00396533],"genre_scores_gemma":[0.7317626,0.0001891189,0.2652012,0.0001051062,0.00003813497,0.0003158856,0.0002138029,0.0000525949,0.002121584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005138972,"threshold_uncertainty_score":0.01021808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170216278","doi":"10.1287/trsc.35.3.286.10153","title":"Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew scheduling; Scheduling (production processes); Column generation; Mathematical optimization; Homogeneous; Computer science; Crew; Heuristic; Branch and bound; Job shop scheduling; Operations research; Engineering; Mathematics; Schedule","authors":[{"name":"Knut Haase","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01521100390485595,"gpt":0.2606463954007527,"spread":0.2454353914958968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190102,0.0005901457,0.0005920079,0.0004850047,0.0005336603,0.0007793598,0.0007632032,0.0006598359,0.002033137],"category_scores_gemma":[0.001303066,0.0005101677,0.0003920741,0.0008756696,0.0005446951,0.0007352746,0.000653114,0.0004190064,0.0001958765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006282689,"about_ca_system_score_gemma":0.001049465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01064962,"about_ca_topic_score_gemma":0.01381348,"domain_scores_codex":[0.9995477,0.0001958072,0.00001044677,0.00006200995,0.0001041349,0.00007983472],"domain_scores_gemma":[0.9995547,0.0002955034,0.00005638264,0.00003128112,0.00002939355,0.00003265789],"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.00007251973,0.00003356105,0.0003617093,0.00004723379,0.00001745672,0.00009795913,0.00004948893,0.969735,0.001554731,0.006294996,0.0004484087,0.02128705],"study_design_scores_gemma":[0.00001732888,0.00004143418,0.0002044118,0.000002596286,0.000005752499,0.00002598284,0.00002809053,0.9950368,0.0007247835,0.003186414,0.0007229301,0.000003419514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2221713,0.0004580714,0.768676,0.0002209889,0.00004042417,0.0001618153,0.0001792075,0.000424267,0.007667804],"genre_scores_gemma":[0.9039826,0.0002277769,0.09225532,0.00002863606,0.0000313871,0.00009371449,0.0001407632,0.00004261429,0.003197244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064962,"threshold_uncertainty_score":0.02117527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130310388","doi":"10.1287/trsc.34.2.165.12303","title":"Catastrophe Avoidance Models for Hazardous Materials Route Planning","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":188,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Hazardous waste; Population; Computer science; Catastrophe theory; Network model; Function (biology); Mathematical model; Variance (accounting); Path (computing); Operations research; Mathematical optimization; Engineering; Economics; Mathematics; Data mining","authors":[{"name":"Erhan Erkut","is_ca":true},{"name":"Ármann Ingólfsson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1103022939366786,"gpt":0.3918502167928551,"spread":0.2815479228561765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009630403,0.00121081,0.00117048,0.000949616,0.0007954983,0.001562514,0.002027326,0.001859465,0.006316908],"category_scores_gemma":[0.002848191,0.0004984302,0.001474094,0.001174621,0.001373314,0.001723408,0.001353625,0.001945857,0.0005709045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792765,"about_ca_system_score_gemma":0.001171998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008660513,"about_ca_topic_score_gemma":0.009270798,"domain_scores_codex":[0.9994559,0.0002233125,0.00001950235,0.00007839328,0.0001173527,0.0001054993],"domain_scores_gemma":[0.9989809,0.0006109574,0.0001710089,0.00004240508,0.0001090793,0.00008555695],"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.00001389218,0.00002141485,0.0002047119,0.00002841019,0.00001565361,0.00004433517,0.00005989059,0.8937762,0.0001558378,0.1025348,0.0009662093,0.002178651],"study_design_scores_gemma":[0.00001045414,0.00001903342,0.000113926,0.000008654173,0.00001141768,0.00002222019,0.00002752875,0.9156139,0.00004543943,0.08301593,0.001101982,0.000009576511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05557371,0.001465007,0.9133039,0.001619402,0.0001598043,0.0001239724,0.0004564668,0.0002088871,0.0270889],"genre_scores_gemma":[0.8807173,0.002688497,0.09168971,0.0003466089,0.0002280954,0.000470961,0.00045225,0.0001089407,0.02329753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008660513,"threshold_uncertainty_score":0.02113211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150889816","doi":"10.1287/trsc.34.2.133.12308","title":"A Benders Decomposition Approach for the Locomotive and Car Assignment Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":173,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lagrangian relaxation; Decomposition; Column generation; Integer programming; Benders' decomposition; Mathematical optimization; Decomposition method (queueing theory); Simplex algorithm; Context (archaeology); Linear programming relaxation; Computer science; Dynamic programming; Linear programming; Set (abstract data type); Engineering; Mathematics","authors":[{"name":"Jean‐François Cordeau","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.01422500301572305,"gpt":0.2400552185029919,"spread":0.2258302154872689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391064,0.002671767,0.001522569,0.001564194,0.000752868,0.001328525,0.001142452,0.001788028,0.006606546],"category_scores_gemma":[0.001867346,0.001114655,0.00203372,0.001999393,0.0006854505,0.001644659,0.001162089,0.002926039,0.001438163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110634,"about_ca_system_score_gemma":0.001968104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003789101,"about_ca_topic_score_gemma":0.004288601,"domain_scores_codex":[0.9990036,0.0004165608,0.00004229131,0.0001869954,0.0002428663,0.000107826],"domain_scores_gemma":[0.9995686,0.0002385855,0.00005298117,0.00003319831,0.00006767399,0.00003886246],"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.00007237577,0.0001326341,0.0002750531,0.000289774,0.0001089006,0.000130802,0.0001103639,0.8152722,0.003233144,0.07094666,0.006243726,0.1031844],"study_design_scores_gemma":[0.00003847752,0.00008461023,0.0001629983,0.00004593151,0.0000360236,0.0001180042,0.0000445845,0.9350231,0.0009155512,0.05091731,0.01258911,0.00002435785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002030299,0.0003315064,0.9936092,0.0001426094,0.00004961215,0.00008010329,0.00009597848,0.0001113508,0.003549376],"genre_scores_gemma":[0.05066623,0.001362786,0.9401605,0.0001496269,0.0001276711,0.0004316235,0.0005328192,0.000112633,0.006456096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006606546,"threshold_uncertainty_score":0.0221011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2524034199","doi":"10.1287/trsc.2016.0709","title":"50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":147,"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é du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Operations research; Stochastic modelling; Service (business); Sketch; Key (lock); Stochastic process; Stochastic optimization; Mathematical optimization; Management science; Engineering; Mathematics; Marketing; Computer security; Algorithm; Computer network; Business","authors":[{"name":"Michel Gendreau","is_ca":true},{"name":"Ola Jabali","is_ca":true},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03834316816566709,"gpt":0.3306429495440477,"spread":0.2922997813783806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003937583,0.0009095732,0.0009573067,0.001680095,0.0007390294,0.003763048,0.001666691,0.002795822,0.03648148],"category_scores_gemma":[0.006003482,0.0003798811,0.0009186141,0.001714067,0.00096631,0.004830914,0.00184788,0.003641583,0.01243004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001922377,"about_ca_system_score_gemma":0.001206944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363173,"about_ca_topic_score_gemma":0.00203306,"domain_scores_codex":[0.9988279,0.0003404679,0.00006344601,0.0002262381,0.0003883775,0.0001535494],"domain_scores_gemma":[0.9959114,0.001723631,0.0001754124,0.0002394388,0.001266212,0.0006839567],"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.0001665539,0.0001298632,0.0005983287,0.0009032469,0.00005417657,0.0002005852,0.00008703169,0.006871957,0.001051363,0.101451,0.5623961,0.3260897],"study_design_scores_gemma":[0.00001504062,0.0001185531,0.0004548819,0.0004835955,0.00002577483,0.0001911435,0.0001020807,0.005774147,0.0003560591,0.04735973,0.9450837,0.00003523082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.005174973,0.4456513,0.07401817,0.1420323,0.1987063,0.0001061603,0.0007416373,0.0009018519,0.1326673],"genre_scores_gemma":[0.06484821,0.4540988,0.05746481,0.01735264,0.1797981,0.0001898993,0.001920476,0.0006202453,0.2237069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03648148,"threshold_uncertainty_score":0.1220427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120324231","doi":"10.1287/trsc.1100.0317","title":"A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Liquefied natural gas; Column generation; Operations research; Variable (mathematics); Routing (electronic design automation); Branch and price; Inventory theory; Natural gas; Computer science; Engineering; Integer programming; Waste management; Inventory control; Mathematical optimization; Mathematics; Computer network","authors":[{"name":"Roar Grønhaug","is_ca":false},{"name":"Marielle Christiansen","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01463907020419531,"gpt":0.30146552957012,"spread":0.2868264593659247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407908,0.001074116,0.001334148,0.0008829735,0.0006083081,0.001260125,0.001347957,0.001582043,0.01019972],"category_scores_gemma":[0.002054578,0.0006567943,0.0007811949,0.001430501,0.0005307624,0.001198348,0.0007163501,0.001479338,0.0009374396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170972,"about_ca_system_score_gemma":0.00194159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006443192,"about_ca_topic_score_gemma":0.006898054,"domain_scores_codex":[0.999523,0.0002144429,0.00001669599,0.00007588886,0.0001020427,0.00006790072],"domain_scores_gemma":[0.9991413,0.0006350297,0.00004715294,0.00002596645,0.00009729702,0.00005316048],"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.00008779512,0.00008366067,0.0002567723,0.0001337581,0.00003379343,0.0001186801,0.00005511296,0.914592,0.0008586844,0.01557067,0.003140924,0.06506807],"study_design_scores_gemma":[0.00002808268,0.00002536108,0.0000289199,0.000006357236,0.000005937622,0.00001274192,0.000008846002,0.9941168,0.0001496096,0.004728063,0.0008857512,0.000003629678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01358034,0.0004124659,0.9789464,0.0003747456,0.00007399452,0.0001909585,0.000166117,0.0002993368,0.005955632],"genre_scores_gemma":[0.1849231,0.0006612069,0.8047304,0.0001502683,0.0001041221,0.0005488307,0.0004282098,0.0002007599,0.00825306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01019972,"threshold_uncertainty_score":0.03412145,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1832376799","doi":"10.1287/trsc.2015.0635","title":"A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Branch and cut; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Branch and price; Computer science; Vehicle routing problem; Set (abstract data type); State (computer science); Algorithm; Operations research; Integer programming; Mathematics","authors":[{"name":"Guy Desaulniers","is_ca":true},{"name":"Jørgen G. Rakke","is_ca":false},{"name":"Leandro C. Coelho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0419161086913205,"gpt":0.2980385804930498,"spread":0.2561224718017293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247102,0.001704405,0.001388446,0.001155065,0.0009543174,0.001423376,0.001956524,0.002112902,0.007805705],"category_scores_gemma":[0.00380315,0.0007452484,0.0009831566,0.002189209,0.0005227528,0.001735784,0.001080066,0.002839974,0.001301063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001753354,"about_ca_system_score_gemma":0.003156814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005548859,"about_ca_topic_score_gemma":0.006791743,"domain_scores_codex":[0.999173,0.000255686,0.00004220898,0.0001866074,0.0002178954,0.0001246238],"domain_scores_gemma":[0.9987195,0.000817218,0.00009471821,0.00009659759,0.0002002668,0.00007178736],"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.0001866982,0.0003602666,0.0005529306,0.0002248649,0.0000758735,0.0001303695,0.00007362893,0.6852326,0.001615462,0.02845012,0.01707757,0.2660196],"study_design_scores_gemma":[0.00008008185,0.00007414402,0.00009213523,0.00001543725,0.00002033673,0.00005541434,0.00001811954,0.9819698,0.0008062693,0.01368684,0.003171355,0.00001007739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009425824,0.0003498905,0.9821776,0.0004187344,0.0001047798,0.0003235977,0.0003188324,0.0007195848,0.006161251],"genre_scores_gemma":[0.06616209,0.0003178904,0.9282212,0.0001969006,0.000061314,0.0005361506,0.0009737517,0.0002163153,0.003314373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007805705,"threshold_uncertainty_score":0.02611268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023445393","doi":"10.1287/trsc.1030.0086","title":"Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministerio de Ciencia y Tecnología; Canada Research Chairs","keywords":"Travelling salesman problem; Pickup; Heuristics; Traveling purchaser problem; Mathematical optimization; Heuristic; Product (mathematics); Computer science; Greedy algorithm; 2-opt; Vehicle routing problem; Commodity; Mathematics; Operations research; Routing (electronic design automation); Economics; Artificial intelligence","authors":[{"name":"Hipólito Hernández–Pérez","is_ca":false},{"name":"Juan‐José Salazar‐González","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03870615525915687,"gpt":0.2777857777228835,"spread":0.2390796224637266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00102837,0.001271841,0.0012706,0.001158383,0.0006972944,0.001416612,0.001790011,0.001388228,0.003647356],"category_scores_gemma":[0.002383335,0.0006112992,0.0009877764,0.001989495,0.0007982901,0.001328222,0.0008529295,0.001191481,0.0006730735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431886,"about_ca_system_score_gemma":0.001923998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004066788,"about_ca_topic_score_gemma":0.006131396,"domain_scores_codex":[0.9992124,0.0003578773,0.00003651244,0.0001197161,0.0001322935,0.0001410637],"domain_scores_gemma":[0.9989532,0.0007247505,0.0001317627,0.00006525454,0.00006147003,0.00006358718],"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.0001219601,0.0002067229,0.0003809801,0.000472181,0.0000659303,0.0002792078,0.0001592326,0.8509044,0.001080163,0.05833139,0.006666752,0.0813311],"study_design_scores_gemma":[0.0001702311,0.0001697704,0.0002571151,0.00007030518,0.0000620053,0.0002670323,0.0001356039,0.9447488,0.001236844,0.04140772,0.0114358,0.00003870775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0299332,0.00294831,0.9526279,0.000423975,0.0001862874,0.0005491455,0.0002569969,0.0007802333,0.01229395],"genre_scores_gemma":[0.2735389,0.003059962,0.716356,0.0003030505,0.0001633649,0.000457173,0.0004645157,0.0002050873,0.005451963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004066788,"threshold_uncertainty_score":0.01220161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114217004","doi":"10.1287/trsc.1090.0290","title":"An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":127,"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; Vehicle routing problem; Mathematical optimization; Computer science; Neighbourhood (mathematics); Heuristic; Routing (electronic design automation); Arc (geometry); Context (archaeology); Mathematics; Geography","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"Roberto Musmanno","is_ca":false},{"name":"Francesca Vocaturo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02389590442027428,"gpt":0.2914730769878286,"spread":0.2675771725675543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008761283,0.0005082912,0.0008887457,0.0007497472,0.0004333592,0.0005025869,0.001252587,0.001207348,0.001796206],"category_scores_gemma":[0.00272982,0.0004211192,0.0006124907,0.0008951584,0.000697334,0.001085635,0.0008700146,0.0006845956,0.0002153833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009035966,"about_ca_system_score_gemma":0.0009200712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004384289,"about_ca_topic_score_gemma":0.006156559,"domain_scores_codex":[0.9996017,0.0001843239,0.00001690802,0.00005592164,0.00009231843,0.00004883982],"domain_scores_gemma":[0.9990231,0.0007176493,0.00006985907,0.00003881492,0.00008655871,0.00006392368],"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.00006324143,0.00004169131,0.0001949263,0.00003597987,0.00001977971,0.00004261378,0.00004721785,0.9664003,0.000573229,0.0077223,0.0007059531,0.02415275],"study_design_scores_gemma":[0.00001790953,0.00002648139,0.00004292868,0.000004595644,0.000003800502,0.00001253309,0.00001092398,0.9960995,0.0001373963,0.003262533,0.0003765342,0.000004933389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04615073,0.0005331946,0.948655,0.0001995914,0.00006177278,0.00009004119,0.00005159434,0.0002180969,0.004039927],"genre_scores_gemma":[0.614056,0.0003160953,0.381486,0.0000923558,0.00004224552,0.0002910362,0.000186418,0.000105414,0.00342438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004384289,"threshold_uncertainty_score":0.008717537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886343885","doi":"10.1287/trsc.2018.0844","title":"Branch-and-Price–Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; TKI DINALOG; Université de Montréal","keywords":"Vehicle routing problem; Path (computing); Set (abstract data type); Column generation; Computer science; Routing (electronic design automation); Mathematical optimization; Algorithm; Operations research; Engineering; Mathematics; Computer network","authors":[{"name":"Nico Dellaert","is_ca":false},{"name":"Fardin Dashty Saridarq","is_ca":false},{"name":"Tom Van Woensel","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02525336733336839,"gpt":0.2377814720255807,"spread":0.2125281046922123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002410212,0.002677269,0.002883127,0.00187286,0.001274868,0.002489147,0.00296441,0.002498466,0.0112734],"category_scores_gemma":[0.005287229,0.001313153,0.00149926,0.004010943,0.0009949517,0.003592553,0.001834488,0.003663757,0.001817327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00263999,"about_ca_system_score_gemma":0.003537225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009729735,"about_ca_topic_score_gemma":0.01126398,"domain_scores_codex":[0.9987732,0.0004669978,0.00006150175,0.0002129401,0.0002328943,0.0002524916],"domain_scores_gemma":[0.9972225,0.002100109,0.0002015242,0.0001309266,0.0001869553,0.0001579513],"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.0001594773,0.0002537752,0.0003860189,0.0002120274,0.00009502695,0.00006249917,0.00008156708,0.8655506,0.0004621914,0.03082547,0.007258706,0.0946526],"study_design_scores_gemma":[0.00006009918,0.00004470944,0.00007060792,0.00001764341,0.00001463181,0.00001736946,0.0000233287,0.9810049,0.0001713092,0.01711529,0.001451821,0.000008278977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01911429,0.002185791,0.9628103,0.000697915,0.0002000413,0.0004365369,0.0003432398,0.001124138,0.01308767],"genre_scores_gemma":[0.2048141,0.002007204,0.7824369,0.0003151302,0.0002206239,0.0009475019,0.001200195,0.0005524658,0.007505929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0112734,"threshold_uncertainty_score":0.03771323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001478667","doi":"10.1287/trsc.2014.0533","title":"Scheduling Twin Yard Cranes in a Container Block","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":123,"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":"Heuristics; Block (permutation group theory); Scheduling (production processes); Computer science; Container (type theory); Heuristic; Yard; Mathematical optimization; Truck; Travelling salesman problem; Job shop scheduling; Stacking; Schedule; Engineering; Algorithm; Mathematics; Automotive engineering; Operating system","authors":[{"name":"Amir Gharehgozli","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Yugang Yu","is_ca":false},{"name":"René de Koster","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01053360702691465,"gpt":0.2270025886966646,"spread":0.21646898166975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037144,0.0008225666,0.001006102,0.0003404927,0.0006198377,0.0008550851,0.001192709,0.0007434509,0.006130615],"category_scores_gemma":[0.0007076298,0.0006325633,0.0007161516,0.0006897473,0.0004989478,0.000682126,0.0006185657,0.0006778089,0.0004352456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001138874,"about_ca_system_score_gemma":0.001927942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03367749,"about_ca_topic_score_gemma":0.02502022,"domain_scores_codex":[0.9996974,0.00005783272,0.00001156984,0.00007555586,0.00004509849,0.0001125484],"domain_scores_gemma":[0.9996058,0.0001369428,0.0000477334,0.00003793004,0.00005228383,0.0001192081],"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.0003250297,0.0001330533,0.001247059,0.00008485789,0.00002901617,0.0002454119,0.00006788974,0.9813676,0.003929331,0.001244284,0.0008102056,0.0105163],"study_design_scores_gemma":[0.0000668115,0.0002269909,0.0009417112,0.000005435382,0.00001457696,0.00003462794,0.0001050895,0.9955029,0.001626487,0.0004523927,0.001013688,0.000009295167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9455194,0.0001766058,0.04632247,0.0001012615,0.00004812138,0.0002708709,0.0002935641,0.0002879127,0.006979596],"genre_scores_gemma":[0.9431773,0.0001800623,0.04926375,0.00002193056,0.00001362778,0.0001521464,0.0005502435,0.00007885967,0.006562124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03367749,"threshold_uncertainty_score":0.0669629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010359686","doi":"10.1287/trsc.1110.0387","title":"Robust Inventory Routing Under Demand Uncertainty","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"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":"Robust optimization; Mathematical optimization; Time horizon; Interval (graph theory); Routing (electronic design automation); Operations research; Computer science; Inventory theory; Product (mathematics); Integer programming; Inventory control; Set (abstract data type); Holding cost; Mathematics","authors":[{"name":"Oğuz Solyalı","is_ca":false},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0778347292160422,"gpt":0.2723011943071366,"spread":0.1944664650910944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001457065,0.001105471,0.001331103,0.0005977081,0.0004709189,0.001562613,0.001408022,0.001512341,0.001952329],"category_scores_gemma":[0.004088538,0.0008373776,0.000895709,0.001268234,0.0007052378,0.002170699,0.001042189,0.001094388,0.0003336377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546425,"about_ca_system_score_gemma":0.0009220769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00382432,"about_ca_topic_score_gemma":0.002019718,"domain_scores_codex":[0.9985904,0.0005103194,0.00008100268,0.0002635166,0.0003366826,0.0002181858],"domain_scores_gemma":[0.9984035,0.0009575079,0.0002707086,0.0001472492,0.0001549312,0.00006614794],"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.00002941094,0.00000878013,0.00008089109,0.00002388673,0.00001325984,0.00005004707,0.00001364959,0.9872037,0.000538994,0.007013826,0.0003312182,0.004692462],"study_design_scores_gemma":[0.000005617295,0.00001313819,0.00004903178,0.000002546795,0.000004921854,0.00001735567,0.000007617884,0.9914551,0.000238272,0.007830912,0.0003702433,0.00000520397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0402392,0.0005121139,0.9521955,0.00044626,0.00005330177,0.00005481541,0.0003749024,0.0004215611,0.005702301],"genre_scores_gemma":[0.8477998,0.0005908825,0.1474814,0.0001040499,0.00008250741,0.0001445783,0.0005945694,0.0001793245,0.003022825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00382432,"threshold_uncertainty_score":0.01122016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089938056","doi":"10.1287/trsc.35.3.238.10152","title":"A Modeling Framework for Passenger Assignment on a Transport Network with Timetables","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":121,"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":"Computer science; FIFO (computing and electronics); Mathematical optimization; Flow network; Graph; Travel time; Graph theory; Operations research; Transport engineering; Engineering; Theoretical computer science; Mathematics","authors":[{"name":"Sang Quang Nguyen","is_ca":true},{"name":"Stefano Pallottino","is_ca":false},{"name":"Federico Malucelli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03983165338560238,"gpt":0.3230617755105982,"spread":0.2832301221249958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070019,0.001575459,0.0008409799,0.0008887423,0.001089855,0.002190855,0.002817834,0.001644153,0.007644481],"category_scores_gemma":[0.00161316,0.00059376,0.001749292,0.001708881,0.001108173,0.003346432,0.0013236,0.002331177,0.001303162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002254431,"about_ca_system_score_gemma":0.002295342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01478349,"about_ca_topic_score_gemma":0.01309562,"domain_scores_codex":[0.9994261,0.0001857843,0.00002770477,0.0001338391,0.0001545858,0.00007187716],"domain_scores_gemma":[0.9995081,0.0002189892,0.00007902461,0.00005016915,0.0000781304,0.00006552595],"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.000009247059,0.00002513784,0.00009816131,0.00004563201,0.00001853753,0.00006131249,0.00007159875,0.3996704,0.0004206273,0.5928934,0.001601716,0.005084244],"study_design_scores_gemma":[0.00001189052,0.00002271585,0.00006126722,0.00002054887,0.00002113941,0.00003900893,0.0000296903,0.7300978,0.0001382843,0.2575484,0.01199608,0.00001315671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00279481,0.0002755837,0.9902896,0.0004621554,0.0000857688,0.00003990834,0.0002543435,0.0001290708,0.005668561],"genre_scores_gemma":[0.3664395,0.003998282,0.5916988,0.0004221791,0.0007141524,0.00116893,0.001468119,0.0003268666,0.03376316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01478349,"threshold_uncertainty_score":0.02939492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2806571857","doi":"10.1287/trsc.2018.0822","title":"Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":120,"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; Yard; Heuristic; Computer science; Container (type theory); Mathematical optimization; Integer programming; Dual (grammatical number); Integer (computer science); Assignment problem; Branch and price; Key (lock); Linear programming; Operations research; Algorithm; Engineering; Mathematics","authors":[{"name":"Kai Wang","is_ca":false},{"name":"Lu Zhen","is_ca":false},{"name":"Shuaian Wang","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02673421821792907,"gpt":0.2523975719556721,"spread":0.225663353737743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009630852,0.001368342,0.001183164,0.0007841165,0.0006900803,0.001303366,0.001058822,0.001017945,0.005943345],"category_scores_gemma":[0.001730226,0.0005766277,0.0009762741,0.002162896,0.0006402635,0.0009558056,0.0008663561,0.00154747,0.0006022425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315393,"about_ca_system_score_gemma":0.002470212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0138198,"about_ca_topic_score_gemma":0.0150923,"domain_scores_codex":[0.999281,0.0002705608,0.00001866948,0.0001282948,0.0001531504,0.0001482368],"domain_scores_gemma":[0.999138,0.0005307395,0.0001006107,0.00005540278,0.0001041563,0.00007111239],"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.00008280838,0.00008473664,0.000405092,0.0001524916,0.00003464727,0.0001311007,0.00003737146,0.9555826,0.00105606,0.01356039,0.00314998,0.02572281],"study_design_scores_gemma":[0.00001736407,0.00003445599,0.0001457844,0.000008079078,0.00001194493,0.00003258932,0.00001741584,0.9936097,0.0003842942,0.004679061,0.001052471,0.000006990579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03550816,0.0009523574,0.9532299,0.0004138864,0.000128709,0.000235937,0.0007422044,0.0003862227,0.008402649],"genre_scores_gemma":[0.5569316,0.0008978661,0.4323893,0.0002707043,0.0001420336,0.0004669839,0.001469083,0.0002285224,0.007204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0138198,"threshold_uncertainty_score":0.02747875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142169698","doi":"10.1287/trsc.2014.0525","title":"Service Network Design with Resource Constraints","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":116,"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; Université du Québec à Montréal","funders":"Infrastructure Canada; Compute Canada","keywords":"Column generation; Solver; Benchmark (surveying); Heuristic; Network planning and design; Computer science; Service (business); Consolidation (business); Quality of service; Operations research; Mathematical optimization; Computer network; Engineering; Business; Artificial intelligence; Mathematics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Mike Hewitt","is_ca":false},{"name":"Michel Toulouse","is_ca":false},{"name":"Duc Minh Vu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02109923420486267,"gpt":0.2463486574531667,"spread":0.225249423248304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930986,0.001038639,0.0006767197,0.0005192836,0.00047725,0.001325618,0.0009377023,0.00108629,0.005062071],"category_scores_gemma":[0.001907891,0.0005275579,0.0006623243,0.00115517,0.0007362278,0.001123624,0.0008689661,0.001044648,0.0005858825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001701783,"about_ca_system_score_gemma":0.002469814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01036085,"about_ca_topic_score_gemma":0.009549513,"domain_scores_codex":[0.9992569,0.0003178631,0.00002007516,0.00008968048,0.0001913649,0.0001240849],"domain_scores_gemma":[0.9994302,0.0002838658,0.00005264597,0.00004229848,0.0001385115,0.00005230392],"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.00002177682,0.00001792919,0.0001402173,0.00005431641,0.00001077985,0.00005842029,0.00001968539,0.9621387,0.0007932327,0.0261256,0.001542736,0.0090766],"study_design_scores_gemma":[0.000009044805,0.00001579244,0.00002629813,0.00000627848,0.000004723128,0.00001872323,0.00001448582,0.9876782,0.0003389367,0.009280297,0.002603853,0.000003369729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01887826,0.0002971157,0.9667331,0.0005478555,0.00008451573,0.0001298516,0.0003055624,0.0002177283,0.01280606],"genre_scores_gemma":[0.5397736,0.001148028,0.4432625,0.0003859528,0.0001076359,0.0005009169,0.0006778426,0.0002252905,0.01391827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01036085,"threshold_uncertainty_score":0.02060103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989947400","doi":"10.1287/trsc.2021.1111","title":"The Electric Vehicle Routing Problem with Capacitated Charging Stations","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":113,"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":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Iterated local search; Routing (electronic design automation); Electric vehicle; Mathematical optimization; Set (abstract data type); Generator (circuit theory); Computer science; Charging station; Iterated function; Local search (optimization); Mathematics","authors":[{"name":"Aurélien Froger","is_ca":false},{"name":"Ola Jabali","is_ca":false},{"name":"Jorge E. Mendoza","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01335210345303599,"gpt":0.2486815788830525,"spread":0.2353294754300164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101083,0.002112258,0.001410886,0.0008827355,0.0008707651,0.00267346,0.002278431,0.003037767,0.007577557],"category_scores_gemma":[0.003024397,0.0009033069,0.001499425,0.002598872,0.0009344011,0.002595359,0.001182629,0.001766297,0.0006649791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001843904,"about_ca_system_score_gemma":0.002104065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008702466,"about_ca_topic_score_gemma":0.007659526,"domain_scores_codex":[0.998849,0.0004447831,0.00005261134,0.0002686701,0.000169906,0.0002150068],"domain_scores_gemma":[0.9985824,0.0009804599,0.0001618289,0.00008087042,0.00009884046,0.00009578739],"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.00004464026,0.00005768846,0.0002354092,0.00007524072,0.0000295788,0.00009590627,0.00001975267,0.974113,0.0002356363,0.01442459,0.001503816,0.009164711],"study_design_scores_gemma":[0.00005800067,0.0000683808,0.0001542477,0.00001439717,0.00002509134,0.0001208484,0.0000681833,0.9739314,0.0003406001,0.02046616,0.004736663,0.00001606448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1387709,0.001817583,0.8049538,0.002117921,0.0003625192,0.0005159828,0.002316404,0.000687414,0.04845746],"genre_scores_gemma":[0.7269382,0.001950476,0.2441788,0.0003522141,0.0002535335,0.0004881998,0.001945924,0.0002612537,0.02363135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008702466,"threshold_uncertainty_score":0.0253495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2468943938","doi":"10.1287/trsc.2015.0659","title":"Predicting the Potential Market for Electric Vehicles","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Transport Canada","funders":"","keywords":"Market share; Market penetration; Demand forecasting; Econometrics; Economics; Market share analysis; Product (mathematics); Supply and demand; New product development; Microeconomics; Industrial organization; Computer science; Operations research; Marketing; Business; Market microstructure; Order (exchange); Engineering; Operations management; Mathematics; Finance","authors":[{"name":"Anders Fjendbo Jensen","is_ca":true},{"name":"Elisabetta Cherchi","is_ca":true},{"name":"Stefan Lindhard Mabit","is_ca":true},{"name":"Juan de Dios Ortúzar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06016170162792984,"gpt":0.3409432967948951,"spread":0.2807815951669653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007462598,0.0002809659,0.0002632338,0.0007557854,0.0001135133,0.0005379592,0.0003629055,0.00067904,0.003239851],"category_scores_gemma":[0.004041548,0.0002131573,0.0004014864,0.0005991377,0.0001146092,0.001172025,0.0002192526,0.0003948144,0.0007360184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000380706,"about_ca_system_score_gemma":0.0001989901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003844351,"about_ca_topic_score_gemma":0.003883187,"domain_scores_codex":[0.9998271,0.00005697146,0.00001236398,0.00004708515,0.00003407005,0.00002235933],"domain_scores_gemma":[0.9974951,0.001939804,0.0002005695,0.0001088716,0.0001804883,0.00007513498],"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.0005914947,0.0005158393,0.2873432,0.0001580082,0.0001331993,0.0001990578,0.0001558556,0.597639,0.007644812,0.006445975,0.002475686,0.09669781],"study_design_scores_gemma":[0.0000126937,0.0001471318,0.04384051,0.000009421616,0.00001714274,0.0000316661,0.0001623536,0.9499539,0.0018432,0.003186749,0.0007774988,0.00001767166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811574,0.00007786175,0.01530109,0.0001618068,0.000007627124,0.00003495862,0.001324258,0.00005154423,0.001883476],"genre_scores_gemma":[0.9923969,0.00007550144,0.005544581,0.000008680533,0.000007169556,0.00002874059,0.001155817,0.000004808746,0.0007776644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003844351,"threshold_uncertainty_score":0.01083833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1876351940","doi":"10.1287/trsc.2014.0581","title":"Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"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; Computer science; Mathematical optimization; Routing (electronic design automation); Probability distribution; Set (abstract data type); Mathematics","authors":[{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Patrick Jaillet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08101912272087147,"gpt":0.2989574792719695,"spread":0.217938356551098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459047,0.001872016,0.002185316,0.001374897,0.0007570639,0.002700878,0.003167737,0.002249848,0.004614563],"category_scores_gemma":[0.008632091,0.001112756,0.002168967,0.002245418,0.001266151,0.003440709,0.002357688,0.00353827,0.00098937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002424769,"about_ca_system_score_gemma":0.002548016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007449032,"about_ca_topic_score_gemma":0.005243903,"domain_scores_codex":[0.9980882,0.0006267382,0.0001152761,0.0004154391,0.0004794223,0.0002749142],"domain_scores_gemma":[0.996125,0.002477157,0.0005427502,0.0002550366,0.0004698256,0.0001301497],"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.00002071376,0.00002184822,0.0001141067,0.00006486118,0.00002617946,0.00003057885,0.00002926072,0.9195033,0.0001860025,0.06904769,0.0008740341,0.01008148],"study_design_scores_gemma":[0.000008827979,0.00001035573,0.00002204636,0.000007082753,0.000004949404,0.00001153308,0.000007688725,0.9613123,0.00007182571,0.03754831,0.0009894518,0.000005690952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001950141,0.0004337328,0.9954199,0.0002312364,0.00004973224,0.00002934054,0.00009634624,0.0001459464,0.001643669],"genre_scores_gemma":[0.3675963,0.00323539,0.6159497,0.0003594946,0.0004626572,0.0007722634,0.001125377,0.0003530817,0.01014575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007449032,"threshold_uncertainty_score":0.01759297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167917756","doi":"10.1287/trsc.1070.0217","title":"An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"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":"Norges Forskningsråd","keywords":"Metaheuristic; Vehicle routing problem; Simulated annealing; Mathematical optimization; Computer science; Benchmark (surveying); Integer programming; Local search (optimization); Heuristics; Heuristic; Integer (computer science); Routing (electronic design automation); Mathematics","authors":[{"name":"Olli Bräysy","is_ca":false},{"name":"Wout Dullaert","is_ca":false},{"name":"Geir Hasle","is_ca":false},{"name":"David Mester","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01505666634643012,"gpt":0.2684418700792295,"spread":0.2533852037327994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007310403,0.0008326811,0.0009988144,0.0006776953,0.0004358528,0.0006926721,0.001152704,0.001224945,0.001658984],"category_scores_gemma":[0.001221134,0.0005358942,0.001163555,0.0006022471,0.0004218846,0.0007711492,0.0006383838,0.0009592231,0.0002996898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007740038,"about_ca_system_score_gemma":0.0009754335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002090679,"about_ca_topic_score_gemma":0.002882899,"domain_scores_codex":[0.9995669,0.0001724876,0.00002067277,0.0000701172,0.0001210536,0.00004879626],"domain_scores_gemma":[0.9997137,0.0001543828,0.00004959571,0.00002956591,0.00003240522,0.00002037],"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.00006222488,0.00008192071,0.0003422092,0.0001022318,0.00006909766,0.00006375776,0.00006649127,0.9191781,0.003958934,0.01348809,0.001047881,0.06153892],"study_design_scores_gemma":[0.00002552717,0.00006544972,0.0001290519,0.00001247024,0.00002402075,0.00003839182,0.00001027189,0.993148,0.001201159,0.002655554,0.00268125,0.000008853788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02025434,0.0005892739,0.9745798,0.0001331038,0.00005264341,0.0001174521,0.00005181949,0.0002628571,0.003958751],"genre_scores_gemma":[0.2775587,0.000550257,0.7169963,0.000143451,0.00005011669,0.0004375019,0.0001807817,0.0001313559,0.003951547],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002090679,"threshold_uncertainty_score":0.00561589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160968569","doi":"10.1287/trsc.1100.0326","title":"The Dynamic Uncapacitated Hub Location Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"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":"Lagrangian relaxation; Mathematical optimization; Lagrangian; Reduction (mathematics); Set (abstract data type); Exploit; Relaxation (psychology); Upper and lower bounds; Tree (set theory); Function (biology); Computer science; Branch and bound; Mathematics; Applied mathematics; Combinatorics","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.008700321292497787,"gpt":0.263498863399777,"spread":0.2547985421072791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004876119,0.0009039553,0.0008217205,0.0004837031,0.0005904594,0.001348958,0.001764961,0.001295976,0.005726776],"category_scores_gemma":[0.001223946,0.0005082539,0.0004879271,0.001227882,0.0006764883,0.001682006,0.001018283,0.001091266,0.000548537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033202,"about_ca_system_score_gemma":0.001323152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003359041,"about_ca_topic_score_gemma":0.003397956,"domain_scores_codex":[0.9994859,0.0001520236,0.00001874621,0.0001472814,0.00009225624,0.000103944],"domain_scores_gemma":[0.999567,0.0002430714,0.00006130214,0.00003547473,0.0000433378,0.00004986491],"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.0001045592,0.00009163737,0.0004040628,0.0002290785,0.0000487077,0.0003575977,0.00005262332,0.883013,0.001242585,0.06698503,0.006483343,0.0409878],"study_design_scores_gemma":[0.00004152779,0.00006026099,0.0003127499,0.0000264416,0.00002629444,0.0002100715,0.00007856795,0.9454519,0.001041618,0.04102093,0.01171005,0.00001969156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05969798,0.001353063,0.9008796,0.001383899,0.000252074,0.0001503735,0.001095364,0.0003253164,0.03486222],"genre_scores_gemma":[0.8333916,0.001979332,0.1370565,0.0002144581,0.0002215601,0.0002834673,0.001536498,0.0001698263,0.02514682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005726776,"threshold_uncertainty_score":0.01915801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118493070","doi":"10.1287/trsc.1100.0333","title":"Branch and Price for Service Network Design with Asset Management Constraints","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"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; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Université de Montréal","keywords":"Column generation; Transshipment (information security); Network planning and design; Integer programming; Computer science; Mathematical optimization; Flow network; Service (business); Operations research; Path (computing); Integer (computer science); Branch and price; Shortest path problem; Engineering; Computer network; Economics; Mathematics; Graph","authors":[{"name":"Jardar Andersen","is_ca":false},{"name":"Marielle Christiansen","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Roar Grønhaug","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01866279634969389,"gpt":0.2654168289073473,"spread":0.2467540325576534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331064,0.00167454,0.001652719,0.001619532,0.0008014579,0.001751661,0.001128866,0.001581201,0.01573647],"category_scores_gemma":[0.005442774,0.0008959472,0.0009202487,0.002873888,0.0009610568,0.001992122,0.001144872,0.002121012,0.001391376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784308,"about_ca_system_score_gemma":0.002525994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004763636,"about_ca_topic_score_gemma":0.005437328,"domain_scores_codex":[0.9991626,0.0004403301,0.00002150208,0.00008337438,0.0001824976,0.0001097565],"domain_scores_gemma":[0.9981933,0.001422806,0.00009697256,0.00004481275,0.0001563034,0.00008566977],"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.00009892083,0.0000788204,0.0003690063,0.0001690198,0.00003663462,0.00009174264,0.00006419676,0.8434949,0.0004915308,0.08225295,0.004701293,0.068151],"study_design_scores_gemma":[0.00002057557,0.0000282537,0.00002898065,0.00001134694,0.00000763179,0.00001361425,0.000007476902,0.9749866,0.000133612,0.02264071,0.00211759,0.00000367294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008364656,0.000649143,0.9808151,0.0003611163,0.000096364,0.0001589572,0.0001088732,0.0001528428,0.00929307],"genre_scores_gemma":[0.2362221,0.00226805,0.7438763,0.0002306753,0.0002307802,0.001226935,0.0005267364,0.0002935722,0.01512486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01573647,"threshold_uncertainty_score":0.05264372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005562592","doi":"10.1287/trsc.1080.0236","title":"Toll Policies for Mitigating Hazardous Materials Transport Risk","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Toll; Hazardous waste; Transport engineering; Flow network; Computer science; Business; Risk analysis (engineering); Operations research; Engineering; Mathematical optimization; Waste management","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Anne Mercier","is_ca":true},{"name":"Gilles Savard","is_ca":true},{"name":"Vedat Verter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09910634419173589,"gpt":0.3799160839008588,"spread":0.2808097397091229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390977,0.0007540754,0.0005254413,0.00113366,0.0005111605,0.00152518,0.001074866,0.00128386,0.004439068],"category_scores_gemma":[0.007995827,0.000357142,0.0004381337,0.0007552138,0.001181751,0.002328378,0.001160283,0.001308587,0.0001932613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002002613,"about_ca_system_score_gemma":0.002456135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003840861,"about_ca_topic_score_gemma":0.003221247,"domain_scores_codex":[0.9986935,0.0007192684,0.0000407749,0.000100036,0.0002652387,0.0001811804],"domain_scores_gemma":[0.9971313,0.002014526,0.0003882103,0.0001115982,0.0001983546,0.0001558769],"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.00009968337,0.00009155017,0.0007850891,0.0001416769,0.00003349586,0.00005543904,0.00004498012,0.8472033,0.0009116303,0.1271698,0.001318692,0.02214471],"study_design_scores_gemma":[0.0001024751,0.0001173525,0.0003847797,0.00004775137,0.00004862701,0.00004938321,0.0001354237,0.9047381,0.001754925,0.08678982,0.005808486,0.00002293705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1819647,0.001692547,0.781766,0.003539989,0.0002613407,0.000406956,0.0003562918,0.0004226613,0.02958958],"genre_scores_gemma":[0.9542423,0.001012945,0.04151031,0.0001261141,0.00006484401,0.000148875,0.0000800003,0.0000225976,0.002792015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004439068,"threshold_uncertainty_score":0.01485014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138868522","doi":"10.1287/trsc.2013.0477","title":"Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle emissions and performance","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Université de Montréal","funders":"","keywords":"Transport engineering; European union; Truck; Service (business); Engineering; Business; Operations research; Risk analysis (engineering); International trade; Marketing; Automotive engineering","authors":[{"name":"Asvin Goel","is_ca":false},{"name":"Thibaut Vidal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01241733130484501,"gpt":0.2614500720696989,"spread":0.2490327407648539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00234904,0.001047032,0.000763893,0.001543518,0.0004371864,0.001283302,0.0007993577,0.0009566707,0.0007010848],"category_scores_gemma":[0.003018879,0.0002868051,0.001002088,0.001703139,0.0007931817,0.001267634,0.0007255265,0.0006089776,0.00007983988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002543286,"about_ca_system_score_gemma":0.001028937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03021566,"about_ca_topic_score_gemma":0.01792534,"domain_scores_codex":[0.9991475,0.0003948228,0.0000394783,0.0001125467,0.0002085699,0.00009709647],"domain_scores_gemma":[0.9985165,0.0007891268,0.0002651252,0.0001242726,0.0002481497,0.00005683843],"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.00004833786,0.00007002652,0.002879042,0.0000280763,0.00002847816,0.0000182802,0.00001620521,0.9879544,0.00020294,0.001210636,0.0002832601,0.007260269],"study_design_scores_gemma":[0.000009257189,0.0001160108,0.005647205,0.00001159426,0.00003568271,0.00001488522,0.00007966467,0.9920786,0.0006367685,0.000712341,0.0006451654,0.00001274697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8961231,0.001373639,0.08307052,0.0004818127,0.00005536797,0.0001670991,0.0004698259,0.0001853643,0.0180734],"genre_scores_gemma":[0.9802101,0.0005891814,0.01780508,0.0000314692,0.00001646925,0.00006663395,0.0005350823,0.00003753823,0.0007083665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03021566,"threshold_uncertainty_score":0.06007957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106541949","doi":"10.1287/trsc.37.1.1.12822","title":"Models and Methods for Merge-in-Transit Operations","year":2003,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"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":"Heuristics; Mathematical optimization; Rounding; Integer programming; Merge (version control); Linear programming; Cutting-plane method; Computer science; Piecewise linear function; Branch and bound; Mathematics","authors":[{"name":"Keely L. Croxton","is_ca":false},{"name":"Bernard Gendron","is_ca":true},{"name":"Thomas L. Magnanti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0382183339225108,"gpt":0.3652933841581758,"spread":0.327075050235665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002696289,0.002222123,0.001175674,0.001879531,0.0009859632,0.002722408,0.003575376,0.002029135,0.009859669],"category_scores_gemma":[0.005739529,0.001105913,0.00244647,0.002418096,0.001227056,0.004101082,0.002066828,0.003737747,0.002582379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001947655,"about_ca_system_score_gemma":0.002120791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005789107,"about_ca_topic_score_gemma":0.005162437,"domain_scores_codex":[0.998522,0.0005670823,0.00008238673,0.000211981,0.0004804964,0.0001360398],"domain_scores_gemma":[0.9983515,0.00105288,0.0002103482,0.0001437365,0.0001821125,0.00005951328],"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.00001344167,0.00005200109,0.0001545921,0.0001442847,0.00003648694,0.00004898542,0.0001049231,0.4946284,0.0002717295,0.4710127,0.004006824,0.02952559],"study_design_scores_gemma":[0.00001141371,0.00001202234,0.00003489407,0.00004258862,0.00001325377,0.00003450162,0.00002846974,0.7991813,0.0001939148,0.1872965,0.0131384,0.00001266861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005271597,0.0004800248,0.9942937,0.0002367193,0.00005421989,0.00005145945,0.00009499458,0.00008746813,0.004174276],"genre_scores_gemma":[0.08324745,0.004278822,0.8951148,0.0002491448,0.0003976984,0.001195942,0.0007055147,0.000295116,0.01451541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009859669,"threshold_uncertainty_score":0.0329839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158354221","doi":"10.1287/trsc.1100.0363","title":"Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"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; Université Laval","funders":"","keywords":"Vehicle routing problem; Column generation; Tabu search; Mathematical optimization; Routing (electronic design automation); Path (computing); Computer science; Branch and cut; Mathematics; Integer programming; Computer network","authors":[{"name":"Claudia Archetti","is_ca":false},{"name":"Mathieu Bouchard","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01725819034614307,"gpt":0.2402429470521979,"spread":0.2229847567060548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908055,0.0009346855,0.001136152,0.0006481196,0.0005201307,0.001016362,0.001203163,0.0008722213,0.003693165],"category_scores_gemma":[0.004815156,0.0006389834,0.0008425223,0.001416736,0.000822663,0.002311423,0.001015152,0.002338322,0.0005318708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008778104,"about_ca_system_score_gemma":0.001482775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002666356,"about_ca_topic_score_gemma":0.002782138,"domain_scores_codex":[0.9990037,0.0004298167,0.00002969071,0.00009387114,0.0003349456,0.000108009],"domain_scores_gemma":[0.9983549,0.001183894,0.0001249658,0.0001153898,0.0001598308,0.00006098339],"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.0001687012,0.0001041435,0.0004289246,0.000152336,0.00005678728,0.00009749681,0.00007085668,0.831802,0.001961123,0.06833604,0.00193275,0.09488893],"study_design_scores_gemma":[0.00001583466,0.0000357383,0.00006565618,0.000005742008,0.000007799113,0.00002207858,0.000006395198,0.9813757,0.0004629701,0.01704561,0.0009526624,0.000003813336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01422362,0.0004284394,0.9824532,0.0001116208,0.00004248777,0.00007316968,0.00004748097,0.0001031775,0.002516842],"genre_scores_gemma":[0.244213,0.0008014123,0.7495729,0.0001019711,0.00009327543,0.0002689454,0.0002450709,0.0001430997,0.004560358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003693165,"threshold_uncertainty_score":0.01235485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138596841","doi":"10.1287/trsc.1100.0328","title":"European Driver Rules in Vehicle Routing with Time Windows","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":98,"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":"Tabu search; Vehicle routing problem; Heuristics; Column generation; Computer science; Task (project management); Routing (electronic design automation); Heuristic; Mathematical optimization; Operations research; Algorithm; Engineering; Artificial intelligence; Mathematics; Embedded system","authors":[{"name":"Eric Prescott‐Gagnon","is_ca":true},{"name":"Guy Desaulniers","is_ca":true},{"name":"Michael Drexl","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009295564871308826,"gpt":0.2376110851423939,"spread":0.228315520271085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001698215,0.0005183319,0.0004524081,0.0004982974,0.0005750026,0.001675248,0.001156296,0.001046858,0.003304595],"category_scores_gemma":[0.003902471,0.0004786585,0.0008380816,0.0009305616,0.000754767,0.00164788,0.0009202614,0.0009352561,0.0004784388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009281045,"about_ca_system_score_gemma":0.001570089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01045286,"about_ca_topic_score_gemma":0.00980784,"domain_scores_codex":[0.9985077,0.0007492385,0.00007388396,0.0002216902,0.0002879979,0.0001593565],"domain_scores_gemma":[0.998976,0.0006289361,0.0001415707,0.000111853,0.00009853977,0.00004314666],"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.0001703818,0.00006310816,0.001183562,0.0001333537,0.00004811838,0.0002960529,0.0001951556,0.6316243,0.001613168,0.2896636,0.004693465,0.07031573],"study_design_scores_gemma":[0.0000676991,0.00007932298,0.0008529849,0.00005912901,0.00004476268,0.0002100116,0.0001903139,0.7914799,0.003569495,0.1649394,0.03845738,0.00004953813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1173342,0.002060633,0.8250027,0.0009351343,0.0002412033,0.0002285957,0.0006328441,0.0003393221,0.05322549],"genre_scores_gemma":[0.6696051,0.001639905,0.3059762,0.0001655563,0.00009429742,0.0002699395,0.000654458,0.0002000979,0.02139447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045286,"threshold_uncertainty_score":0.02078402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111837930","doi":"10.1287/trsc.34.4.402.12322","title":"On the Existence of Solutions to the Dynamic User Equilibrium Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":97,"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":"Variational inequality; FIFO (computing and electronics); Path (computing); Mathematical optimization; Flow network; Computer science; Flow (mathematics); Mathematical economics; Mathematics; Applied mathematics; Geometry","authors":[{"name":"Daoli Zhu","is_ca":true},{"name":"Patrice Marcotte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02973688415505185,"gpt":0.3035717216101579,"spread":0.2738348374551061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047714,0.0008074678,0.0007839533,0.0006762139,0.0009714395,0.00207781,0.001135608,0.002062292,0.005906201],"category_scores_gemma":[0.014056,0.0003897151,0.0005181688,0.0008460013,0.002385737,0.003377017,0.002042599,0.001611916,0.0005142233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008142235,"about_ca_system_score_gemma":0.001443812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002336658,"about_ca_topic_score_gemma":0.001024846,"domain_scores_codex":[0.9990264,0.0004643766,0.00003072386,0.0001671812,0.0001714019,0.000139882],"domain_scores_gemma":[0.9944205,0.004449187,0.0003067892,0.0001158084,0.0005367922,0.0001709967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009819133,0.00005624957,0.0002780269,0.0001168768,0.00002011786,0.0001204221,0.0002615149,0.07962576,0.001471599,0.903999,0.001907042,0.01204532],"study_design_scores_gemma":[0.00005370176,0.00009899993,0.000187605,0.00007365207,0.00001291453,0.00009918675,0.0002706863,0.4605447,0.0009007331,0.5333673,0.004361948,0.00002852479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07458626,0.000875031,0.8805591,0.002357387,0.000113684,0.00008434055,0.0001695198,0.00009181977,0.04116278],"genre_scores_gemma":[0.8823691,0.001851471,0.1004289,0.0004447791,0.0001762041,0.0003373612,0.0002391988,0.0001116056,0.01404135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005906201,"threshold_uncertainty_score":0.01975816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}