{"id":"W1696028247","doi":"10.5267/j.ijiec.2015.8.003","title":"A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Pareto principle; Ant colony optimization algorithms; Mathematical optimization; Depot; ANT; Computer science; Algorithm; Multi-objective optimization; Mathematics; Engineering; Routing (electronic design automation); Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008652618,0.0001997526,0.0002482033,0.0002327211,0.00008254,0.0001650871,0.0004170101,0.000109953,0.000002729682],"category_scores_gemma":[0.00065371,0.0001584639,0.000105753,0.0003185481,0.00003349081,0.0002827809,0.00004201734,0.0004737312,0.000002303822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003822008,"about_ca_system_score_gemma":0.0002241902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002018547,"about_ca_topic_score_gemma":0.00000621572,"domain_scores_codex":[0.9985707,0.00005386484,0.0005610356,0.0001342777,0.0004442983,0.0002357781],"domain_scores_gemma":[0.9974977,0.0007636035,0.0002582695,0.0001010387,0.001230483,0.0001488629],"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.00002991161,0.00004715612,0.0003540973,0.000003398333,0.0004055445,0.00001433672,0.000696438,0.9810008,0.0002172565,0.00005207215,0.0003004585,0.01687852],"study_design_scores_gemma":[0.00408634,0.0001308156,0.0003225997,0.0001541092,0.00006283701,0.0001371099,0.0003970641,0.9928158,0.0005155862,0.00001190665,0.001182327,0.0001834927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009242821,0.00009946244,0.9877009,0.0004412212,0.001925026,0.0004013507,0.00004247557,0.0001323727,0.00001438579],"genre_scores_gemma":[0.3211373,0.000006813716,0.6778805,0.0000244323,0.000834919,0.00003005777,0.00001034879,0.00005493192,0.00002067914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3118945,"threshold_uncertainty_score":0.6461972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05743903590744473,"score_gpt":0.3045569092903155,"score_spread":0.2471178733828708,"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."}}