{"id":"W4287668300","doi":"10.48550/arxiv.2009.06047","title":"Multi-Objective Optimization for Sustainable Closed-Loop Supply Chain\\n Network Under Demand Uncertainty: A Genetic Algorithm","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Supply chain; Reliability (semiconductor); Genetic algorithm; Time horizon; Multi-objective optimization; Computer science; Supply chain network; Mathematical optimization; Pareto principle; Operations research; Supply chain management; Business; Engineering; Mathematics; Marketing","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.0009837033,0.0009340326,0.001125974,0.0008364294,0.0005680399,0.001128447,0.001051317,0.001661041,0.002431572],"category_scores_gemma":[0.001451038,0.0005787706,0.0009125929,0.001104222,0.0005708005,0.0006492169,0.0009262722,0.001332574,0.0002057711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172911,"about_ca_system_score_gemma":0.001826658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01960699,"about_ca_topic_score_gemma":0.009374492,"domain_scores_codex":[0.9997248,0.0001038598,0.00001108786,0.00004992018,0.000058243,0.00005202266],"domain_scores_gemma":[0.999477,0.0003507779,0.00004208683,0.00001321706,0.00009451086,0.0000225747],"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.000008824722,0.00001294845,0.0001541863,0.00001373781,0.00001227891,0.00001653768,0.00001171602,0.9943052,0.00009252204,0.001016533,0.0001742302,0.004181301],"study_design_scores_gemma":[0.000004539728,0.000007994377,0.00003321122,0.000003121315,0.000002947037,0.000002039496,0.000004863951,0.9993216,0.00002878174,0.0004824574,0.0001070916,0.000001420919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05794353,0.0009766847,0.9267315,0.0006114651,0.00008237223,0.0001724984,0.0001337528,0.0003341412,0.01301392],"genre_scores_gemma":[0.7725624,0.0008399434,0.2165487,0.0002632127,0.00005384586,0.0006228779,0.0003539,0.00008419556,0.008670902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01960699,"threshold_uncertainty_score":0.03898573,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03536956635945015,"score_gpt":0.188039472220741,"score_spread":0.1526699058612908,"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."}}