{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006310865,0.0001524763,0.0002666188,0.0001134313,0.0004915347,0.0001372063,0.0004233817,0.00005993198,0.000007135858],"category_scores_gemma":[0.0005415925,0.0000803978,0.000133081,0.0004518233,0.00007631545,0.001123773,0.000008443783,0.0002399206,0.000001779323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005603456,"about_ca_system_score_gemma":0.00005107289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002544962,"about_ca_topic_score_gemma":0.00004244737,"domain_scores_codex":[0.9974898,0.000204788,0.001005926,0.0002102977,0.0007995048,0.0002896861],"domain_scores_gemma":[0.9933888,0.004392791,0.001251342,0.0002421535,0.0006465903,0.00007830671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0004910103,0.00002511627,0.003061597,0.000005809506,0.00003601787,8.91344e-7,0.008583523,0.826583,0.003580638,0.0003251435,0.00005294009,0.1572543],"study_design_scores_gemma":[0.003901235,0.0002876407,0.629429,0.0002217498,0.0002998142,0.00007429182,0.01587341,0.322536,0.0007055861,0.01708881,0.009188307,0.0003942055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1280228,0.001318404,0.8690152,0.0003151157,0.0003951341,0.0009132484,0.000006606535,0.000009695091,0.000003787253],"genre_scores_gemma":[0.7294946,0.00005963896,0.2701305,0.00006492691,0.0001636095,0.00005416295,0.00000246371,0.000014884,0.00001521357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6263674,"threshold_uncertainty_score":0.3780537,"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."}}