Search Results - subject:"Algorithms"

LOGISTIC OPTIMIZATION OF THE COMPLEX MANUFACTURING SYSTEM WITH PARALLEL PRODUCTION LINES

BUCKI, Robert; SUCHÁNEK, Petr; CHRAMCOV, Bronislav - In: Journal of Applied Economic Sciences Quarterly VIII (2013) 3, pp. 271-285

used to manufacture the dedicated product. The system is controlled by means of heuristic algorithms to meet the … system and suggests the ways of optimizing it to meet the given criteria with the use of heuristic algorithms. …

Persistent link: https://www.econbiz.de/10010747416

Deterministic and stochastic global optimization techniques for planar covering with ellipses problems

Andretta, M.; Birgin, E.G. - In: European Journal of Operational Research 224 (2013) 1, pp. 23-40

Problems of planar covering with ellipses are tackled in this work. Ellipses can have a fixed angle or each of them can be freely rotated. Deterministic global optimization methods are developed for both cases, while a stochastic version of the method is also proposed for large instances of the...

Persistent link: https://www.econbiz.de/10010580819

On estimating workload in interval branch-and-bound global optimization algorithms

Berenguel, José; Casado, L.; García, I.; Hendrix, Eligius - In: Journal of Global Optimization 56 (2013) 3, pp. 821-844

. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload … resources. We focus on their use for interval B&B GO algorithms. Copyright The Author(s) 2013 …

Persistent link: https://www.econbiz.de/10010994040

Optimization methodology assessment for the inlet velocity profile of a hydraulic turbine draft tube: part I—computer optimization techniques

Galván, Sergio; Rubio, Carlos; Pacheco, Jesús; … - In: Journal of Global Optimization 55 (2013) 1, pp. 53-72

In recent years, numerical and experimental investigations on the draft tube performance have confirmed the importance of the inlet swirling flow created by the runner vanes. The results indicate that it is still a challenge to get the optimal flow distribution at the draft tube inlet which...

Persistent link: https://www.econbiz.de/10010994059

Approximations for two variants of the Steiner tree problem in the Euclidean plane <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\mathbb{R}^2}$$</EquationSource> </InlineEquation>

Li, Jianping; Wang, Haiyan; Huang, Binchao; Lichen, Junran - In: Journal of Global Optimization 57 (2013) 3, pp. 783-801

problem, and then present two approximation algorithms with performance ratios 4 and 3.236 for the MCSPPSM problem …

Persistent link: https://www.econbiz.de/10010994113

Improving differential evolution through a unified approach

Padhye, Nikhil; Bhardawaj, Piyush; Deb, Kalyanmoy - In: Journal of Global Optimization 55 (2013) 4, pp. 771-799

, both at the level of theory as well as application, in order to design efficient evolutionary algorithms for solving wide … describe traditional forms of Evolutionary Optimization Systems such as Genetic Algorithms, Evolutionary Strategies …

Persistent link: https://www.econbiz.de/10010994117

Approximation algorithm for a class of global optimization problems

Locatelli, Marco - In: Journal of Global Optimization 55 (2013) 1, pp. 13-25

In this paper we develop and derive the computational cost of an <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\varepsilon}$$</EquationSource> </InlineEquation> -approximation algorithm for a class of global optimization problems, where a suitably defined composition of some ratio functions is minimized over a convex set. The result extends a previous one about a class...</equationsource></inlineequation>

Persistent link: https://www.econbiz.de/10010994132

Derivative-free optimization: a review of algorithms and comparison of software implementations

Rios, Luis; Sahinidis, Nikolaos - In: Journal of Global Optimization 56 (2013) 3, pp. 1247-1293

This paper addresses the solution of bound-constrained optimization problems using algorithms that require only the … availability of objective function values but no derivative information. We refer to these algorithms as derivative-free algorithms … algorithms has long been studied, and it has found renewed interest in recent time. Along with many derivative-free algorithms …

Persistent link: https://www.econbiz.de/10010994140

From approximate balls to approximate ellipses

Mukhopadhyay, Asish; Greene, Eugene; Sarker, Animesh; … - In: Journal of Global Optimization 56 (2013) 1, pp. 27-42

A ball spans a set of n points when none of the points lie outside it. In Zarrabi-Zadeh and Chan (Proceedings of the 18th Canadian conference on computational geometry (CCCG’06), pp 139–142, <CitationRef CitationID="CR13">2006</CitationRef>) proposed an algorithm to compute an approximate spanning ball in the streaming model of...</citationref>

Persistent link: https://www.econbiz.de/10010994157

MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems

Juan, Angel; Faulin, Javier; Ferrer, Albert; Lourenço, … - In: TOP: An Official Journal of the Spanish Society of … 21 (2013) 1, pp. 109-132

This paper discusses the use of probabilistic or randomized algorithms for solving vehicle routing problems with non …

Persistent link: https://www.econbiz.de/10010995375