{"id":"W593153863","doi":"10.71781/10045","title":"Algorithmes pour le problème de repositionnement","year":2008,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Vertex (graph theory); Graph; Heuristic; Computer science; Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Routing (electronic design automation)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000618681,0.0003737355,0.0004192395,0.0001302986,0.0003735953,0.0003168068,0.0005442642,0.0004001401,0.001537961],"category_scores_gemma":[0.0001724161,0.0004785823,0.0001193465,0.0002813763,0.00003152004,0.0002826784,0.00008858516,0.0003872099,0.0005840586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004305296,"about_ca_system_score_gemma":0.000905038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001022048,"about_ca_topic_score_gemma":0.0001302887,"domain_scores_codex":[0.9979441,0.0002294483,0.0006425716,0.000499282,0.0002355389,0.0004491059],"domain_scores_gemma":[0.9988451,0.0001041578,0.0002599713,0.0003758521,0.0002553102,0.0001596025],"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.00003249607,0.0002847242,0.0003393921,0.0001697566,0.000305366,0.0001585834,0.01480523,0.659014,0.01163412,0.0004977466,0.002558446,0.3102001],"study_design_scores_gemma":[0.001414557,0.00008877845,0.002634922,0.0008197174,0.000212923,0.0002421928,0.004301552,0.8031572,0.157593,0.0002279957,0.0281847,0.001122497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1212527,0.001784547,0.7022699,0.001731064,0.001500618,0.002251462,0.00009196472,0.00003849269,0.1690793],"genre_scores_gemma":[0.007038961,0.0002167274,0.9384689,0.00002516475,0.0002208797,0.0001057258,0.0007395723,0.0001118636,0.05307218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3090776,"threshold_uncertainty_score":0.9997666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03213958459397837,"score_gpt":0.3157601848380647,"score_spread":0.2836206002440863,"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."}}