{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/traveling-salesman-problem/papers/3","list_of":"/task/traveling-salesman-problem","task":"Traveling Salesman Problem","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,254],"of":254,"counts":{"archive_papers_tagged":254,"with_a_code_link":91,"where_syntology_ran_a_sample":27,"not_listed_spam_title":0,"listed":254,"listed_where_code_ran":27,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":24,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":24,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/traveling-salesman-problem","prev":"/task/traveling-salesman-problem/papers/2","next":null,"papers":[{"url":null,"slug":"generalized-nested-rollout-policy-adaptation","title":"Generalized Nested Rollout Policy Adaptation","date":"2020-03-22","arxiv_id":"2003.10024","repositories_listed":0,"syntology":null},{"url":null,"slug":"its-not-what-machines-can-learn-its-what-we","title":"It's Not What Machines Can Learn, It's What We Cannot Teach","date":"2020-02-21","arxiv_id":"2002.09398","repositories_listed":0,"syntology":null},{"url":null,"slug":"wism-windowing-surrogate-model-for-evaluation","title":"WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle","date":"2020-02-03","arxiv_id":"2002.00811","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-mechanism-of-combination-crossover","title":"New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem","date":"2020-01-14","arxiv_id":"2001.11590","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-multi-objectivization-approaches-for","title":"Multi-objectivization Inspired Metaheuristics for the Sum-of-the-Parts Combinatorial Optimization Problems","date":"2019-11-12","arxiv_id":"1911.04658","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-optimization-problems-through-fully","title":"Solving Optimization Problems through Fully Convolutional Networks: an Application to the Travelling Salesman Problem","date":"2019-10-27","arxiv_id":"1910.12243","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-greedy-constructive-heuristic","title":"Comparing Greedy Constructive Heuristic Subtour Elimination Methods for the Traveling Salesman Problem","date":"2019-10-15","arxiv_id":"1910.08625","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-neural-network-assisted-monte-carlo","title":"A Graph Neural Network Assisted Monte Carlo Tree Search Approach to Traveling Salesman Problem","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deepsimplex-reinforcement-learning-of-pivot","title":"DeepSimplex: Reinforcement Learning of Pivot Rules Improves the Efficiency of Simplex Algorithm in Solving Linear Programming Problems","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190910427","title":"A Time-Dependent TSP Formulation for the Design of an Active Debris Removal Mission using Simulated Annealing","date":"2019-09-23","arxiv_id":"1909.10427","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-local-search-neighborhood-with","title":"Generating Local Search Neighborhood with Synthesized Logic Programs","date":"2019-09-18","arxiv_id":"1909.08242","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-double-traveling-salesman-problem-with","title":"The double traveling salesman problem with partial last-in-first-out loading constraints","date":"2019-08-22","arxiv_id":"1908.08494","repositories_listed":0,"syntology":null},{"url":null,"slug":"som-guided-evolutionary-search-for-solving","title":"SOM-Guided Evolutionary Search for Solving MinMax Multiple-TSP","date":"2019-07-27","arxiv_id":"1907.11910","repositories_listed":0,"syntology":null},{"url":null,"slug":"ordernet-ordering-by-example","title":"OrderNet: Ordering by Example","date":"2019-05-27","arxiv_id":"1905.11536","repositories_listed":0,"syntology":null},{"url":null,"slug":"homotopic-convex-transformation-a-new-method","title":"Homotopic Convex Transformation: A New Landscape Smoothing Method for the Traveling Salesman Problem","date":"2019-05-14","arxiv_id":"1906.03223","repositories_listed":0,"syntology":null},{"url":null,"slug":"tauriel-targeting-traveling-salesman-problem","title":"TauRieL: Targeting Traveling Salesman Problem with a deep reinforcement learning inspired architecture","date":"2019-05-14","arxiv_id":"1905.05567","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-in-hierarchical-reinforcement","title":"Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies","date":"2019-02-26","arxiv_id":"1902.10140","repositories_listed":0,"syntology":null},{"url":"/paper/genetic-algorithms-and-the-traveling-salesman","slug":"genetic-algorithms-and-the-traveling-salesman","title":"Genetic Algorithms and the Traveling Salesman Problem a historical Review","date":"2019-01-17","arxiv_id":"1901.05737","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-robot-dubins-coverage-with-autonomous","title":"Multi-robot Dubins Coverage with Autonomous Surface Vehicles","date":"2018-08-07","arxiv_id":"1808.02552","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-group-optimization-with-ants-cgo","title":"Cooperative Group Optimization with Ants (CGO-AS): Leverage Optimization with Mixed Individual and Social Learning","date":"2018-08-01","arxiv_id":"1808.00524","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-task-allocation-in-multi-robot","title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering","date":"2018-07-20","arxiv_id":"1807.07957","repositories_listed":0,"syntology":null},{"url":null,"slug":"reduction-of-the-pareto-set-in-bicriteria","title":"Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem","date":"2018-05-27","arxiv_id":"1805.10606","repositories_listed":0,"syntology":null},{"url":null,"slug":"hidden-hamiltonian-cycle-recovery-via-linear","title":"Hidden Hamiltonian Cycle Recovery via Linear Programming","date":"2018-04-15","arxiv_id":"1804.05436","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-variable-neighborhood-search-for-flying","title":"A Variable Neighborhood Search for Flying Sidekick Traveling Salesman Problem","date":"2018-04-11","arxiv_id":"1804.03954","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-reinforcement-learning","title":"Hierarchical Reinforcement Learning: Approximating Optimal Discounted TSP Using Local Policies","date":"2018-03-13","arxiv_id":"1803.04674","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-planning-with-expected-finite-horizon","title":"Graph Planning with Expected Finite Horizon","date":"2018-02-10","arxiv_id":"1802.03642","repositories_listed":0,"syntology":null},{"url":null,"slug":"eb-gls-an-improved-guided-local-search-based","title":"EB-GLS: An Improved Guided Local Search Based on the Big Valley Structure","date":"2017-09-22","arxiv_id":"1709.07576","repositories_listed":0,"syntology":null},{"url":null,"slug":"opportunistic-self-organizing-migrating","title":"Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem","date":"2017-09-12","arxiv_id":"1709.03793","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-glass-box-interactive-machine-learning","title":"A glass-box interactive machine learning approach for solving NP-hard problems with the human-in-the-loop","date":"2017-08-03","arxiv_id":"1708.01104","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-faster-patch-ordering-method-for-image","title":"A Faster Patch Ordering Method for Image Denoising","date":"2017-04-26","arxiv_id":"1704.08090","repositories_listed":0,"syntology":null},{"url":null,"slug":"subpopulation-diversity-based-selecting","title":"Subpopulation Diversity Based Selecting Migration Moment in Distributed Evolutionary Algorithms","date":"2017-01-05","arxiv_id":"1701.01271","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-dynamic-programming","title":"A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit","date":"2017-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"internet-of-things-applications-animal","title":"Internet of Things Applications: Animal Monitoring with Unmanned Aerial Vehicle","date":"2016-10-17","arxiv_id":"1610.05287","repositories_listed":0,"syntology":null},{"url":null,"slug":"amr-to-text-generation-as-a-traveling","title":"AMR-to-text generation as a Traveling Salesman Problem","date":"2016-09-23","arxiv_id":"1609.07451","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deterministic-annealing-approach-to-the","title":"A Deterministic Annealing Approach to the Multiple Traveling Salesmen and Related Problems","date":"2016-04-14","arxiv_id":"1604.04169","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-optimization-problems-by-the-public","title":"Solving Optimization Problems by the Public Goods Game","date":"2016-04-07","arxiv_id":"1604.02929","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-evolutionary-strategy-based-on-partial","title":"An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems","date":"2016-02-12","arxiv_id":"1602.04186","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-min-cost-traveling-salesman-problem-1","title":"On the Min-cost Traveling Salesman Problem with Drone","date":"2015-12-04","arxiv_id":"1512.01503","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-and-combinatorial","title":"Message Passing and Combinatorial Optimization","date":"2015-08-20","arxiv_id":"1508.05013","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theoretical-basis-for-efficient","title":"A theoretical basis for efficient computations with noisy spiking neurons","date":"2014-12-18","arxiv_id":"1412.5862","repositories_listed":0,"syntology":null},{"url":null,"slug":"chases-and-escapes-and-optimization-problems","title":"Chases and Escapes, and Optimization Problems","date":"2014-12-01","arxiv_id":"1412.2114","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-ants-as-a-genetic-crossover-operator-in","title":"Using Ants as a Genetic Crossover Operator in GLS to Solve STSP","date":"2014-11-12","arxiv_id":"1411.3277","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-genetic-algorithm-with-a-local","title":"An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem","date":"2014-09-10","arxiv_id":"1409.3078","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interacting-replica-approach-applied-to","title":"An interacting replica approach applied to the traveling salesman problem","date":"2014-06-27","arxiv_id":"1406.7282","repositories_listed":0,"syntology":null},{"url":null,"slug":"augmentative-message-passing-for-traveling","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","date":"2014-06-04","arxiv_id":"1406.0941","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-genetic-algorithm-to-solve-traveling","title":"Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster","date":"2014-01-24","arxiv_id":"1401.6267","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-resilience-of-an-ant-based-system-in","title":"On the Resilience of an Ant-based System in Fuzzy Environments. An Empirical Study","date":"2014-01-19","arxiv_id":"1401.4660","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-generalized-traveling-salesman-problem","title":"The Generalized Traveling Salesman Problem solved with Ant Algorithms","date":"2013-10-09","arxiv_id":"1310.2350","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-in-dynamic-traveling-salesman","title":"A new approach in dynamic traveling salesman problem: a hybrid of ant colony optimization and descending gradient","date":"2013-07-29","arxiv_id":"1307.7435","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-traveling-salesman-problem-by-marker","title":"Solving Traveling Salesman Problem by Marker Method","date":"2013-07-22","arxiv_id":"1307.5674","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-discrete-state-transition-algorithm-for","title":"A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem","date":"2013-04-29","arxiv_id":"1304.7607","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-acs-algorithm-for-the-solutions","title":"An Improved ACS Algorithm for the Solutions of Larger TSP Problems","date":"2013-04-13","arxiv_id":"1304.3763","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-aggregates-in-answer-sets-an","title":"Nested Aggregates in Answer Sets: An Application to a Priori Optimization","date":"2013-04-05","arxiv_id":"1304.2799","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unifying-survey-of-reinforced-sensitive-and","title":"A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP","date":"2012-08-24","arxiv_id":"1208.4942","repositories_listed":0,"syntology":null}],"record_sha256":"156ff2551cd86c2c5647087cb3f44e2affc85374eb79fb58fabdc4de92ed270b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}