{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421636,0.00104377,0.0009938811,0.001479564,0.0006696727,0.0008352475,0.001734981,0.000974086,0.002663527],"category_scores_gemma":[0.00201464,0.0004393631,0.0009407829,0.001146641,0.0005975329,0.0008734193,0.0007916036,0.0008967684,0.0004550059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009280426,"about_ca_system_score_gemma":0.001141601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003078102,"about_ca_topic_score_gemma":0.003904673,"domain_scores_codex":[0.9992687,0.0003763461,0.00001901848,0.00006546386,0.0002180142,0.00005246376],"domain_scores_gemma":[0.9995246,0.0002972588,0.00004860258,0.00002782857,0.00007348415,0.00002823981],"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.00004151476,0.00008642588,0.0002760674,0.00008971412,0.00005838539,0.00005380479,0.00006576834,0.9191289,0.001133263,0.02507399,0.001111852,0.05288041],"study_design_scores_gemma":[0.00001352104,0.00006195842,0.00006557583,0.0000145801,0.00001195638,0.00002888771,0.00001715571,0.9926286,0.0003496784,0.005298243,0.001502734,0.000007066328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008940093,0.0003967233,0.9858166,0.00008066267,0.00003469874,0.0001157996,0.00003540592,0.0001199005,0.004460135],"genre_scores_gemma":[0.2393679,0.0006734623,0.7527687,0.0001744028,0.0000694036,0.0006355126,0.000191166,0.0001662136,0.005953218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003078102,"threshold_uncertainty_score":0.008910358,"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."}}