{"id":"W2041485345","doi":"10.1016/j.orl.2005.01.009","title":"The multiple TSP with time windows: vehicle bounds based on precedence graphs","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Combinatorics; Traveling purchaser problem; Mathematics; Computer science; Similarity (geometry); Mathematical optimization; 2-opt; Routing (electronic design automation); Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.001376694,0.0001351634,0.00009574334,0.0001938646,0.001060214,0.0004744964,0.0003534633,0.00004877028,0.00009443751],"category_scores_gemma":[0.0003743923,0.00009933302,0.00003411314,0.0007578642,0.0002117965,0.0002613062,0.00002847819,0.0004976403,0.000268527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001791684,"about_ca_system_score_gemma":0.00006583147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003118791,"about_ca_topic_score_gemma":0.0001672544,"domain_scores_codex":[0.9980717,0.0003977861,0.0001867644,0.0002299929,0.0006229552,0.0004908284],"domain_scores_gemma":[0.9983967,0.0007968874,0.000008530838,0.0005230504,0.0001653008,0.0001095629],"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.00001952618,0.00002178082,0.0003249563,0.000004384004,0.0000139589,0.000001745787,0.0001580583,0.9656298,0.02668233,0.00008644521,0.004226022,0.002831007],"study_design_scores_gemma":[0.0004143796,0.00005906962,0.000769308,0.0000280755,0.000002799641,0.000001566196,0.00003059562,0.9840193,0.007808084,0.000002160459,0.006733983,0.0001307244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8108965,0.0001042993,0.1385361,0.03970207,0.0001502028,0.00161097,0.00002975057,0.0007958612,0.008174285],"genre_scores_gemma":[0.9476478,0.00001656316,0.05068595,0.0006441692,0.0001108346,0.0002085554,0.00001698719,0.0000562481,0.0006128723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1367513,"threshold_uncertainty_score":0.8154418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0257977929190062,"score_gpt":0.3082450610410842,"score_spread":0.282447268122078,"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."}}