{"id":"W4309716785","doi":"10.5267/j.ijiec.2022.8.004","title":"Metaheuristic algorithm for the location, routing and packing problem in the collection of recyclable waste","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Vehicle routing problem; GRASP; Metaheuristic; Mathematical optimization; Greedy randomized adaptive search procedure; Routing (electronic design automation); Guided Local Search; Computer science; Set (abstract data type); Packing problems; Greedy algorithm; Local search (optimization); Combinatorial optimization; Scheme (mathematics); Algorithm; Mathematics","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.0008715641,0.0008887305,0.0008110652,0.0008887572,0.0005589843,0.0008825525,0.000947457,0.001373559,0.001685438],"category_scores_gemma":[0.00134502,0.0004720712,0.000915506,0.001398593,0.0005091153,0.0005651318,0.0005495517,0.0008545756,0.0002527011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00108776,"about_ca_system_score_gemma":0.00161839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00862831,"about_ca_topic_score_gemma":0.007910109,"domain_scores_codex":[0.9996644,0.0001870515,0.00001323213,0.00004032142,0.00005087704,0.00004405527],"domain_scores_gemma":[0.9995802,0.0003033083,0.00005163693,0.00001492338,0.00003337526,0.00001656455],"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.00003343723,0.00004495319,0.0001521931,0.00004759995,0.00003014075,0.00003573592,0.00002659658,0.9731966,0.0004666921,0.006904614,0.0005338314,0.01852768],"study_design_scores_gemma":[0.00001391662,0.00002495763,0.00004371003,0.000007367189,0.000007496805,0.00001003246,0.00001133629,0.9971845,0.0001672901,0.001985751,0.000540669,0.000002937231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0436358,0.001337492,0.9457774,0.0003558938,0.0000664535,0.0001831027,0.0001212622,0.0002934236,0.008229202],"genre_scores_gemma":[0.3355484,0.001141867,0.6567377,0.0001398108,0.00006162545,0.0006040568,0.0002724491,0.0001050607,0.005389042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00862831,"threshold_uncertainty_score":0.01715618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03077065338570313,"score_gpt":0.275353779444464,"score_spread":0.2445831260587608,"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."}}