A novel metaheuristics approach for continuous global optimization
From MaRDI portal
Publication:1850836
DOI10.1023/A:1015564423757zbMath1175.90320OpenAlexW1589493806MaRDI QIDQ1850836
Theodore B. Trafalis, Suat Kasap
Publication date: 15 December 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1015564423757
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
On initial populations of a genetic algorithm for continuous optimization problems ⋮ Parallelizing simulated annealing algorithms based on high-performance computer ⋮ Global optimization by continuous grasp ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ Global optimizations and tabu search based on memory ⋮ Quasi-random initial population for genetic algorithms ⋮ A tabu search algorithm for the routing and capacity assignment problem in computer networks ⋮ An evolutionary method for complex-process optimization ⋮ A novel global optimization technique for high dimensional functions ⋮ Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing
Uses Software
This page was built for publication: A novel metaheuristics approach for continuous global optimization
