{"id":"W2004480472","doi":"10.1016/j.ejor.2006.12.057","title":"Variable neighborhood search for minimum cost berth allocation","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":186,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Mathematical optimization; Tardiness; Heuristic; Computer science; Minification; Variable (mathematics); Memetic algorithm; Genetic algorithm; Retard; Local search (optimization); Mathematics; Metaheuristic; Job shop scheduling","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.009044541,0.00008284587,0.00011581,0.0002409643,0.0001763623,0.0001443766,0.0002533799,0.00002587863,0.0003750756],"category_scores_gemma":[0.0004518628,0.00007321869,0.00004492331,0.0002246423,0.000058659,0.0001706791,0.00003508053,0.0004234777,0.00004455927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009662053,"about_ca_system_score_gemma":0.0001711289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003135377,"about_ca_topic_score_gemma":0.000002410484,"domain_scores_codex":[0.9982568,0.0001560179,0.0004648773,0.00009525317,0.0006754652,0.0003516038],"domain_scores_gemma":[0.9977747,0.0005036271,0.00003147622,0.0001171481,0.001384505,0.0001885212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007722345,0.0005716011,0.002665365,0.0003772526,0.0004107785,0.0006689338,0.001503899,0.2513924,0.04735959,0.3213732,0.2076347,0.1652701],"study_design_scores_gemma":[0.003880863,0.001712884,0.02526185,0.0002432762,0.0000402711,0.0004155033,0.0006856496,0.163214,0.01368987,0.001668037,0.7885543,0.0006334941],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00802187,0.0003279737,0.8273253,0.0005847038,0.0004027805,0.0003599384,0.00002515182,0.00002129393,0.162931],"genre_scores_gemma":[0.9794556,0.00005799473,0.01762636,0.00006112996,0.001084855,0.000002401001,0.00003207946,0.00004082259,0.001638731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9714338,"threshold_uncertainty_score":0.4106815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08025433142720256,"score_gpt":0.3410985650891733,"score_spread":0.2608442336619707,"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."}}