{"id":"W6936309044","doi":"10.57912/23891619.v1","title":"How to use combinatorial optimization problems (Traveling Salesman Problem) for procedural landscape generation","year":2023,"lang":"en","type":"other","venue":"Figshare","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Travelling salesman problem; Combinatorial optimization; Quadratic assignment problem; Lin–Kernighan heuristic; Cross-entropy method; Optimization problem; Extremal optimization","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110004,0.0007747865,0.0004016462,0.000726518,0.000616658,0.001563987,0.001255461,0.0009664835,0.01053632],"category_scores_gemma":[0.003973915,0.000557859,0.0009420943,0.0005936544,0.0007678241,0.002387006,0.001294653,0.001339962,0.002203122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004811549,"about_ca_system_score_gemma":0.0004872796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001459718,"about_ca_topic_score_gemma":0.002803721,"domain_scores_codex":[0.9994585,0.0002138845,0.00002281829,0.00009936988,0.0001604748,0.00004490765],"domain_scores_gemma":[0.9990519,0.000472046,0.00005663303,0.0002690226,0.000113625,0.00003670087],"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.00009784411,0.0002178248,0.0009476175,0.0003841925,0.0001048867,0.0002744503,0.000391116,0.4758638,0.02635886,0.1045172,0.01339986,0.3774423],"study_design_scores_gemma":[0.00004442074,0.00008275099,0.0003164109,0.0000554067,0.00003374746,0.0002450094,0.0001392486,0.8815051,0.01712529,0.06246131,0.03795635,0.00003491382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005876877,0.0000813995,0.9847895,0.0002254889,0.00003315067,0.00007783166,0.0000655272,0.001129246,0.00772101],"genre_scores_gemma":[0.09387462,0.0001721539,0.901252,0.0001078149,0.00001080118,0.000177254,0.0002344515,0.001092334,0.003078559],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01053632,"threshold_uncertainty_score":0.0352475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08507430500134948,"score_gpt":0.2753217134192139,"score_spread":0.1902474084178644,"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."}}