{"id":"W4249802611","doi":"10.1007/0-306-48213-4_16","title":"TSP Software","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fortran; Travelling salesman problem; Java; Software; Pascal (unit); Heuristic; Programming language; Theoretical computer science; Focus (optics); Source code; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0001968258,0.0004894016,0.0004761152,0.0002475518,0.0001106781,0.0001053559,0.0002581404,0.0008101025,0.0005902884],"category_scores_gemma":[0.00009210894,0.0006105158,0.0001518837,0.0001006687,0.00004984764,0.0001580448,0.00006091703,0.0004545894,0.0001126948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003094077,"about_ca_system_score_gemma":0.00005608203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002624676,"about_ca_topic_score_gemma":3.166348e-7,"domain_scores_codex":[0.9983987,0.00002870058,0.0005580059,0.0003596097,0.0003733748,0.0002815604],"domain_scores_gemma":[0.9989119,0.0001095085,0.000169866,0.0004730251,0.0002357136,0.00009995963],"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.000004474693,0.000008436168,0.000004754239,0.00006283446,0.00004101284,0.00000512854,0.00001118826,0.9532731,0.000002562689,0.02831094,0.01700561,0.001269988],"study_design_scores_gemma":[0.001148407,0.00005731507,0.000003813747,0.0002122058,0.0001691925,0.000007156406,0.000001090538,0.8211206,0.0000921632,0.01744962,0.1584962,0.0012422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001285839,0.0003297791,0.5795809,0.00001017717,0.005546954,0.0002788544,0.00002878219,0.001367904,0.4128554],"genre_scores_gemma":[0.0006563603,0.0006182538,0.6326889,0.00007038014,0.003731081,0.00005326409,0.002743041,0.001242619,0.358196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1414906,"threshold_uncertainty_score":0.9996346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01147176297218699,"score_gpt":0.2210551803163071,"score_spread":0.2095834173441201,"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."}}