{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001472438,0.0007954585,0.00100044,0.002192826,0.0005166233,0.000904227,0.001401548,0.001105294,0.002535811],"category_scores_gemma":[0.002685659,0.0005877668,0.0007271206,0.00212058,0.0005589979,0.0007779044,0.0005762291,0.0005498213,0.0002688422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174485,"about_ca_system_score_gemma":0.002397387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01243861,"about_ca_topic_score_gemma":0.01624138,"domain_scores_codex":[0.999418,0.0002321331,0.00003379753,0.00008964381,0.0001580562,0.00006825721],"domain_scores_gemma":[0.9987686,0.0008260025,0.000116922,0.00004637799,0.0001936477,0.00004846417],"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.00009473638,0.00012223,0.001258885,0.0001268354,0.00009037602,0.000119938,0.0000975974,0.8433442,0.002190728,0.00498823,0.001278327,0.1462879],"study_design_scores_gemma":[0.00003344006,0.00005415531,0.0002513512,0.0000110572,0.00001949723,0.00003455913,0.00003001656,0.9968339,0.000473809,0.001532368,0.0007151496,0.00001065535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04233523,0.0003057859,0.9524223,0.0001718906,0.00006428255,0.0002723557,0.0001097007,0.0004495561,0.003868872],"genre_scores_gemma":[0.2855093,0.0001711578,0.711516,0.00008981187,0.00003088888,0.0004736087,0.0001667022,0.00006167513,0.001980897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01243861,"threshold_uncertainty_score":0.02473241,"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."}}