Showing 1 - 10 of 53
Our paper considers a classic problem in the field of Truss Topology Design, the goal of which is to determine the stiffest truss, under a given load, with a bound on the total volume and discrete requirements in the cross-sectional areas of the bars. To solve this problem we propose a new...
Persistent link: https://www.econbiz.de/10010896575
Persistent link: https://www.econbiz.de/10010847455
We revisit the problem of computing optimal spline approximations for univariate least-squares splines from a combinatorial optimization perspective. In contrast to most approaches from the literature we aim at globally optimal coefficients as well as a globally optimal placement of a fixed...
Persistent link: https://www.econbiz.de/10015165842
In this paper, we combine two types of local search algorithms for global optimization of continuous functions. In the literature, most of the hybrid algorithms are produced by combination of a global optimization algorithm with a local search algorithm and the local search is used to improve...
Persistent link: https://www.econbiz.de/10011151821
Where to locate one or several facilities on a network so as to minimize the expected users-closest facility transportation cost is a problem well studied in the OR literature under the name of median problem. In the median problem users are usually identified with nodes of the network. In many...
Persistent link: https://www.econbiz.de/10010998259
In this paper, we develop an algorithm for minimizing the L <Subscript> q </Subscript> norm of a vector whose components are linear fractional functions, where q is an arbitrary positive integer. The problem is a kind of sum-of-ratios optimization problem, and often occurs in computer vision. In that case, it is...</subscript>
Persistent link: https://www.econbiz.de/10010998273
In this paper, we discuss the solution of linear and quadratic eigenvalue complementarity problems (EiCPs) using an enumerative algorithm of the type introduced by Júdice et al. (Optim. Methods Softw. 24:549–586, <CitationRef CitationID="CR1">2009</CitationRef>). Procedures for computing the interval that contains all the eigenvalues...</citationref>
Persistent link: https://www.econbiz.de/10010998335
Particle swarm optimization (PSO) is characterized by a fast convergence, which can lead the algorithms of this class to stagnate in local optima. In this paper, a variant of the standard PSO algorithm is presented, called PSO-2S, based on several initializations in different zones of the search...
Persistent link: https://www.econbiz.de/10010998356
Persistent link: https://www.econbiz.de/10004999519
Persistent link: https://www.econbiz.de/10008552373