{"id":"W2595282281","doi":"","title":"Some Applications of the Generalized Vehicle Routing Problem","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Vertex (graph theory); Routing (electronic design automation); Computer science; Mathematical optimization; Set (abstract data type); Extension (predicate logic); Variety (cybernetics); Mathematics; Theoretical computer science; Graph; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104031,0.001062472,0.0006699315,0.0009592029,0.001040159,0.001470798,0.001140103,0.001801705,0.007574581],"category_scores_gemma":[0.002995457,0.000387737,0.001456161,0.002324781,0.001364671,0.00183591,0.001742517,0.002254939,0.001156137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339537,"about_ca_system_score_gemma":0.0008839512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00520819,"about_ca_topic_score_gemma":0.003860196,"domain_scores_codex":[0.9990803,0.0003744429,0.00004630071,0.0001514745,0.0002620289,0.00008539825],"domain_scores_gemma":[0.9993012,0.0003927856,0.00006194921,0.00008047701,0.0001175413,0.00004601159],"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.00002170139,0.00003679988,0.000245385,0.0001518236,0.00002657306,0.0002488249,0.0001731218,0.09248415,0.0003946127,0.8506331,0.01297255,0.04261125],"study_design_scores_gemma":[0.00001970551,0.00002706881,0.0002323668,0.0000520666,0.00001083059,0.0002392064,0.00008468307,0.1014613,0.0001720896,0.8149005,0.08278252,0.00001762645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02226815,0.02049529,0.751316,0.009611484,0.001046871,0.0001403704,0.0004871287,0.000322437,0.1943123],"genre_scores_gemma":[0.4887671,0.03973182,0.3876621,0.002577361,0.003147458,0.0004478606,0.001206158,0.000317965,0.07614212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007574581,"threshold_uncertainty_score":0.02533954,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01134487287555273,"score_gpt":0.2183427091794142,"score_spread":0.2069978363038615,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}