{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035175,0.001100421,0.001785959,0.0009171225,0.0006416008,0.0008890854,0.00187421,0.001200918,0.002275181],"category_scores_gemma":[0.001995293,0.0004549866,0.001136456,0.001400967,0.0006268608,0.001045116,0.0008332601,0.0008359071,0.0005176757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007515111,"about_ca_system_score_gemma":0.002760514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009588001,"about_ca_topic_score_gemma":0.007933733,"domain_scores_codex":[0.9988685,0.0003609998,0.00006781511,0.0002000847,0.0002788188,0.0002236871],"domain_scores_gemma":[0.9993318,0.0003289736,0.00007780056,0.00005027869,0.0001621843,0.00004897979],"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.0002209322,0.0001681445,0.0017478,0.0001867345,0.0001466672,0.0002139526,0.00009289719,0.8739561,0.002492347,0.007967347,0.003412667,0.1093943],"study_design_scores_gemma":[0.00005396185,0.00008259631,0.0001844908,0.00001038733,0.00002573888,0.00008545951,0.00003048609,0.9936944,0.0005894052,0.004059172,0.001170288,0.00001349621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02397706,0.000632607,0.9708484,0.0002337127,0.0001249615,0.0001352213,0.00006696742,0.0006851443,0.00329582],"genre_scores_gemma":[0.4117538,0.0005662711,0.5814695,0.0003457324,0.0001504459,0.000447327,0.0003615176,0.0001608376,0.004744539],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009588001,"threshold_uncertainty_score":0.01906437,"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."}}