{"id":"W3213598897","doi":"10.1108/srt-08-2021-0008","title":"Modeling a robust multi-objective locating-routing problem with bounded delivery time using meta-heuristic algorithms","year":2021,"lang":"en","type":"article","venue":"Smart and Resilient Transport","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Computer science; Tardiness; Sorting; Genetic algorithm; Particle swarm optimization; Bottleneck; Routing (electronic design automation); Heuristic; Algorithm; Mathematics; Job shop scheduling","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000452097,0.000327607,0.0004946765,0.0001043621,0.0002727035,0.0000604697,0.00008860933,0.0001239834,0.00002728191],"category_scores_gemma":[0.00002029367,0.0002914693,0.0001108438,0.0004268249,0.00006721796,0.000176969,0.00002004554,0.0002952895,0.000003405546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008080895,"about_ca_system_score_gemma":0.000122979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001137315,"about_ca_topic_score_gemma":0.0001059243,"domain_scores_codex":[0.998267,0.00008670552,0.0004554755,0.0004819772,0.0002751081,0.00043375],"domain_scores_gemma":[0.9992775,0.00005925375,0.00005113194,0.0002390496,0.0002341549,0.0001388993],"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.00001791982,0.00004285777,0.003227948,0.0001387635,0.0004953379,0.00006818763,0.0007917246,0.9935918,0.001195275,0.00001736339,0.000001618991,0.0004111366],"study_design_scores_gemma":[0.0007090279,0.00002639069,0.0004916602,0.0001473624,0.000876873,0.00007531565,0.0002614596,0.9956835,0.001318119,0.00001719788,0.00001271934,0.0003804054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3535214,0.0007286043,0.6448895,0.00001227585,0.00006889262,0.0002177025,0.00001184488,0.0002553109,0.0002944411],"genre_scores_gemma":[0.552267,0.00004822982,0.4473612,0.00001660382,0.00003704182,0.00001517516,0.00003398306,0.00006744504,0.0001532906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1987457,"threshold_uncertainty_score":0.9999537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03633847495880669,"score_gpt":0.24317006625681,"score_spread":0.2068315912980034,"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."}}