Simulated Annealing versus Metropolis for a TSP instance
References (4)
- et al.
The Markov chain Monte Carlo method. An approach to approximate counting and integration
- et al.
The traveling salesman problem: A case study
Cited by (55)
Choosing the right algorithm with hints from complexity theory
2024, Information and ComputationA landscape-based analysis of fixed temperature and simulated annealing
2023, European Journal of Operational ResearchCitation Excerpt :A long-standing open question is to determine which of those two algorithms would obtain better results on a given instance, that is, whether it exists a temperature value for which FTA outperforms SA under any cooling scheme (Jerrum et al., 1996). This question has been addressed in the literature mostly from a theoretical point of view without a conclusive answer (Cohn & Fielding, 1999; Jerrum et al., 1996; Meer, 2007; Mühlenbein & Zimmermann, 2000; Orosz & Jacobson, 2002; Wegener et al., 2005). In this work we take instead a different approach, performing extensive experiments to understand how these two simple SLS methods perform on different problems and instances.
High efficient solar cells through multi-layer thickness optimization using particle swarm optimization and simulated annealing
2023, International Journal of Energy and Environmental EngineeringOptimisation of multiple travelling salesman problem using metaheuristic methods
2022, International Journal of Enterprise Network ManagementEfficient Aerial Data Collection with Cooperative Trajectory Planning for Large-Scale Wireless Sensor Networks
2022, IEEE Transactions on Communications
- 1
Partially supported by the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002-506778 and by the Danish Agency for Science, Technology and Innovation FNU. This publication only reflects the author's views.