{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001608959,0.00008042152,0.0001332274,0.0002721326,0.0001219251,0.00005492265,0.0002830173,0.00003035362,0.000004273452],"category_scores_gemma":[0.000469939,0.00006556412,0.00004942632,0.0005525941,0.00001518801,0.0001087191,0.00003491286,0.0003536587,5.864766e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001493208,"about_ca_system_score_gemma":0.00007389176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504215,"about_ca_topic_score_gemma":0.000001037569,"domain_scores_codex":[0.9989386,0.00009151854,0.0004903532,0.00006314825,0.0003189617,0.00009737215],"domain_scores_gemma":[0.9980477,0.001338448,0.0002149335,0.00005926502,0.0003215062,0.00001812103],"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.000007451387,0.00001519534,0.000128776,0.000005629192,0.00009972574,0.00000142203,0.0007420138,0.9807552,0.00009126184,0.0004317015,0.0002719092,0.01744976],"study_design_scores_gemma":[0.0007362628,0.00004813545,0.0001839229,0.00005274458,0.00003649402,0.00009061553,0.0006727641,0.9970351,0.0001412573,0.0001619879,0.0007806991,0.00005999797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.010636,0.0002175992,0.9867333,0.0008020913,0.001289158,0.0002660927,0.00001473841,0.00002018282,0.00002088349],"genre_scores_gemma":[0.9100276,0.00002021735,0.08951002,0.00001935479,0.0003486446,0.00003844103,0.000007100213,0.00001939887,0.000009244308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8993916,"threshold_uncertainty_score":0.2673627,"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."}}