{"id":"W3020607345","doi":"10.5539/ijsp.v9n3p66","title":"Combined Nearest Greedy Algorithm With Randomized Iterated Greedy Algorithm to Solve Waste Collection Problem","year":2020,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Greedy randomized adaptive search procedure; Greedy algorithm; Vehicle routing problem; Computer science; Waste collection; Truck; Algorithm; Data collection; Total cost; Iterated function; Mathematical optimization; Routing (electronic design automation); Mathematics; Municipal solid waste; Engineering; Waste management; Statistics; Automotive engineering","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.0008645362,0.0001801375,0.000471668,0.0001514217,0.00006163328,0.0002244495,0.000236036,0.00005616942,0.00004548929],"category_scores_gemma":[0.0003263258,0.0001437747,0.00005711094,0.0002575413,0.00009991037,0.0001574989,0.00005558526,0.000315088,0.000006428333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001661009,"about_ca_system_score_gemma":0.0001110575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008701457,"about_ca_topic_score_gemma":0.00002967713,"domain_scores_codex":[0.9980596,0.0001191479,0.0007060143,0.0001867217,0.0007327093,0.0001958261],"domain_scores_gemma":[0.9977453,0.0003717935,0.0001788587,0.00008612691,0.001352175,0.0002657395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.1115005,0.001242778,0.01585386,0.002103964,0.01053063,0.002166043,0.02287332,0.147782,0.004767105,0.008103583,0.05627842,0.6167977],"study_design_scores_gemma":[0.04470344,0.001194085,0.00129576,0.0002783442,0.00007871261,0.0002184928,0.000124364,0.9439393,0.0006509334,0.004635893,0.002521287,0.0003594377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04161536,0.00007352899,0.9553494,0.001005594,0.0005759601,0.0008152854,0.0003094768,0.00004607798,0.0002092715],"genre_scores_gemma":[0.3711932,0.00008037941,0.6277578,0.0001375221,0.0006052012,0.00005870529,0.00005109964,0.0000529753,0.00006302958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7961572,"threshold_uncertainty_score":0.5862961,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01367359629195345,"score_gpt":0.247477067381277,"score_spread":0.2338034710893236,"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."}}