Configuration space analysis of travelling salesman problems
J. Phys. France, 46 8 (1985) 1277-1292
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
DRL-ED-TSPP: A Deep Reinforcement Learning Model With Encoder-Decoder for Solving the Traveling Salesman Problem With Profits
Bin Hu and Liying ZhaoIEEE Access 13 111372 (2025)
https://doi.org/10.1109/ACCESS.2025.3582025
La vie et l’œuvre de Gérard Toulouse
Bernard Derrida, Marc Mézard, Jean-Pierre Nadal and Yves PomeauComptes Rendus. Physique 26 (G1) 253 (2025)
https://doi.org/10.5802/crphys.240
Tensor networks for p-spin models
Benjamin Lanthier, Jeremy Côté and Stefanos KourtisFrontiers in Physics 12 (2024)
https://doi.org/10.3389/fphy.2024.1431810
SoK: quantum computing methods for machine learning optimization
Hamza BaniataQuantum Machine Intelligence 6 (2) (2024)
https://doi.org/10.1007/s42484-024-00180-1
Optimizing with Attractor: A Tutorial
Weiqi LiACM Computing Surveys 56 (9) 1 (2024)
https://doi.org/10.1145/3648354
The Traveling Salesman Problem
Weiqi LiSynthesis Lectures on Operations Research and Applications, The Traveling Salesman Problem 37 (2024)
https://doi.org/10.1007/978-3-031-35719-0_4
Revolutionizing multi-objective interval traveling salesperson problem: A novel approach with interval arithmetic
N. Mathavan and G. RameshJournal of Intelligent & Fuzzy Systems 46 (4) 7539 (2024)
https://doi.org/10.3233/JIFS-235966
133 3 (2023)
https://doi.org/10.1007/978-3-031-48185-7_1
Variable Neighborhood Search: The power of change and simplicity
Jack Brimberg, Said Salhi, Raca Todosijević and Dragan UroševićComputers & Operations Research 155 106221 (2023)
https://doi.org/10.1016/j.cor.2023.106221
Computational Science – ICCS 2022
Tomasz Śmierzchalski, Łukasz Pawela, Zbigniew Puchała, Tomasz Trzciński and Bartłomiej GardasLecture Notes in Computer Science, Computational Science – ICCS 2022 13353 261 (2022)
https://doi.org/10.1007/978-3-031-08760-8_22
Finding Hierarchical Structures of Disordered Systems: An Application for Market Basket Analysis
Mauricio A. Valle and Gonzalo A. RuzIEEE Access 9 1626 (2021)
https://doi.org/10.1109/ACCESS.2020.3047537
Exploring energy landscapes at the DFTB quantum level using the threshold algorithm: the case of the anionic metal cluster Au$$_{20}^{-}$$
Mathias Rapacioli, J. Christian Schön and Nathalie TarratTheoretical Chemistry Accounts 140 (7) (2021)
https://doi.org/10.1007/s00214-021-02748-7
Optimal sampling strategy of water quality monitoring at high dynamic lakes: A remote sensing and spatial simulated annealing integrated approach
Jian Li, Liqiao Tian, Yihong Wang, et al.Science of The Total Environment 777 146113 (2021)
https://doi.org/10.1016/j.scitotenv.2021.146113
1209 (2020)
https://doi.org/10.1109/TENSYMP50017.2020.9231017
A crossover operator for improving the efficiency of permutation-based genetic algorithms
Behrooz KoohestaniExpert Systems with Applications 151 113381 (2020)
https://doi.org/10.1016/j.eswa.2020.113381
A Practical Methodology for Generating High-Resolution 3D Models of Open-Pit Slopes Using UAVs: Flight Path Planning and Optimization
Rushikesh Battulwar, Garrett Winkelmaier, Jorge Valencia, Masoud Zare Naghadehi, Bijan Peik, Behrooz Abbasi, Bahram Parvin and Javad SattarvandRemote Sensing 12 (14) 2283 (2020)
https://doi.org/10.3390/rs12142283
Nature-Inspired Computation in Navigation and Routing Problems
Aziz OuaarabSpringer Tracts in Nature-Inspired Computing, Nature-Inspired Computation in Navigation and Routing Problems 85 (2020)
https://doi.org/10.1007/978-981-15-1842-3_4
The Stochastic Multipath Traveling Salesman Problem with Dependent Random Travel Costs
Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba and Roberto TadeiTransportation Science 54 (5) 1372 (2020)
https://doi.org/10.1287/trsc.2020.0996
Replica symmetry and replica symmetry breaking for the traveling salesperson problem
Hendrik Schawe, Jitesh Kumar Jha and Alexander K. HartmannPhysical Review E 100 (3) (2019)
https://doi.org/10.1103/PhysRevE.100.032135
Optimal cruiser-drone traffic enforcement under energy limitation
Ariel Rosenfeld and Oleg MaksimovArtificial Intelligence 277 103166 (2019)
https://doi.org/10.1016/j.artint.2019.103166
1 (2019)
https://doi.org/10.1109/ECACE.2019.8679367
Average optimal cost for the Euclidean TSP in one dimension
Sergio Caracciolo, Andrea Di Gioacchino, Enrico M Malatesta and Carlo VanoniJournal of Physics A: Mathematical and Theoretical 52 (26) 264003 (2019)
https://doi.org/10.1088/1751-8121/ab1600
The threshold algorithm: Description of the methodology and new developments
Sridhar Neelamraju, Christina Oligschleger and J. Christian SchönThe Journal of Chemical Physics 147 (15) (2017)
https://doi.org/10.1063/1.4985912
Variable neighborhood search: basics and variants
Pierre Hansen, Nenad Mladenović, Raca Todosijević and Saïd HanafiEURO Journal on Computational Optimization 5 (3) 423 (2017)
https://doi.org/10.1007/s13675-016-0075-x
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
Anis Mjirda, Raca Todosijević, Saïd Hanafi, Pierre Hansen and Nenad MladenovićInternational Transactions in Operational Research 24 (3) 615 (2017)
https://doi.org/10.1111/itor.12282
Phase transitions in integer linear problems
S Colabrese, D De Martino, L Leuzzi and E MarinariJournal of Statistical Mechanics: Theory and Experiment 2017 (9) 093404 (2017)
https://doi.org/10.1088/1742-5468/aa85c3
Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator
Abid Hussain, Yousaf Shad Muhammad, M. Nauman Sajid, et al.Computational Intelligence and Neuroscience 2017 1 (2017)
https://doi.org/10.1155/2017/7430125
Performance Evaluation of Selection Methods of Genetic Algorithm and Network Security Concerns
Hari Mohan PandeyProcedia Computer Science 78 13 (2016)
https://doi.org/10.1016/j.procs.2016.02.004
Metaheuristics
Patrick SiarryMetaheuristics 19 (2016)
https://doi.org/10.1007/978-3-319-45403-0_2
CUDAP: A Novel Clustering Algorithm for Uncertain Data Based on Approximate Backbone
Ping Jin, Shichao Qu, Yu Zong and Xin LiJournal of Software 9 (3) (2014)
https://doi.org/10.4304/jsw.9.3.732-737
Hardware and Software: Verification and Testing
Michael Codish, Yoav Fekete and Amit MetodiLecture Notes in Computer Science, Hardware and Software: Verification and Testing 8244 1 (2013)
https://doi.org/10.1007/978-3-319-03077-7_1
An Evaluation of Methods for Estimating the Number of Local Optima in Combinatorial Optimization Problems
Leticia Hernando, Alexander Mendiburu and Jose A. LozanoEvolutionary Computation 21 (4) 625 (2013)
https://doi.org/10.1162/EVCO_a_00100
Handbook of Combinatorial Optimization
Jens StarkeHandbook of Combinatorial Optimization 1065 (2013)
https://doi.org/10.1007/978-1-4419-7997-1_43
Proceedings of the Sixth International Conference on Management Science and Engineering Management
Fausto Pedro Garc’ıa M’arquez and Marta Ramos Mart’ın NietoLecture Notes in Electrical Engineering, Proceedings of the Sixth International Conference on Management Science and Engineering Management 185 23 (2013)
https://doi.org/10.1007/978-1-4471-4600-1_2
Applied Data Mining
Applied Data Mining 153 (2013)https://doi.org/10.1201/b15027-10
Corrections to scaling for watersheds, optimal path cracks, and bridge lines
E. Fehr, K. J. Schrenk, N. A. M. Araújo, et al.Physical Review E 86 (1) (2012)
https://doi.org/10.1103/PhysRevE.86.011117
Evaluation of the physical annealing strategy for simulated annealing: A function-based analysis in the landscape paradigm
M. HasegawaPhysical Review E 85 (5) (2012)
https://doi.org/10.1103/PhysRevE.85.056704
Replica symmetry of the minimum matching
Johan WästlundAnnals of Mathematics 175 (3) 1061 (2012)
https://doi.org/10.4007/annals.2012.175.3.2
Ubiquitous Fractal Dimension of Optimal Paths
Jose S. Andrade, Saulo D.S. Reis, Erneson A. Oliveira, Eric Fehr and Hans J. HerrmannComputing in Science & Engineering 13 (1) 74 (2011)
https://doi.org/10.1109/MCSE.2011.16
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
J. Majumdar and A.K. BhuniaJournal of Computational and Applied Mathematics 235 (9) 3063 (2011)
https://doi.org/10.1016/j.cam.2010.12.027
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search
Xiutang Geng, Zhihua Chen, Wei Yang, Deqian Shi and Kai ZhaoApplied Soft Computing 11 (4) 3680 (2011)
https://doi.org/10.1016/j.asoc.2011.01.039
Asymptotic properties of combinatorial optimization problems in p-adic space
Mukadas D. Missarov and Roman G. StepanovP-Adic Numbers, Ultrametric Analysis, and Applications 3 (2) 114 (2011)
https://doi.org/10.1134/S207004661102004X
Seeking global edges for traveling salesman problem in multi-start search
Weiqi LiJournal of Global Optimization 51 (3) 515 (2011)
https://doi.org/10.1007/s10898-010-9643-4
Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem
M. HasegawaPhysical Review E 83 (3) (2011)
https://doi.org/10.1103/PhysRevE.83.036708
Optimal-path cracks in correlated and uncorrelated lattices
E. A. Oliveira, K. J. Schrenk, N. A. M. Araújo, H. J. Herrmann and J. S. AndradePhysical Review E 83 (4) (2011)
https://doi.org/10.1103/PhysRevE.83.046113
HC_AB: A new heuristic clustering algorithm based on Approximate Backbone
Yu Zong, Guandong Xu, Ping Jin, Yanchun Zhang and Enhong ChenInformation Processing Letters 111 (17) 857 (2011)
https://doi.org/10.1016/j.ipl.2011.05.020
The mean field traveling salesman and related problems
Johan WästlundActa Mathematica 204 (1) 91 (2010)
https://doi.org/10.1007/s11511-010-0046-7
146 599 (2010)
https://doi.org/10.1007/978-1-4419-1665-5_20
Traveling Salesman Problem with Clustering
Johannes J. Schneider, Thomas Bukur and Antje KrauseJournal of Statistical Physics 141 (5) 767 (2010)
https://doi.org/10.1007/s10955-010-0080-z
429 (2009)
https://doi.org/10.1109/ICINIS.2009.116
Ultrametricity property of energy landscapes of multidisperse packing problems
Johannes J. Schneider, André Müller and Elmar SchömerPhysical Review E 79 (3) (2009)
https://doi.org/10.1103/PhysRevE.79.031122
Matheuristics
Irina Dumitrescu and Thomas StützleAnnals of Information Systems, Matheuristics 10 103 (2009)
https://doi.org/10.1007/978-1-4419-1306-7_4
Metaheuristics
Metaheuristics 539 (2009)https://doi.org/10.1002/9780470496916.refs
Fracturing the Optimal Paths
J. S. Andrade, E. A. Oliveira, A. A. Moreira and H. J. HerrmannPhysical Review Letters 103 (22) (2009)
https://doi.org/10.1103/PhysRevLett.103.225503
3921 (2008)
https://doi.org/10.1109/ICMLC.2008.4621088
Intelligent Decision Support
Christian BierwirthIntelligent Decision Support 287 (2008)
https://doi.org/10.1007/978-3-8349-9777-7_17
On the Neighborhood Structure of the Traveling Salesman Problem Generated by Local Search Moves
Günther Stattenberger, Markus Dankesreiter, Florian Baumgartner and Johannes J. SchneiderJournal of Statistical Physics 129 (4) 623 (2007)
https://doi.org/10.1007/s10955-007-9382-1
Modelling the dynamics of stochastic local search on k-sat
Nicolas G. FournierJournal of Heuristics 13 (6) 587 (2007)
https://doi.org/10.1007/s10732-007-9023-5
The simulation of spin glass model of neural networks by the Wang–Landau algorithm
F. Yaşar and M. DilaverComputer Physics Communications 177 (8) 625 (2007)
https://doi.org/10.1016/j.cpc.2007.05.017
Advances in Metaheuristics for Hard Optimization
Horacio Martínez-AlfaroNatural Computing Series, Advances in Metaheuristics for Hard Optimization 23 (2007)
https://doi.org/10.1007/978-3-540-72960-0_2
Stochastic Local Search
Stochastic Local Search 575 (2005)https://doi.org/10.1016/B978-155860872-6/50030-5
Inventory of damageable items with variable replenishment and unit production cost via simulated annealing method
Manas Kumar Maiti and Manoranjan MaitiComputers & Industrial Engineering 49 (3) 432 (2005)
https://doi.org/10.1016/j.cie.2005.07.004
THE INVESTIGATION OF THE SPIN GLASS PROPERTIES OF THE HOPFIELD NEURAL NETWORK MODEL
FATİH YAŞARInternational Journal of Modern Physics C 16 (03) 427 (2005)
https://doi.org/10.1142/S0129183105007224
Evolutionary Computation in Combinatorial Optimization
Christian Bierwirth, Dirk Christian Mattfeld and Jean-Paul WatsonLecture Notes in Computer Science, Evolutionary Computation in Combinatorial Optimization 3004 21 (2004)
https://doi.org/10.1007/978-3-540-24652-7_3
Two combinatorial models with identical statics yet different dynamics
David LancasterJournal of Physics A: Mathematical and General 37 (4) 1125 (2004)
https://doi.org/10.1088/0305-4470/37/4/003
MICAI 2004: Advances in Artificial Intelligence
Horacio Martínez-Alfaro and Manuel Valenzuela-RendónLecture Notes in Computer Science, MICAI 2004: Advances in Artificial Intelligence 2972 11 (2004)
https://doi.org/10.1007/978-3-540-24694-7_2
Configuration landscape analysis and backbone guided local search.
Weixiong ZhangArtificial Intelligence 158 (1) 1 (2004)
https://doi.org/10.1016/j.artint.2004.04.001
Handbook of Metaheuristics
Pablo Moscato and Carlos CottaInternational Series in Operations Research & Management Science, Handbook of Metaheuristics 57 105 (2003)
https://doi.org/10.1007/0-306-48056-5_5
О задачах комбинаторной оптимизации в ультраметричных пространствах
Mukadas Dmukhtasibovich Missarov, Мукадас Дмухтасибович Миссаров, Роман Григорьевич Степанов and Roman Grigor'evich StepanovТеоретическая и математическая физика 136 (1) 164 (2003)
https://doi.org/10.4213/tmf209
3 3038 (2003)
https://doi.org/10.1109/ICSMC.2003.1244354
Empirical Evidence for Ultrametric Structure in Multi-layer Perceptron Error Surfaces
Marcus Gallagher, Tom Downs and Ian WoodNeural Processing Letters 16 (2) 177 (2002)
https://doi.org/10.1023/A:1019956303894
Essays and Surveys in Metaheuristics
Pedro Castro Borges and Michael Pilegaard HansenOperations Research/Computer Science Interfaces Series, Essays and Surveys in Metaheuristics 15 129 (2002)
https://doi.org/10.1007/978-1-4615-1507-4_6
An efficient genetic algorithm for the traveling salesman problem with precedence constraints
Chiung Moon, Jongsoo Kim, Gyunghyun Choi and Yoonho SeoEuropean Journal of Operational Research 140 (3) 606 (2002)
https://doi.org/10.1016/S0377-2217(01)00227-2
Artificial Evolution
Mériéma Bélaidouni and Jin-Kao HaoLecture Notes in Computer Science, Artificial Evolution 2310 192 (2002)
https://doi.org/10.1007/3-540-46033-0_16
Universality classes for self-avoiding walks in a strongly disordered system
Lidia A. Braunstein, Sergey V. Buldyrev, Shlomo Havlin and H. Eugene StanleyPhysical Review E 65 (5) (2002)
https://doi.org/10.1103/PhysRevE.65.056128
A Taxonomy of Hybrid Metaheuristics
E.-G. TalbiJournal of Heuristics 8 (5) 541 (2002)
https://doi.org/10.1023/A:1016540724870
Computational Statistical Physics
Johannes Schneider and Ingo MorgensternComputational Statistical Physics 77 (2002)
https://doi.org/10.1007/978-3-662-04804-7_5
GAVEL - a new tool for genetic algorithm visualization
E. Hart and P. RossIEEE Transactions on Evolutionary Computation 5 (4) 335 (2001)
https://doi.org/10.1109/4235.942528
Variable neighborhood search: Principles and applications
Pierre Hansen and Nenad MladenovićEuropean Journal of Operational Research 130 (3) 449 (2001)
https://doi.org/10.1016/S0377-2217(00)00100-4
Optimization of the time-dependent traveling salesman problem with Monte Carlo methods
Johannes Bentner, Günter Bauer, Gustav M. Obermair, Ingo Morgenstern and Johannes SchneiderPhysical Review E 64 (3) (2001)
https://doi.org/10.1103/PhysRevE.64.036701
Principles and Practice of Constraint Programming — CP 2001
Weixiong ZhangLecture Notes in Computer Science, Principles and Practice of Constraint Programming — CP 2001 2239 153 (2001)
https://doi.org/10.1007/3-540-45578-7_11
Landscape Analyses of Search-Space in Travelling Salesman Problems
Hiroki Yoshizawa and Shuji HashimotoTransactions of the Japanese Society for Artificial Intelligence 16 309 (2001)
https://doi.org/10.1527/tjsai.16.309
Artificial Evolution
Meriema Belaidouni and Jin-Kao HaoLecture Notes in Computer Science, Artificial Evolution 1829 242 (2000)
https://doi.org/10.1007/10721187_18
Parallel Problem Solving from Nature PPSN VI
Meriema Belaidouni and Jin-Kao HaoLecture Notes in Computer Science, Parallel Problem Solving from Nature PPSN VI 1917 49 (2000)
https://doi.org/10.1007/3-540-45356-3_5
– Ant System
Thomas Stützle and Holger H. HoosFuture Generation Computer Systems 16 (8) 889 (2000)
https://doi.org/10.1016/S0167-739X(00)00043-1
Determining computational complexity from characteristic ‘phase transitions’
Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman and Lidror TroyanskyNature 400 (6740) 133 (1999)
https://doi.org/10.1038/22055
Towards hybrid evolutionary algorithms
P. Preux and E.‐G. TalbiInternational Transactions in Operational Research 6 (6) 557 (1999)
https://doi.org/10.1111/j.1475-3995.1999.tb00173.x
The Stochastic Traveling Salesman Problem: Finite Size Scaling and the Cavity Prediction
Allon G. Percus and Olivier C. MartinJournal of Statistical Physics 94 (5-6) 739 (1999)
https://doi.org/10.1023/A:1004570713967
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition
R�mi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman and Lidror TroyanskyRandom Structures and Algorithms 15 (3-4) 414 (1999)
https://doi.org/10.1002/(SICI)1098-2418(199910/12)15:3/4<414::AID-RSA10>3.0.CO;2-G
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Cyril Fonlupt, Denis Robilliard, Philippe Preux and El-Ghazali TalbiMeta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization 257 (1999)
https://doi.org/10.1007/978-1-4615-5775-3_18
Optimal paths in disordered media: Scaling of the crossover from self-similar to self-affine behavior
Markus Porto, Nehemia Schwartz, Shlomo Havlin and Armin BundePhysical Review E 60 (3) R2448 (1999)
https://doi.org/10.1103/PhysRevE.60.R2448
Neural Nets WIRN Vietri-99
Domenico MarinoPerspectives in Neural Computing, Neural Nets WIRN Vietri-99 376 (1999)
https://doi.org/10.1007/978-1-4471-0877-1_43
Landscapes, operators and heuristic search
C.R. ReevesAnnals of Operations Research 86 473 (1999)
https://doi.org/10.1023/A:1018983524911
Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy
Gilles Caporossi, Dragoš Cvetković, Ivan Gutman and Pierre HansenJournal of Chemical Information and Computer Sciences 39 (6) 984 (1999)
https://doi.org/10.1021/ci9801419
Polymer localization in attractive random media
A. BaumgaertnerThe Journal of Chemical Physics 109 (22) 10011 (1998)
https://doi.org/10.1063/1.477668
Barrier heights between ground states in a model of RNA secondary structure
Steven R Morgan and Paul G HiggsJournal of Physics A: Mathematical and General 31 (14) 3153 (1998)
https://doi.org/10.1088/0305-4470/31/14/005
Optimal path in two and three dimensions
Nehemia Schwartz, Alexander L. Nazaryev and Shlomo HavlinPhysical Review E 58 (6) 7642 (1998)
https://doi.org/10.1103/PhysRevE.58.7642
Handbook of Combinatorial Optimization
Jens Starke and Michael SchanzHandbook of Combinatorial Optimization 1217 (1998)
https://doi.org/10.1007/978-1-4613-0303-9_18
4 3953 (1998)
https://doi.org/10.1109/ICSMC.1998.726706
Statistical characterization of simulated annealing applied to the x-ray phase problem
Michael F. Zimmer and Wu-Pei SuPhysical Review E 58 (4) 5131 (1998)
https://doi.org/10.1103/PhysRevE.58.5131