Erratum to: Armentum: a hybrid direct search optimization methodology
Authors
Abstract:
In the original publication of this article unfortunately the co-authors were omitted. The two co-authors are displayed now.
similar resources
Armentum: a hybrid direct search optimization methodology
Design of experiments (DOE) offers a great deal of benefits to any manufacturing organization, such as characterization of variables and sets the path for the optimization of the levels of these variables (settings) trough the Response surface methodology, leading to process capability improvement, efficiency increase, cost reduction. Unfortunately, the use of these methodologies is very limite...
full textErratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
In [SIAM J. Optim., 17 (2006), pp. 188-217] Audet and Dennis proposed the class of mesh adaptive direct search algorithms (MADS) for minimization of a nonsmooth function under general nonsmooth constraints. The notation used in the paper evolved since the preliminary versions and, unfortunately, even though the statement of Proposition 4.2 is correct, is not compatible with the final notation. ...
full textHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
full textHYBRID PARTICLE SWARM OPTIMIZATION, GRID SEARCH METHOD AND UNIVARIATE METHOD TO OPTIMALLY DESIGN STEEL FRAME STRUCTURES
This paper combines particle swarm optimization, grid search method and univariate method as a general optimization approach for any type of problems emphasizing on optimum design of steel frame structures. The new algorithm is denoted as the GSU-PSO. This method attempts to decrease the search space and only searches the space near the optimum point. To achieve this aim, the whole search space...
full textA Direct Search Algorithm for Global Optimization
A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is d...
full textA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
full textMy Resources
Journal title
volume 12 issue 4
pages -
publication date 2016-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023