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

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items

Use of the BATA algorithm and MIS to solve the mail carrier problem ⋮ Discrete particle swarm optimization for constructing uniform design on irregular regions ⋮ A novel threshold accepting meta-heuristic for the job-shop scheduling problem ⋮ Applying simulated annealing using different methods for the neighborhood search in forest planning problems ⋮ Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets ⋮ 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 fuzzy based threshold policy for a single server retrial queue with vacations ⋮ A revised variable neighborhood search for the discrete ordered median problem ⋮ The multi-compartment vehicle routing problem with flexible compartment sizes ⋮ A unifying approach to heuristic search ⋮ Scaling features in complex optimization problems ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Pure adaptive search for finite global optimization ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ The cross-entropy method for continuous multi-extremal 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 ⋮ 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 ⋮ A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing ⋮ The general lotsizing and scheduling problem ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ Robust portfolio optimization with a hybrid heuristic algorithm ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ Further improvements in the calculation of censored quantile regressions ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Resolvable orthogonal array-based uniform sliced Latin hypercube designs ⋮ Heuristic optimisation in financial modelling ⋮ Two phased hybrid local search for the periodic capacitated arc routing problem ⋮ The late acceptance hill-climbing heuristic ⋮ A local search template. ⋮ Integrated planning of loaded and empty container movements ⋮ Using Markov chains to analyze the effectiveness of local search algorithms ⋮ 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. ⋮ Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Sliced Latin hypercube designs with both branching and nested factors ⋮ Simultaneous lotsizing and scheduling by combining local search with dual reoptimization ⋮ On the convergence of ``threshold accepting ⋮ Record breaking optimization results using the ruin and recreate principle ⋮ A zero-inventory production and distribution problem with a fixed customer sequence ⋮ A survey on optimization metaheuristics ⋮ Identification of multivariate AR-models by threshold accepting ⋮ Review on nature-inspired algorithms ⋮ 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 ⋮ Returns-to-scale and the equity premium puzzle ⋮ Applications of optimization heuristics to estimation and modelling problems ⋮ Optimal aggregation of linear time series models ⋮ Data clustering and visualization via energy minimization ⋮ Mixed-level column augmented uniform designs ⋮ Design of reinforced concrete road vaults by heuristic optimization ⋮ The convergence of estimators based on heuristics: theory and application to a GARCH model ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations ⋮ A TABU search heuristic for the team orienteering problem ⋮ A framework for analyzing sub-optimal performance of local search algorithms ⋮ On scheduling around large restrictive common due windows ⋮ Single-point stochastic search algorithms for the multi-level lot-sizing problem ⋮ A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem ⋮ Nearly uniform design construction on flexible region ⋮ Distributed optimisation of a portfolio's omega ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem ⋮ Design of prestressed concrete precast pedestrian bridges by heuristic optimization ⋮ Detection of local tourism systems by threshold accepting ⋮ 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 ⋮ Constructive and destructive use of compilers in elliptic curve cryptography ⋮ The concave cost supply problem. ⋮ Improving the computation of censored quantile regressions ⋮ A survey of methods for constructing covering arrays ⋮ Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem ⋮ A hybrid evolution strategy for the open vehicle routing problem ⋮ Fuzzy rule based classification with FeatureSelector and modified threshold accepting ⋮ Efficiently solving the traveling thief problem using hill climbing and simulated annealing ⋮ 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 ⋮ On the convergence of generalized hill climbing algorithms ⋮ Genetic local search in combinatorial optimization ⋮ Simultaneous lotsizing and scheduling on parallel machines ⋮ Optimal annealing schedules for a modified Tsallis statistics ⋮ Global and local search algorithms for concave cost transshipment problems ⋮ Performance analysis of cyclical simulated annealing algorithms ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ Metaheuristics in combinatorial optimization ⋮ The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ Level-augmented uniform designs ⋮ Omega-CVaR portfolio optimization and its worst case analysis ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem ⋮ Egonet: A Genetic Algorithm Model For The Optimisation Of Telephone Networks ⋮ A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem ⋮ Analyzing the performance of simultaneous generalized hill climbing algorithms ⋮ Exact and heuristic approaches for the index tracking problem with UCITS constraints ⋮ A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS ⋮ A RNN-based hyper-heuristic for combinatorial problems ⋮ Improving simulated annealing through derandomization ⋮ SOFTWARE RELIABILITY PREDICTION USING INTELLIGENT TECHNIQUES: APPLICATION TO OPERATIONAL RISK PREDICTION IN FIRMS ⋮ Entropy, Randomization, Derandomization, and Discrepancy ⋮ A large neighbourhood search metaheuristic for the contagious disease testing problem ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Probabilistic and deterministic local search for solving the binary multiknapsack problem ⋮ A tabu search algorithm with controlled randomization for constructing feasible university course timetables ⋮ A new two-error-correcting binary code of length 16 ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem ⋮ A cutoff time strategy based on the coupon collector's problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ A real-world mine excavators timetabling methodology in open-pit mining ⋮ Construction of uniform projection designs via level permutation and expansion ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem ⋮ Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies ⋮ Two heuristics for the label printing problem ⋮ First passage times in portfolio optimization: a novel nonparametric approach ⋮ Metaheuristics: A Canadian Perspective ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems ⋮ Modeling and Active Learning for Experiments with Quantitative-Sequence Factors ⋮ A deterministic annealing local search for the electric autonomous dial-a-ride problem ⋮ Generating prediction bands for path forecasts from SETAR models ⋮ Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem ⋮ Optimized \(U\)-type designs on flexible regions ⋮ Optimization heuristics for determining internal rating grading scales ⋮ Optimization of manufacturing processes by distributed simulation ⋮ A threshold accepting approach to the Open Vehicle Routing problem ⋮ OPTIMIZATION OF PRODUCTION PLANNING PROBLEMS — A CASE STUDY FOR ASSEMBLY LINES ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ Visiting near-optimal solutions using local search algorithms ⋮ The convergence of optimization based GARCH estimators: theory and application ⋮ Negotiation mechanisms for the multi-agent multi-mode resource investment problem ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm ⋮ On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ Orthogonal-array composite design for the third-order models ⋮ METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM ⋮ The heuristic approach in finding initial values for minimum density power divergence estimators ⋮ OPTIMIZATION OF COMPLEX SYSTEM RELIABILITY BY A MODIFIED GREAT DELUGE ALGORITHM ⋮ Indirect search for the vehicle routing problem with pickup and delivery and time windows ⋮ Production Control of a Flexible Manufacturing System in a Job Shop Environment ⋮ 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 ⋮ Noising methods for a clique partitioning problem ⋮ Optimal multi-criteria designs for Fourier regression models ⋮ A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length ⋮ 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 ⋮ A multi-start threshold accepting algorithm for multiple objective continuous optimization problems ⋮ Flexible sliced Latin hypercube designs with slices of different sizes ⋮ Self-tuning of the noising methods ⋮ On solving the order processing in picking workstations ⋮ Ta algorithms for D-optimal OofA mixture designs ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container ⋮ Cardinality versusq-norm constraints for index tracking ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem ⋮ Numerical modelling of reservoir at pore scale: a comprehensive review ⋮ A multi-attribute extension of the secretary problem: theory and experiments ⋮ Evaluation of mixed-model U-line operational designs ⋮ The mobile production vehicle routing problem: using 3D printing in last mile distribution ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines ⋮ The nuclear medicine production and delivery problem

Cites Work