{"id":"W1940310189","doi":"10.1002/atr.1212","title":"Pruning and ranking the Pareto optimal set, application for the dynamic multi‐objective network design problem","year":2012,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Ranking (information retrieval); Pareto principle; Pruning; Set (abstract data type); Computer science; Sorting; Multi-objective optimization; Genetic algorithm; Rank (graph theory); Data mining; Operations research; Mathematics; Machine learning; Algorithm","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.003162734,0.00129374,0.001252299,0.00273883,0.0009122504,0.001415727,0.0007512029,0.00101007,0.001942874],"category_scores_gemma":[0.006309211,0.0005082301,0.001219185,0.001975502,0.0007275653,0.0008186908,0.001090328,0.001567814,0.0002470557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001073969,"about_ca_system_score_gemma":0.001501356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004970672,"about_ca_topic_score_gemma":0.004894806,"domain_scores_codex":[0.9983991,0.0007094885,0.0001015153,0.000148746,0.0005243818,0.0001167313],"domain_scores_gemma":[0.9971122,0.00194065,0.0002206774,0.0001153332,0.0005320251,0.0000790453],"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.00005651035,0.0001132387,0.001395887,0.0004286822,0.0001010703,0.000196427,0.0001794341,0.8100961,0.002498816,0.02336498,0.001697614,0.1598712],"study_design_scores_gemma":[0.00001971655,0.00008510294,0.000665557,0.0001178108,0.00003722626,0.00008147225,0.00007043933,0.9762873,0.0019331,0.01591771,0.004760522,0.00002403242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0343129,0.002523933,0.9537774,0.0003588416,0.00009915075,0.00018912,0.0001094157,0.0002229208,0.008406362],"genre_scores_gemma":[0.292466,0.001569205,0.7021279,0.0001234093,0.00006063823,0.000313736,0.0002519202,0.00008990445,0.002997298],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004970672,"threshold_uncertainty_score":0.01672637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08946750811913867,"score_gpt":0.3994948657090663,"score_spread":0.3100273575899277,"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."}}