{"id":"W2113660803","doi":"10.1504/ijlsm.2012.044052","title":"An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities","year":2011,"lang":"en","type":"article","venue":"International Journal of Logistics Systems and Management","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Interdependence; Computer science; Heuristic; Travelling salesman problem; Ant colony optimization algorithms; Mathematical optimization; Genetic algorithm; Operations research; Process (computing); Heuristics; Path (computing); Artificial intelligence; Machine learning; Algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0009483736,0.00007366018,0.0001177626,0.0001548938,0.0001273607,0.000113751,0.0001441847,0.00002083061,0.000005695586],"category_scores_gemma":[0.00001756067,0.00006300315,0.00003151367,0.00003667156,0.00003881124,0.0001487746,0.000003128943,0.00004826153,1.846839e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006077063,"about_ca_system_score_gemma":0.00003779609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002599315,"about_ca_topic_score_gemma":0.0002469946,"domain_scores_codex":[0.998988,0.00008714384,0.000307252,0.0001112034,0.0003896156,0.0001167366],"domain_scores_gemma":[0.9991837,0.00004352,0.0003307513,0.00004392492,0.0003375128,0.00006057948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.001785616,0.001383089,0.01893416,0.0006793975,0.001104038,0.0009589269,0.107199,0.2424243,0.00007486379,0.6038764,0.0006095047,0.02097072],"study_design_scores_gemma":[0.02472301,0.006474049,0.2040866,0.007084547,0.003239931,0.0005213447,0.4210747,0.2307841,0.0006712044,0.006796815,0.09155237,0.002991306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01433643,0.00006382865,0.98248,0.00004697328,0.001025643,0.0002891568,0.00004834506,0.00001799707,0.001691607],"genre_scores_gemma":[0.9406192,0.00008160951,0.05896206,0.00002283869,0.0001783386,0.00001060611,0.00002517796,0.000008259822,0.00009184913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9262828,"threshold_uncertainty_score":0.2569194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03734421231318365,"score_gpt":0.3313965895271758,"score_spread":0.2940523772139921,"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."}}