{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528476,0.001116666,0.000932258,0.0009644217,0.0005117409,0.0009100877,0.001577545,0.001910851,0.00250678],"category_scores_gemma":[0.001996021,0.0004223337,0.001009542,0.001213717,0.000471017,0.001021034,0.001088559,0.001476676,0.0005250098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006018262,"about_ca_system_score_gemma":0.001476361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002088062,"about_ca_topic_score_gemma":0.003023255,"domain_scores_codex":[0.9996377,0.0001183054,0.00001843769,0.00004309148,0.0001310606,0.00005135481],"domain_scores_gemma":[0.999558,0.0002363068,0.00004864204,0.00005157574,0.00006873406,0.00003672503],"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.0001236007,0.0002103131,0.0003282879,0.0001636607,0.00008946707,0.00009872116,0.00005025027,0.7951648,0.006953934,0.01751662,0.003534596,0.1757658],"study_design_scores_gemma":[0.00007943794,0.00009303023,0.00008627093,0.00001293511,0.0000299998,0.00004237373,0.00001711162,0.9877675,0.0008019099,0.00853884,0.002517902,0.00001275856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01902019,0.0005560958,0.9737269,0.0003060155,0.0002799559,0.0001753643,0.00009930776,0.0005731506,0.005263004],"genre_scores_gemma":[0.1738993,0.0005443501,0.8192276,0.0002632606,0.0001888803,0.0004011345,0.000180851,0.0002237486,0.005070907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00250678,"threshold_uncertainty_score":0.008386075,"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."}}