{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054939,0.0009207986,0.0007609501,0.0007486934,0.0006358536,0.0007364931,0.001130496,0.0008792878,0.001840128],"category_scores_gemma":[0.001006762,0.0003405597,0.0006330386,0.0007176251,0.0003963414,0.0006280048,0.0008453646,0.0008415567,0.0005086869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000457239,"about_ca_system_score_gemma":0.001165507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003267853,"about_ca_topic_score_gemma":0.004025926,"domain_scores_codex":[0.999666,0.00009271621,0.00001173362,0.00004241328,0.0001550983,0.00003221495],"domain_scores_gemma":[0.9997756,0.00009028755,0.00002312974,0.0000170461,0.00007092708,0.00002307779],"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.00004664433,0.00009929641,0.0002516442,0.0001152171,0.00004031475,0.0001019544,0.00005607359,0.8597669,0.003719538,0.01012356,0.0018803,0.1237984],"study_design_scores_gemma":[0.00001585111,0.00004170115,0.00005527477,0.000007618383,0.000006569162,0.00003111434,0.00001105987,0.995659,0.0005762198,0.001815278,0.001774543,0.000005791462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01019606,0.0003077018,0.9841414,0.0001266831,0.00006131149,0.0001010025,0.00003740458,0.000225264,0.004803096],"genre_scores_gemma":[0.1732825,0.000497983,0.8196993,0.000122478,0.00003484575,0.0003083174,0.0001487175,0.0001059537,0.005799902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003267853,"threshold_uncertainty_score":0.006497681,"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."}}