Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
From MaRDI portal
Publication:790720
Recommendations
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Optimization by simulated annealing
- Approximate algorithms for the traveling salesman problem. II
- Traveling Salesman Problem and Statistical Physics
- Travelling salesman problem solved with simulation techniques
Cited in
(only showing first 100 items - show all)- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- The generation of random equilateral polygons
- Methods for the one-dimensional space allocation problem
- A survey on optimization metaheuristics
- Simulated annealing for complex portfolio selection problems.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- The stochastic traveling salesman problem: finite size scaling and the cavity prediction
- Product line selection and pricing under a share-of-surplus choice model.
- Selected topics on assignment problems
- Comparison of metaheuristic algorithms for examination timetabling problem
- Heuristic algorithms for the cardinality constrained efficient frontier
- A theoretical framework for simulated annealing
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- The dynamic vehicle allocation problem with application in trucking companies in Brazil
- The generalized balanced academic curriculum problem with heterogeneous classes
- A probabilistic construction of model validation
- Local search algorithms for political districting
- Robust designs for binary data: applications of simulated annealing
- Ant colony optimization theory: a survey
- Random tours in the traveling salesman problem: Analysis and application
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A nested simulated annealing algorithm
- A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
- CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS
- The direct discontinuous Galerkin (DDG) viscous flux scheme for the high order spectral volume method
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Algorithms for the maximum satisfiability problem
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Strategic design of competing supply chain networks with foresight
- Hybrid heuristics for examination timetabling problem
- Theory of genetic algorithms
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Metaheuristics: A bibliography
- Easily searched encodings for number partitioning
- Genetic algorithms for the traveling salesman problem
- Good solutions to discrete noxious location problems via metaheuristics
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Heuristic algorithms for the maximum diversity problem
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- A variational inference for the Lévy adaptive regression with multiple kernels
- Stochastic techniques for global optimization: A survey of recent advances
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- A new hybrid descent method with application to the optimal design of finite precision FIR filters
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- GENERATING OPTIMAL CONFIGURATIONS IN STRUCTURAL DESIGN USING SIMULATED ANNEALING
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
- \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs
- DSS for multiobjective project scheduling
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Forecasting nonstationary time series based on Hilbert-Huang transform and machine learning
- A genetic algorithm methodology for complex scheduling problems
- Large-step Markov chains for the TSP incorporating local search heuristics
- Symmetries in the optimal control of solar sail spacecraft
- Stratified sampling for the Ising model: A graph-theoretic approach
- Quantum stochastic optimization
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- On the classification of NP-complete problems in terms of their correlation coefficient
- Local search and lower bounds for the patient admission scheduling problem
- Traveling solitary waves for doubly-resonant media: computation via simulated annealing
- Selective inference for latent block models
- Global optimization numerical strategies for rate-independent processes
- Hybrid metaheuristics: an introduction
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
- On the Weibull cost estimation of building frames designed by simulated annealing
- A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters
- Heuristics for cardinality constrained portfolio optimization
- Simulated annealing for the machine reassignment problem
- Estimating the parameters of a Gompertz-type diffusion process by means of simulated annealing
- Single vehicle routing with a predefined customer sequence and multiple depot returns
- Allocation search methods for a generalized class of location-allocation problems
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- General local search methods
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
- Bin-packing by simulated annealing
- Monte Carlo hyper-heuristics for examination timetabling
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A dual latent class unfolding model for two-way two-mode preference rating data
- Simulated annealing: A tool for operational research
- HSAGA and its application for the construction of near-Moore digraphs
- Convergence of the simulated annealing algorithm for continuous global optimization
- Solution quality of random search methods for discrete stochastic optimization
- The effect of the density of states on the Metropolis algorithm
- Injecting problem-dependent knowledge to improve evolutionary optimization search ability
- Diagnostic analysis and computational strategies for estimating discrete time duration models -- a Monte Carlo study
- A systematic procedure for setting parameters in simulated annealing algorithms
- Minimum norm solution of the absolute value equations via simulated annealing algorithm
- Boltzmann machines for travelling salesman problems
- Simulated annealing with extended neighbourhood
This page was built for publication: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790720)
