{"id":"W2811356407","doi":"10.5267/j.ijiec.2018.2.002","title":"Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"European Regional Development Fund; Région Normandie","keywords":"Ant colony optimization algorithms; Mathematical optimization; Scheduling (production processes); Job shop scheduling; Metaheuristic; Computer science; ANT; Optimization algorithm; Algorithm; Engineering; Mathematics; Schedule","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.000608752,0.0008223295,0.0009640381,0.0004633525,0.0004304352,0.0006790755,0.0008110265,0.0007249615,0.001289755],"category_scores_gemma":[0.00163516,0.000407886,0.0005547725,0.0005832499,0.0005456522,0.0005088494,0.0006162246,0.0008358813,0.0001323976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007581146,"about_ca_system_score_gemma":0.001529132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01256867,"about_ca_topic_score_gemma":0.007368905,"domain_scores_codex":[0.9996035,0.0001804059,0.00001678364,0.0000608804,0.00009112609,0.00004731194],"domain_scores_gemma":[0.9991695,0.0005663212,0.00009357814,0.00003207632,0.0001006734,0.00003794365],"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.00001329625,0.000007448064,0.0001113017,0.00001295179,0.000007931721,0.00001263488,0.00000821054,0.9957725,0.0002124727,0.0009654523,0.00008465013,0.002791092],"study_design_scores_gemma":[0.000003041593,0.00000608951,0.00001854883,0.000001214463,0.000001500675,0.00000254665,0.000002110465,0.9994982,0.00004744481,0.0003307373,0.00008759279,9.226486e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06027612,0.0006596334,0.931076,0.0003828337,0.00006905154,0.0001021791,0.00006907709,0.0002841939,0.007080865],"genre_scores_gemma":[0.8352319,0.0004545071,0.1613631,0.00007881148,0.00002957071,0.0002421283,0.0001375168,0.00005354391,0.002408969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01256867,"threshold_uncertainty_score":0.02499104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0377641593824354,"score_gpt":0.2843181667272819,"score_spread":0.2465540073448465,"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."}}