{"id":"W4410930226","doi":"10.1007/s12351-025-00940-2","title":"An accelerated Benders decomposition algorithm for integrated seaside operations planning with berthing preemption","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Preemption; Benders' decomposition; Computational intelligence; Decomposition; Computer science; Mathematical optimization; Operations research; Decomposition method (queueing theory); Operation planning; Algorithm; Artificial intelligence; Mathematics; Statistics; Operating system; Chemistry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028641,0.00134468,0.001317798,0.000770222,0.0005744318,0.001051678,0.001416028,0.0009998607,0.007122629],"category_scores_gemma":[0.002094036,0.000951629,0.001147014,0.000937199,0.0003844791,0.001179711,0.001304174,0.001954239,0.001332906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007676855,"about_ca_system_score_gemma":0.002371161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009606848,"about_ca_topic_score_gemma":0.01295652,"domain_scores_codex":[0.9994217,0.0001493967,0.00002995506,0.0001050178,0.0001897236,0.0001043208],"domain_scores_gemma":[0.999345,0.0002859278,0.00005634749,0.00007580446,0.0001713295,0.00006557777],"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.0003049353,0.0001522311,0.0003475889,0.00008103583,0.00006016079,0.0000530058,0.00005416157,0.8232218,0.003512394,0.007530365,0.003857638,0.1608246],"study_design_scores_gemma":[0.00002474743,0.00002943219,0.00004670033,0.000004084266,0.000006284921,0.00000725866,0.000005973573,0.9972179,0.0003433706,0.001755366,0.0005552129,0.000003641063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01345776,0.0001323099,0.981945,0.00008312813,0.000076709,0.0000761254,0.0001100826,0.0007098988,0.003409068],"genre_scores_gemma":[0.1254134,0.0001117647,0.8692998,0.00007620994,0.0000491472,0.0001843469,0.0003822395,0.0003037081,0.004179253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009606848,"threshold_uncertainty_score":0.02382761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07833009290925859,"score_gpt":0.410827688518579,"score_spread":0.3324975956093204,"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."}}