{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009902894,0.0008938288,0.001016863,0.0008778759,0.0004918808,0.001371932,0.001303984,0.002173469,0.003261502],"category_scores_gemma":[0.002331408,0.0008477577,0.001044837,0.0008503019,0.0006473538,0.001057148,0.0008970799,0.001205551,0.0002559152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00137265,"about_ca_system_score_gemma":0.001668643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02038119,"about_ca_topic_score_gemma":0.01136634,"domain_scores_codex":[0.9997101,0.00009428019,0.0000101832,0.00005036401,0.00005721814,0.00007781399],"domain_scores_gemma":[0.999204,0.0005090453,0.0001148494,0.00002529806,0.00008756141,0.00005935463],"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.000004699614,0.000006069654,0.00005497836,0.000005233108,0.000003983641,0.00001025564,0.000002921774,0.9986306,0.00006167559,0.0006793074,0.00003501663,0.000505267],"study_design_scores_gemma":[0.000002205365,0.000004090948,0.000027006,0.000001119543,0.000001731987,0.000001763098,0.000002866518,0.9995583,0.00002242633,0.0003320742,0.00004551028,9.625718e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2113344,0.0006547823,0.7659005,0.000911253,0.000137871,0.0001466008,0.000321806,0.0001902874,0.02040244],"genre_scores_gemma":[0.9340451,0.0003467973,0.05325808,0.00008761462,0.00003592146,0.0001495532,0.0002000455,0.00008306641,0.01179379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02038119,"threshold_uncertainty_score":0.04052508,"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."}}