{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000363725,0.0001210955,0.0001397233,0.0002081111,0.00008049807,0.0001214083,0.0002376088,0.00008969534,0.00004855098],"category_scores_gemma":[0.0004293519,0.000102287,0.00008836842,0.0001663948,0.00003336308,0.0001417112,0.00001358628,0.0002146897,0.000001371369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001410286,"about_ca_system_score_gemma":0.000100744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001005708,"about_ca_topic_score_gemma":0.000001394315,"domain_scores_codex":[0.9989775,0.00001354049,0.0005062438,0.00007681173,0.0002890729,0.0001368455],"domain_scores_gemma":[0.9978724,0.000933402,0.0001598932,0.00006663767,0.0009117973,0.00005588802],"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.00001549745,0.00002022683,0.00001538056,0.000004660095,0.0001262182,0.000003989544,0.00007053163,0.9740719,0.0000231868,0.0001513907,0.0002523411,0.0252447],"study_design_scores_gemma":[0.0009549884,0.00009245915,0.00002076721,0.00009453957,0.00004491174,0.00001195928,0.00002347132,0.9943743,0.0001014282,0.00006466808,0.004107909,0.0001085746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004390715,0.00005235313,0.9956154,0.0005097251,0.00301146,0.0002163437,0.00004011888,0.00006568508,0.00004986969],"genre_scores_gemma":[0.7290756,0.000006813674,0.2681201,0.00003939795,0.002674815,0.00001000667,0.00003771321,0.00002668268,0.000008932213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7286365,"threshold_uncertainty_score":0.4171144,"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."}}