{"id":"W2234524595","doi":"10.1007/978-3-319-24264-4_14","title":"A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Benchmark (surveying); Suite; Transit time; Port (circuit theory); Flow network; Revenue; Transit (satellite); Mathematical optimization; Heuristic; Network planning and design; Operator (biology); Operations research; Integer (computer science); Flow (mathematics); Integer programming; Scale (ratio); Class (philosophy); Transport engineering; Public transport; Algorithm; Telecommunications; Mathematics; Artificial intelligence; Engineering","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.001785757,0.002029826,0.00112992,0.001265281,0.0009828794,0.002137006,0.002474847,0.002634292,0.01887834],"category_scores_gemma":[0.007123,0.0009284135,0.002428003,0.001547383,0.00167175,0.00484178,0.003094976,0.005295265,0.001918471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001728183,"about_ca_system_score_gemma":0.001251123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084706,"about_ca_topic_score_gemma":0.002432227,"domain_scores_codex":[0.9990125,0.0003632651,0.00004770193,0.0002315925,0.0002745565,0.00007039266],"domain_scores_gemma":[0.997609,0.001757801,0.0001308901,0.0001904072,0.0002079185,0.0001039551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001275292,0.0002946623,0.0005885785,0.0006430355,0.0001041304,0.0002948389,0.0002997807,0.2799107,0.003057315,0.5857823,0.02707065,0.1018265],"study_design_scores_gemma":[0.00004405119,0.00009048161,0.0001983914,0.00009258775,0.00004380821,0.0001588243,0.00006495696,0.4959465,0.0005570013,0.4875814,0.01519568,0.00002639629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007751819,0.0005416322,0.9353638,0.002181375,0.000237642,0.0001918542,0.0002834573,0.0001433858,0.0533051],"genre_scores_gemma":[0.201813,0.003067503,0.7162302,0.001406003,0.001356703,0.0009589045,0.001071401,0.0003911392,0.07370517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01887834,"threshold_uncertainty_score":0.06315434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03359554269804536,"score_gpt":0.2199406000792333,"score_spread":0.186345057381188,"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."}}