{"id":"W2557690748","doi":"10.1109/cec.2016.7744235","title":"A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows","year":2016,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; King Fahd University of Petroleum and Minerals","keywords":"Vehicle routing problem; Tabu search; Mathematical optimization; Benchmark (surveying); Pareto principle; Nash equilibrium; Computer science; Set (abstract data type); Heuristic; Variable (mathematics); Variable neighborhood search; Routing (electronic design automation); Multi-objective optimization; Metaheuristic; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006896329,0.0001736579,0.0001675581,0.00004246929,0.0001809691,0.00005597566,0.0001480831,0.00008311569,0.0000273396],"category_scores_gemma":[0.0001113825,0.00009049569,0.00005023557,0.0002251764,0.00004426035,0.0002189198,0.00003291128,0.00008311962,0.00002291547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008932234,"about_ca_system_score_gemma":0.00002039227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001698415,"about_ca_topic_score_gemma":0.000006449739,"domain_scores_codex":[0.9989773,0.00004786828,0.0002331054,0.0002260548,0.0001391024,0.0003765844],"domain_scores_gemma":[0.9989041,0.000612526,0.00005345151,0.0002722027,0.0001006679,0.00005704135],"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.0001268852,0.0000540159,0.003191465,0.000084691,0.0001672567,8.362421e-7,0.0005692987,0.8318551,0.1166559,0.0001964235,0.001136753,0.04596142],"study_design_scores_gemma":[0.001566658,0.00004213223,0.0006363935,0.00003383057,0.00002806654,0.00000544717,0.00007129954,0.9849638,0.01219092,0.00001323259,0.0002543242,0.0001938532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01008644,0.00001656582,0.9851755,0.0001738266,0.00003552791,0.001010835,0.000006891342,0.0005090269,0.00298538],"genre_scores_gemma":[0.651961,0.000002328269,0.3470744,0.00002065578,0.00005087907,0.000181687,0.000006141734,0.00004988146,0.0006529668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6418746,"threshold_uncertainty_score":0.3690307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01294104592102581,"score_gpt":0.2231873047745746,"score_spread":0.2102462588535488,"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."}}