{"id":"W6977306455","doi":"10.6084/m9.figshare.29663062","title":"Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm","year":2025,"lang":"en","type":"dataset","venue":"Figshare","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Solver; Scheduling (production processes); Schedule; Key (lock); Nonlinear programming; Routing (electronic design automation); Linear programming; Quadratic programming","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001519631,0.0005152651,0.000548094,0.0002997994,0.0001859503,0.0002690971,0.0002278635,0.0005152274,0.002527641],"category_scores_gemma":[0.0004388913,0.0005172489,0.00004132571,0.0006620315,0.00001707963,0.0002438082,0.0002272345,0.0007136114,0.00001818779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001479638,"about_ca_system_score_gemma":0.0001042107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006861648,"about_ca_topic_score_gemma":0.000004175948,"domain_scores_codex":[0.9982847,0.00009148699,0.0003740136,0.0005961871,0.0002530763,0.0004005502],"domain_scores_gemma":[0.9988697,0.0002472952,0.0002136159,0.0003974259,0.0001593852,0.0001125828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007338953,0.000009527567,0.00000292211,0.000649299,0.0001029755,0.00001318026,0.00003888862,0.4736156,0.000003595023,3.048809e-7,0.5217423,0.003814034],"study_design_scores_gemma":[0.0006594441,0.00005089787,0.0000180184,0.01210787,0.00009929201,0.000029538,0.00002432732,0.9047669,0.00006843144,0.000003374116,0.08143376,0.0007381515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"dataset","genre_gemma":"dataset","genre_scores_codex":[7.623533e-7,0.0006669552,0.01915883,0.00001135262,0.00003323211,0.0008174327,0.9784009,0.0004962835,0.0004142441],"genre_scores_gemma":[0.000005268322,0.00006845946,0.2242333,0.0000434036,0.0001015469,0.0001898934,0.7752395,0.00005407349,0.00006456252],"genre_candidate":"dataset","genre_consensus":"dataset","teacher_disagreement_score":0.4403086,"threshold_uncertainty_score":0.9997279,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007408907945701544,"score_gpt":0.2283564611687246,"score_spread":0.2209475532230231,"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."}}