{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736926,0.0008301538,0.003002594,0.001455303,0.000692285,0.001005691,0.002259236,0.002132658,0.005082293],"category_scores_gemma":[0.005496563,0.001117479,0.0007747776,0.001546649,0.0008964784,0.001560992,0.001032269,0.001226062,0.0003656876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001422858,"about_ca_system_score_gemma":0.001535914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01453596,"about_ca_topic_score_gemma":0.008811629,"domain_scores_codex":[0.9993406,0.0003547737,0.00002252047,0.00008319335,0.0001222562,0.0000767167],"domain_scores_gemma":[0.99691,0.002618438,0.00011102,0.00006617737,0.0002104449,0.00008396016],"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.0001505104,0.00006879581,0.0002147895,0.00004493601,0.00002954055,0.0000184621,0.00002586605,0.9726474,0.0002124197,0.005855035,0.001407223,0.01932514],"study_design_scores_gemma":[0.00001537608,0.00001195463,0.00003256955,0.000002077694,0.000002541467,0.000002136363,0.000003065305,0.9983625,0.00003280494,0.001452992,0.00008025747,0.000001693972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08224071,0.0008870762,0.9090352,0.0005031067,0.0001412064,0.0001594927,0.0002329579,0.0004175109,0.006382729],"genre_scores_gemma":[0.6495849,0.0003470926,0.337894,0.0001780919,0.000112355,0.0005142509,0.0005183826,0.0001782345,0.01067268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01453596,"threshold_uncertainty_score":0.02890271,"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."}}