-
481
Power system output feedback stabilizer design via geneticalgorithms
Published 1997“…A digital simulation of the power system is then used in conjunction with the genetic algorithm to determine the output feedback gains. In the second method, the problem of selecting the output feedback gains is converted to a simple optimization problem with an eigenvalue based objective function, which is solved by a genetic algorithm. …”
Get full text
Get full text
article -
482
On the parameterized parallel complexity and the vertex cover problem
Published 2016Get full text
Get full text
Get full text
Get full text
conferenceObject -
483
An innovative simulated annealing approach to the long-term hydroscheduling problem
Published 2001“…A significant reduction in the number of the objective function evaluations, and consequently less iterations are required to reach the optimal solution. The proposed algorithm has been applied successfully to solve a system with four series cascaded reservoirs. …”
Get full text
Get full text
article -
484
A linear programming approach for the weighted graph matchingproblem
Published 1993“…A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a simplex-based algorithm. …”
Get full text
Get full text
article -
485
Simulated evolution for timing and low power VLSI standard cell placement
Published 2020“…For this hard multiobjective combinatorial optimization problem, no known exact and efficient algorithms exist that guarantee finding a solution of specific or desirable quality. …”
Get full text
article -
486
FAST FUZZY FORCE-DIRECTED/SIMULATED EVOLUTION METAHEURISTIC FOR MULTIOBJECTIVE VLSI CELL PLACEMENT
Published 2006“…The cell placement problem is a proven NP hard combinatorial optimization problem. The complexity of this problem increases when multiple optimization objectives are considered simultaneously. …”
Get full text
article -
487
A combinatorial auction‐based approach for ridesharing in a student transportation system
Published 2023“…Three meta-heuristics, namely particle swarm optimization, dragonfly algorithm, and imperialist competitive algorithm, are implemented in the proposed framework, whose performances are assessed and compared. …”
-
488
Protein structure prediction in the 3D HP model
Published 2009“…In this paper, we present a Particle Swarm Optimization (PSO) based algorithm for predicting protein structures in the 3D HP model. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
489
"A Tabu Search Approach for the Design of Variable Structure Load Frequency Controller Incorporating Model Nonlinearities"
Published 2007“…The proposed method formulates the design of VSC as an optimization problem and utilizes Tabu Search Algorithm (TS) to find the optimal settings of the controller. …”
Get full text
article -
490
Data Generation for Path Testing
Published 2004“…These algorithms are based on an optimization formulation of the path testing problem which include both integer- and real-value test cases. …”
Get full text
Get full text
Get full text
article -
491
Evacuation of a highly congested urban city
Published 2017“…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …”
Get full text
Get full text
Get full text
conferenceObject -
492
-
493
A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
Published 2020“…A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a Simplex-based algorithm. …”
Get full text
article -
494
Final exams scheduling for univeristies. (c2001)
Published 2001Get full text
Get full text
masterThesis -
495
Robust Kalman filter and smoother for errors-in-variables model with observation outliers based on Least-Trimmed-Squares
Published 2020“…Since the LTS is combinatorial optimization problem the randomized algorithm has been proposed in order to achieve the optimal estimate. …”
Get full text
article -
496
Definition and selection of fuzzy sets in genetic‐fuzzy systems using the concept of fuzzimetric arcs
Published 2008“…An irregular shape may be required by some systems. Hence, a genetic algorithm was proposed as a methodology to optimize the performance of fuzzy systems by mutating different regular shapes. …”
Get full text
Get full text
Get full text
Get full text
article -
497
Fast force-directed/simulated evolution hybrid for multiobjective VLSI cell placement
Published 2004“…VLSI standard cell placement is a hard optimization problem, which is further complicated with new issues such as power dissipation and performance. …”
Get full text
Get full text
article -
498
Fixed set search applied to the multi-objective minimum weighted vertex cover problem
Published 2022“…In recent publications, its efficiency has been shown on different types of combinatorial optimization problems like routing, machine scheduling and covering. …”
-
499
Second-order conic programming for data envelopment analysis models
Published 2022“…Indeed, the aforesaid method is based on mathematical optimization. This paper constructs a second-order conic optimization problem unifying several DEA models. …”
Get full text
Get full text
-
500
Graph Contraction for Mapping Data on Parallel Computers
Published 1994“…We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. …”
Get full text
Get full text
Get full text
article
