{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156559,0.001230353,0.001066628,0.001052346,0.0004167962,0.001984569,0.001414441,0.001523921,0.002497473],"category_scores_gemma":[0.001936941,0.0006974868,0.001463774,0.001051609,0.0005552748,0.0009204973,0.000748074,0.001023903,0.0002607502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001526307,"about_ca_system_score_gemma":0.002243588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009603455,"about_ca_topic_score_gemma":0.007049893,"domain_scores_codex":[0.9994664,0.0002449224,0.00002403186,0.00009142143,0.00009960349,0.00007365961],"domain_scores_gemma":[0.9991879,0.0005337205,0.0001320706,0.00002717668,0.00008987978,0.00002916205],"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.000006663071,0.00001056621,0.0001091277,0.0000272415,0.00001316916,0.00001870826,0.000007850042,0.9957879,0.0001009633,0.002154479,0.00006587746,0.001697447],"study_design_scores_gemma":[0.000003241169,0.00001203705,0.00003485871,0.000007435641,0.000006578178,0.000004402154,0.00001043036,0.9985776,0.00005903598,0.001105431,0.000177108,0.000001792921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04888453,0.0008654187,0.9373133,0.00037249,0.00006584942,0.0001850218,0.0001658947,0.0001629571,0.0119845],"genre_scores_gemma":[0.7728251,0.0009820337,0.2192126,0.0001077872,0.00005660199,0.0005471585,0.0002108544,0.00006694056,0.005990873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009603455,"threshold_uncertainty_score":0.01909506,"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."}}