Wyszukiwarka
Filtry
wszystkich: 8
Wyniki wyszukiwania dla: BISECTION ALGORITHM
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublikacjaThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
EM-Driven Multi-Objective Design of Impedance Transformers By Pareto Ranking Bisection Algorithm
PublikacjaIn the paper, the problem of fast multi-objective optimization of compact impedance matching transformers is addressed by utilizing a novel Pareto ranking bisection algorithm. It approximates the Pareto front by dividing line segments connecting the designs found in the previous iterations, and refining the obtained candidate solutions by means of poll-type search involving Pareto ranking. The final Pareto set is obtained using...
-
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
PublikacjaThis paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial...
-
Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces
PublikacjaA deterministic technique for fast surrogate-assisted multi-objective design optimization of antennas in highly-dimensional parameters spaces has been discussed. In this two-stage approach, the initial approximation of the Pareto set representing the best compromise between conflicting objectives is obtained using a bisection algorithm which finds new Pareto-optimal designs by dividing the line segments interconnecting previously...
-
Generalized Pareto ranking bisection for computationally feasible multi-objective antenna optimization
PublikacjaMulti-objective optimization (MO) allows for obtaining comprehensive information about possible design trade-offs of a given antenna structure. Yet, executing MO using the most popular class of techniques, population-based metaheuristics, may be computationally prohibitive when full-wave EM analysis is utilized for antenna evaluation. In this work, a low-cost and fully deterministic MO methodology is introduced. The proposed generalized...
-
A bisection‐based heuristic for rapid EM‐driven multiobjective design of compact impedance transformers
PublikacjaDesign of microwave structures is a multiobjective task where several conflicting requirements have to be considered at the same time. For contemporary circuits characterized by complex geometries, multiobjective optimization cannot be performed using standard population‐based algorithms due to high cost of electromagnetic (EM) evaluations. In this work, we propose a deterministic approach for fast EM‐driven multiobjective design...
-
Numerical solution of threshold problems in epidemics and population dynamics
PublikacjaA new algorithm is proposed for the numerical solution of threshold problems in epidemics and population dynamics. These problems are modeled by the delay-differential equations, where the delay function is unknown and has to be determined from the threshold conditions. The new algorithm is based on embedded pair of continuous Runge–Kutta method of order p = 4 and discrete Runge–Kutta method of order q = 3 which is used for the...
-
Optimization of the efficiency of braking energy recovery in rail transport by changing arrival time
PublikacjaThe article refers to the previous work of the authors, in which the model of traffic organization of cooperating trains including the optimization of the use of energy returned to the catenary was presented. In the presented article, the model was modified by changing the main control variable, which affects the efficient use of energy. Departure time was changed for the arrival time of the train to the stop or station. The optimization...