Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
From MaRDI portal
Publication:790720
DOI10.1007/BF00940812zbMath0534.90091WikidataQ55967971 ScholiaQ55967971MaRDI QIDQ790720
Publication date: 1985
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
approximate solutionsimportance samplingMonte Carlo algorithmtravelling salesmanBoltzmann-Gibbs distributionanalogy with thermodynamics
Programming involving graphs or networks (90C35) Monte Carlo methods (65C05) Integer programming (90C10) Classical and relativistic thermodynamics (80A10)
Related Items
A new heuristic algorithm for laser antimissile strategy optimization, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, A new hybrid descent method with application to the optimal design of finite precision FIR filters, On the Complexity of Random Satisfiability Problems with Planted Solutions, Multi-way graph partition by stochastic probe, État de l'art des méthodes “d'optimisation globale”, QUANTUM WALKS ON NECKLACES AND MIXING, Problems of discrete optimization: challenges and main approaches to solve them, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, GENERATING OPTIMAL CONFIGURATIONS IN STRUCTURAL DESIGN USING SIMULATED ANNEALING, Model-based selection of the robust JAK-STAT activation mechanism, Point and confidence interval estimates for a global maximum via extreme value theory, A theoretical framework for simulated annealing, The demon algorithm, Robust designs for binary data: applications of simulated annealing, Simulated annealing with extended neighbourhood, MULTISCALE COMPUTATIONS ON NEURAL NETWORKS: FROM THE INDIVIDUAL NEURON INTERACTIONS TO THE MACROSCOPIC-LEVEL ANALYSIS, A combined multistart-annealing algorithm for continuous global optimization, Simulated annealing procedure for on-line control with process dynamics, Procuring load curtailment from local customers under uncertainty, D-Wave and predecessors: From simulated to quantum annealing, Modeling and solving a real-life multi-skill shift design problem, An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem, A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean, Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem, Designing a hybrid reinforcement learning based algorithm with application in prediction of the COVID-19 pandemic in Quebec, Hybrid Metaheuristics: An Introduction, Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters, Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors, The Convergence of Markov Chain Monte Carlo Methods: From the Metropolis Method to Hamiltonian Monte Carlo, Metaheuristics: A Canadian Perspective, Forecasting short-term mortality trends using Bernstein polynomials, Mathematical aspects of the Digital Annealer's simulated annealing algorithm, Quantum optimal control: practical aspects and diverse methods, Tail probability estimates of continuous-time simulated annealing processes, A consensus-based model for global optimization and its mean-field limit, Golden Ratio Simulated Annealing for Protein Folding Problem, An optimal scaling to computationally tractable dimensionless models: study of latex particles morphology formation, The performance of the quantum adiabatic algorithm on spike Hamiltonians, Mixing time and simulated annealing for the stochastic cellular automata, A new adaptive mutation simulated annealing algorithm: application to the study of pure and mixed Pt-Pd clusters, Optimal topology design of industrial structures using an evolutionary algorithm, Content and Structure Coverage: Extracting a Diverse Information Subset, CHAOS SYNTHESIS BY MEANS OF EVOLUTIONARY ALGORITHMS, A nested simulated annealing algorithm, A computer‐aided methodology for the optimization of electrostatic separation processes in recycling, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing, Single vehicle routing with a predefined customer sequence and multiple depot returns, A simulated annealing algorithm for transient optimization in gas networks, Metaheuristics approach to the aircrew rostering problem, Why Does Large Batch Training Result in Poor Generalization? A Comprehensive Explanation and a Better Strategy from the Viewpoint of Stochastic Optimization, Simulated annealing: An introduction, Comparing descent heuristics and metaheuristics for the vehicle routing problem, \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing, Local search algorithms for political districting, The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach, Production Control of a Flexible Manufacturing System in a Job Shop Environment, Heuristic algorithms for the maximum diversity problem, DATA MINING AND MACHINE LEARNING IN ASTRONOMY, Theory of genetic algorithms, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, A genetic algorithm methodology for complex scheduling problems, A direct search variant of the simulated annealing algorithm for optimization involving continuous variables, Local search heuristics for two-stage flow shop problems with secondary criterion, A stopping criterion for logarithmic simulated annealing, Some results characterizing the finite time behaviour of the simulated annealing algorithm., Faster Monte Carlo simulations at low temperatures. The waiting time method, Statistical mechanics methods and phase transitions in optimization problems, Simulated annealing for single minimum optimization problems, Parallel Global Optimization in Multidimensional Scaling, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM, Simulated annealing for the bounds of Kendall's τ and Spearman's ρ, PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM, VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH, A fuzzy goal-programming model of machine-tool selection and operation allocation problem in FMS: a quick converging simulated annealing-based approach, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Unnamed Item, Finite-Time Behavior of Slowly Cooled Annealing Chains, Simulated Simulated Annealing, A Bayesian Approach to Simulated Annealing, Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods, An asymptotical study of combinatorial optimization problems by means of statistical mechanics, The influence of problem specific neighborhood structures in metaheuristics performance, Ant colony optimization theory: a survey, Optimization of Fresh Food Distribution Route Using Genetic Algorithm with the Best Selection Technique, Analytic Programming Powered by Chaotic Dynamics, Parallel continuous simulated annealing for global optimization simulated annealing∗, Simulated annealing based artificial bee colony algorithm for global numerical optimization, A new stochastic algorithm of global optimization—Region’s walk and contraction, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Survey: finite-state technology in natural language processing, Randomized algorithms in combinatorial optimization: A survey, Probabilistic exchange algorithms and Euclidean traveling salesman problems, Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms, An optimization model for minimizing systemic risk, Stratified sampling for the Ising model: A graph-theoretic approach, Traveling solitary waves for doubly-resonant media: computation via simulated annealing, On the convergence of stationary distributions in simulated annealing algorithms, Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling, A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters, Simulated annealing with noisy or imprecise energy measurements, Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems, Simulated annealing for the machine reassignment problem, A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks, 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, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Stochastic local search for the FEATURE SET problem, with applications to microarray data, Boltzmann machines for travelling salesman problems, A heuristic for the label printing problem, An application of simulated annealing to the cutting stock problem, On the Weibull cost estimation of building frames designed by simulated annealing, A production-inventory model for a deteriorating item incorporating learning effect using genetic algorithm, A method of spatial reasoning based on qualitative trigonometry, Modified simulated annealing algorithms for the flow shop sequencing problem, New concepts for activity float in resource-constrained project management, Minimum norm solution of the absolute value equations via simulated annealing algorithm, Estimating the parameters of a Gompertz-type diffusion process by means of simulated annealing, Local search and lower bounds for the patient admission scheduling problem, Calibration of GARCH models using concurrent accelerated random search, Adiabatic times for Markov chains and applications, The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem, Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions, Similarities between meta-heuristics algorithms and the science of life, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, Simulated annealing: A tool for operational research, The direct discontinuous Galerkin (DDG) viscous flux scheme for the high order spectral volume method, Methods for the one-dimensional space allocation problem, A controlled search simulated annealing method for the single machine weighted tardiness problem, Large-time behavior of perturbed diffusion Markov processes with applications to the second eigenvalue problem for Fokker-Planck operators and simulated annealing, Determination of initial temperature in fast simulated annealing, Mathematical and metaheuristic applications in design optimization of steel frame structures: an extensive review, Forecasting nonstationary time series based on Hilbert-Huang transform and machine learning, A probabilistic construction of model validation, The generalized balanced academic curriculum problem with heterogeneous classes, Parameter estimation with a novel gradient-based optimization method for biological lattice-gas cellular automaton models, Interactive diffusions for global optimization, Noisy gradient flow from a random walk in Hilbert space, Injecting problem-dependent knowledge to improve evolutionary optimization search ability, Trends in systolic and cellular computation, Diagnostic analysis and computational strategies for estimating discrete time duration models -- a Monte Carlo study, A survey on optimization metaheuristics, A stochastic probing algorithm for global optimization, Unrelated parallel machine scheduling -- perspectives and progress, Simulated annealing simulated, Golden ratio versus pi as random sequence sources for Monte Carlo integration, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Composite stock cutting through simulated annealing, HSAGA and its application for the construction of near-Moore digraphs, Large-step Markov chains for the TSP incorporating local search heuristics, The afforestation problem: A heuristic method based on simulated annealing, Stochastic techniques for global optimization: A survey of recent advances, Scheduling with neural networks -- the case of the Hubble Space Telescope, A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs, Good solutions to discrete noxious location problems via metaheuristics, A computational procedure for part design, A dual latent class unfolding model for two-way two-mode preference rating data, Strategic design of competing supply chain networks with foresight, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, The generation of random equilateral polygons, Selected topics on assignment problems, Global optimization numerical strategies for rate-independent processes, Jet analysis by deterministic annealing, The museum visitor routing problem, Positive role of glassy dynamics in finite-time optimization by threshold algorithms, On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics, Detecting irregular orbits in gravitational N-body simulations, Equation-free multiscale computational analysis of individual-based epidemic dynamics on networks, Decentralized multi-level uncapacitated lot-sizing by automated negotiation, Hub interdiction problem variants: models and metaheuristic solution algorithms, Global search algorithm for automated maintenance planning and scheduling of parts requests, Stochastic protein folding simulation in the three-dimensional HP-model, A binomial approximation method for the Ising model, Approximate solution of a resource-constrained scheduling problem, Comparison of non-linear optimization algorithms for yield curve estimation, Allocation search methods for a generalized class of location-allocation problems, Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective, Simulated annealing - to cool or not, The effect of the density of states on the Metropolis algorithm, General local search methods, Simulated annealing and quantum detailed balance, Determining dominant wind directions, Algorithms for the maximum satisfiability problem, A model for the convective cooling of electronic components with application to optimal placement, The single-finger keyboard layout problem, A fuzzy clustering method of construction of ontology-based user profiles, A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data, Numerical treatment of nonlinear Emden-Fowler equation using stochastic technique, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Symmetries in the optimal control of solar sail spacecraft, Metaheuristics in combinatorial optimization, On the statistical detection of clusters in undirected networks, Simulated annealing procedures for forming machine cells in group technology, A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis, Equivalent microstructure problem: mathematical formulation and numerical solution, Large-scale layout of facilities using a heuristic hybrid algorithm, Stochastic approximation of global minimum points, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Comparison of metaheuristic algorithms for examination timetabling problem, Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search, Joint determination of machine cells and linear intercell layout, DSS for multiobjective project scheduling, An adaptive simulated annealing algorithm for global optimization over continuous variables, Competitive multiple allocation hub location problem considering primary and backup routes, An analysis of why cuckoo search does not bring any novel ideas to optimization, Boolean query optimization and the 0-1 hyperbolic sum problem, Solving multifacility Huff location models on networks using metaheuristic and exact approaches, A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems, Ergodicity of the infinite swapping algorithm at low temperature, Constructing efficient simulated annealing algorithms, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, On selection of statistics for approximate Bayesian computing (or the method of simulated moments), A landscape-based analysis of fixed temperature and simulated annealing, Easily searched encodings for number partitioning, Divide and conquer strategies for parallel TSP heuristics, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Combining simulated annealing with local search heuristics, Focused simulated annealing search: An application to job shop scheduling, Genetic algorithms for the traveling salesman problem, Metaheuristics: A bibliography, The construction of antipodal triple systems by simulated annealing, Modelling constant weight codes using tabu search, Tabu search for the BWC problem, A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints, Job-shop scheduling: Computational study of local search and large-step optimization methods, Simulated annealing for manufacturing systems layout design, A systematic procedure for setting parameters in simulated annealing algorithms, Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations, Improvement heuristics for the vehicle routing problem based on simulated annealing, Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands, Simulated annealing for complex portfolio selection problems., Product line selection and pricing under a share-of-surplus choice model., Solving the continuous flow-shop scheduling problem by metaheuristics., A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space, A new methodology for evaluation of thermal or electrical conductivity of the skeleton of a porous material, On the classification of NP-complete problems in terms of their correlation coefficient, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem., The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach, Revisiting simulated annealing: a component-based analysis, Variants of the AES key schedule for better truncated differential bounds, Simulated annealing algorithms for continuous global optimization: Convergence conditions, Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model, Mesh generation for FEM based on centroidal Voronoi tessellations, A modified cloud particles differential evolution algorithm for real-parameter optimization, A computational approach inspired by simulated annealing to study the stability of protein interaction networks in cancer and neurological disorders, Ising formulations of some graph-theoretic problems in psychological research: models and methods, Quantile and mean value measures of search process complexity, Towards a robuster interpretive parsing. Learning from overt forms in optimality theory, Operational aircraft maintenance routing problem with remaining time consideration, Monte Carlo hyper-heuristics for examination timetabling, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Improving the mechanical performances of a multilayered plate with the orientations of its layers of fibers, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, The stochastic Weibull diffusion process: computational aspects and simulation, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Efficient optimisation procedure for design problems in fluid mechanics, Hybrid heuristics for examination timetabling problem, Solution quality of random search methods for discrete stochastic optimization, Heuristic algorithms for the cardinality constrained efficient frontier, A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs, Optimizing an inventory model with fuzzy demand, backordering, and discount using a hybrid imperialist competitive algorithm, Selective inference for latent block models, Two simulated annealing-based heuristics for the job shop scheduling problem, Some new results on simulated annealing applied to the job shop scheduling problem, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, A time-dependent hierarchical Chinese postman problem, On efficient use of simulated annealing in complex structural optimization problems, Quantum stochastic optimization, Convergence of the simulated annealing algorithm for continuous global optimization, Nature's way of optimizing, The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, Suppression of high order disturbances and tracking for nonchaotic systems: a time-delayed state feedback approach, Rank aggregation using latent-scale distance-based models, Heuristics for cardinality constrained portfolio optimization, Simulated annealing with threshold accepting or Tsallis statistics, Unconventional algorithms and hidden chaotic attractors, Principle of equivalent microstructure in micromechanics and its connection with the replacement relations. Thermal conductivity problem, Application of heuristic methods for conformance test selection, Threshold accepting heuristic for fair flow optimization in wireless mesh networks, Fuzzy rule base learning through simulated annealing, A variational inference for the Lévy adaptive regression with multiple kernels, Near-optimal solutions of convex semi-infinite programs via targeted sampling, \(P\)-vortices and drama of Gribov copies, Local search algorithms for the multiprocessor flow shop scheduling problem, Modeling distributed concept representation in Hopfield neural networks., Threshold accepting as limit case for a modified Tsallis statistics, Optimal annealing schedules for a modified Tsallis statistics, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, Bin-packing by simulated annealing
