{"id":"W3086889218","doi":"10.1016/j.cie.2020.106832","title":"A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms","year":2020,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Tardiness; Mathematical optimization; Vehicle routing problem; Sorting; Computer science; Integer programming; Scheduling (production processes); Genetic algorithm; Job shop scheduling; Multi-objective optimization; Pareto principle; Algorithm; Routing (electronic design automation); 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002842475,0.000367822,0.0004428329,0.0001038887,0.00008877813,0.0002604942,0.0002267739,0.000224079,0.000007754407],"category_scores_gemma":[0.000151182,0.0003792554,0.00006087738,0.0005238246,0.00002999525,0.0002931534,0.0001317716,0.0006890182,0.000005576541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001000194,"about_ca_system_score_gemma":0.00007938993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000515232,"about_ca_topic_score_gemma":1.395573e-7,"domain_scores_codex":[0.9983867,0.00002835084,0.0004335617,0.0004124584,0.000259134,0.0004797789],"domain_scores_gemma":[0.9990831,0.0001946433,0.00006597,0.0001839532,0.00005580437,0.0004165469],"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.0000190854,0.000006144787,0.0001876387,0.00006588745,0.00008039582,0.00001016509,0.001157607,0.9842977,0.0008980301,0.0003375895,0.00005396154,0.01288583],"study_design_scores_gemma":[0.001624463,0.00007658953,0.0000486693,0.00020382,0.00003344886,0.00002173995,0.00003179592,0.9955758,0.001835084,0.00004906328,0.00007155717,0.00042799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0973701,0.00005403887,0.9006923,0.0001578739,0.0001569829,0.0003244882,0.000003698255,0.001084459,0.0001560594],"genre_scores_gemma":[0.4374685,0.000003386291,0.5618211,0.00004176439,0.0005381919,0.000009981109,0.000003497169,0.0001027612,0.00001079666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3400984,"threshold_uncertainty_score":0.9998659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03696480631051983,"score_gpt":0.251097348667721,"score_spread":0.2141325423572012,"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."}}