{"id":"W2087852198","doi":"10.1016/j.ejor.2012.03.044","title":"A simple and effective metaheuristic for the Minimum Latency Problem","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":135,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Travelling salesman problem; Iterated local search; Scheduling (production processes); Benchmark (surveying); Iterated function; Job shop scheduling; Variable neighborhood search; Simple (philosophy); Algorithm; Mathematics","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.009760468,0.00006920951,0.00010115,0.0001077471,0.0002280079,0.0001010305,0.0001585244,0.00001292706,0.00003928108],"category_scores_gemma":[0.001386619,0.00004542273,0.00003981698,0.0001646906,0.00006072554,0.00021911,0.00004165184,0.0003096998,0.00001290223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003748576,"about_ca_system_score_gemma":0.00003238425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.711927e-7,"about_ca_topic_score_gemma":1.456731e-7,"domain_scores_codex":[0.9982641,0.000836074,0.0002652594,0.00005857172,0.0003416205,0.0002343894],"domain_scores_gemma":[0.9973578,0.001903829,0.00003650767,0.00007994432,0.0005128916,0.000108965],"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.0004034032,0.0002705945,0.01081333,0.0004408372,0.001039636,0.00004988518,0.009124483,0.7125514,0.04222909,0.01937935,0.04723997,0.1564581],"study_design_scores_gemma":[0.004010547,0.001400333,0.1888905,0.0001877428,0.0001671294,0.0005408425,0.0008208087,0.6527599,0.005374258,0.001387681,0.1438799,0.0005803425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1813102,0.005648646,0.7999343,0.001435997,0.000482071,0.001338174,0.00002081739,0.00004586491,0.00978388],"genre_scores_gemma":[0.9527813,0.00009362841,0.04638804,0.00002511149,0.0005146125,0.00001120725,0.000001702107,0.00003187916,0.0001525169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7714711,"threshold_uncertainty_score":0.3382803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07068969871385707,"score_gpt":0.3724969292405628,"score_spread":0.3018072305267057,"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."}}