{"id":"W2791239441","doi":"10.1016/j.ins.2018.03.013","title":"Modeling the speed-based vessel schedule recovery problem using evolutionary multiobjective optimization","year":2018,"lang":"en","type":"article","venue":"Information Sciences","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"Larus Technologies (Canada); Wilfrid Laurier University; University of Ottawa","funders":"Ministry of Economic Affairs; Ontario Centres of Excellence","keywords":"Schedule; Computer science; Multi-objective optimization; Mathematical optimization; Scalability; Evolutionary algorithm; Pareto optimal; Pareto principle; Port (circuit theory); Benchmark (surveying); Set (abstract data type); Optimization problem; Operations research; Artificial intelligence; Mathematics; Engineering; Algorithm; Machine learning","routes":{"ca_aff":true,"ca_fund":true,"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.0003676383,0.00007044806,0.00005318485,0.0001124832,0.0004092774,0.0001657626,0.0001318637,0.00003735062,0.00007802992],"category_scores_gemma":[0.000066295,0.00005165797,0.0000200879,0.0003401898,0.0001730346,0.001463991,0.00001811881,0.00005912334,0.00002494796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005941671,"about_ca_system_score_gemma":0.00009090183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008552348,"about_ca_topic_score_gemma":0.000004781557,"domain_scores_codex":[0.9993339,0.00001167127,0.0002268073,0.00006121641,0.0002240115,0.0001424024],"domain_scores_gemma":[0.9996274,0.00002977054,0.00004696863,0.00008443485,0.0001874539,0.00002395738],"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.000001949235,0.000002655424,0.00004822563,0.000009411642,0.000002419435,3.6406e-8,0.0002216958,0.9979299,0.00001473062,0.0002874954,0.0001310534,0.001350425],"study_design_scores_gemma":[0.00006895718,0.00002141819,0.00004966081,0.00001855902,0.000004312878,0.000002406345,0.0002871671,0.9985862,0.0001627131,0.0002894092,0.0004282659,0.00008097479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168029,0.00002611551,0.9656778,0.00006363587,0.000306944,0.0001494284,0.000008482591,0.0001124422,0.01685228],"genre_scores_gemma":[0.9155899,0.000005787407,0.08416669,0.0001253417,0.00008641591,0.000003925893,0.00001178822,0.000003428291,0.000006748051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.898787,"threshold_uncertainty_score":0.3147872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03167885742021213,"score_gpt":0.253580476244172,"score_spread":0.2219016188239599,"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."}}