{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259665,0.0001200634,0.0001098815,0.000248945,0.0005857762,0.0004508061,0.0001306406,0.00008772083,0.0001374059],"category_scores_gemma":[0.00006645935,0.0001039991,0.00001970027,0.000363733,0.00005439925,0.0004064043,0.00001637617,0.0003008348,0.000004827719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001688489,"about_ca_system_score_gemma":0.0002539459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001837662,"about_ca_topic_score_gemma":0.0002353231,"domain_scores_codex":[0.9989733,0.00007272619,0.0001938657,0.000222724,0.0002616562,0.000275756],"domain_scores_gemma":[0.9988994,0.0001575474,0.000006544309,0.0001458496,0.0007101063,0.00008056931],"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.0000487057,0.00008694052,0.0004016256,0.0000462927,0.00008696978,0.000006292947,0.0003168826,0.9386262,0.008053763,0.01026607,0.003715624,0.03834465],"study_design_scores_gemma":[0.0003756353,0.0001114857,0.001168764,0.00007546141,0.000007730179,0.000003937469,0.0003072027,0.9916464,0.003813549,0.000265828,0.002100735,0.0001232442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02851611,0.00008150657,0.9654747,0.0003055616,0.00009507614,0.0006336246,0.00008710592,0.0001388885,0.004667441],"genre_scores_gemma":[0.9328732,0.00001288103,0.06344587,0.000081566,0.0001088416,0.0003159686,0.002239555,0.00002545212,0.0008966615],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9043571,"threshold_uncertainty_score":0.4505376,"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."}}