Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

DOI10.1016/0021-9991(90)90201-BzbMath0707.65039WikidataQ56657000 ScholiaQ56657000MaRDI QIDQ919753

Publication date: 1990

Published in: Journal of Computational Physics (Search for Journal in Brave)

stochastic optimization; combinatorial optimization; Simulated annealing; traveling salesman problems; generation of error-correction codes; threshold accepting method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C15: Stochastic programming

90C27: Combinatorial optimization

Related Items

A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, OPTIMIZATION OF COMPLEX SYSTEM RELIABILITY BY A MODIFIED GREAT DELUGE ALGORITHM, Egonet: A Genetic Algorithm Model For The Optimisation Of Telephone Networks, Probabilistic and deterministic local search for solving the binary multiknapsack problem, A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS, Optimization of manufacturing processes by distributed simulation, A threshold accepting approach to the Open Vehicle Routing problem, Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties, Fuzzy rule base generation for classification and its minimization via modified threshold accepting, Optimal multi-criteria designs for Fourier regression models, The noising methods: A generalization of some metaheuristics, A tabu search method for the truck and trailer routing problem, Local search heuristics for two-stage flow shop problems with secondary criterion, Identification of multivariate AR-models by threshold accepting, On scheduling around large restrictive common due windows, Single-point stochastic search algorithms for the multi-level lot-sizing problem, Global and local search algorithms for concave cost transshipment problems, Performance analysis of cyclical simulated annealing algorithms, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Metaheuristics in combinatorial optimization, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, The cross-entropy method for continuous multi-extremal optimization, Scheduling periodic customer visits for a traveling salesperson, A genetic algorithm approach to find the best regression/econometric model among the candidates, Computational approaches to a combinatorial optimization problem arising from text classification, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, A hybrid scatter search for the probabilistic traveling salesman problem, Comparing different metaheuristic approaches for the median path problem with bounded length, A zero-inventory production and distribution problem with a fixed customer sequence, A global optimization heuristic for estimating agent based models, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Applications of optimization heuristics to estimation and modelling problems, Optimal aggregation of linear time series models, On the convergence of ``threshold accepting, Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem, Genetic local search in combinatorial optimization, Scaling features in complex optimization problems, The general lotsizing and scheduling problem, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, A local search template., A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem., Dispatching of small containers via coastal freight liners: The case of the Aegean sea., The multidimensional 0-1 knapsack problem: an overview., Fuzzy rule based classification with FeatureSelector and modified threshold accepting, On the convergence of generalized hill climbing algorithms, Simultaneous lotsizing and scheduling on parallel machines, Optimal annealing schedules for a modified Tsallis statistics, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Use of the BATA algorithm and MIS to solve the mail carrier problem, A TABU search heuristic for the team orienteering problem, ARC: A computerized system for urban garbage collection, Manpower allocation using genetic annealing, Probabilistic local search algorithms for concave cost transportation network problems, Adaptive schedules for ensemble-based threshold accepting, The concave cost supply problem., Simulated annealing with threshold accepting or Tsallis statistics, A class of convergent generalized hill climbing algorithms, Threshold accepting as limit case for a modified Tsallis statistics, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, A multi-start local search algorithm for the vehicle routing problem with time windows, A unifying approach to heuristic search, Pure adaptive search for finite global optimization, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, A modification of threshold accepting and its application to the quadratic assignment problem, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Record breaking optimization results using the ruin and recreate principle, On the neighborhood structure of the traveling salesman problem generated by local search moves, Indirect search for the vehicle routing problem with pickup and delivery and time windows, Noising methods for a clique partitioning problem, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, A multi-attribute extension of the secretary problem: theory and experiments, Analyzing the performance of simultaneous generalized hill climbing algorithms, OPTIMIZATION OF PRODUCTION PLANNING PROBLEMS — A CASE STUDY FOR ASSEMBLY LINES, Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems, Production Control of a Flexible Manufacturing System in a Job Shop Environment

Cites Work