Finding suitable weights for these protocols is known as the weight setting problem (WSP). In this paper, we present a biased random-key genetic algorithm for WSP using both protocols. The algorithm uses dynamic flow and dynamic shortest path computations. We report computational experiments that ...
Genetic algorithms, on the other hand, are known for their robustness but can be computationally expensive due to the iterative nature of the algorithm. Our algorithm leverages the concavity of the logarithmic function and the convex optimization framework, which allows for efficient computation of ...
Random Weight Method for Covariance Matrix Recovery from Single Receiver Output 单通道接收机协方差矩阵的随机权恢复方法 ilib.cn 3. Solving University Timetable Problem Using Genetic Algorithm Based on Random-weight Approach 用基于随机权重方法的遗传算法求解大学课程表问题 www.ilib.cn 4. Multi-objective ...
With suitable conditions, these interpretations depict the symmetric connections between each neuron (synaptic weight) in DHNN. This method is later known as the Wan Abdullah method (WA method). The existing work further concluded that the proposed neuro-symbolic model is able to retrieve global ...
(which are not outliers) might be imposed with small weight in the WLS-SVM, weakening the training process, although the influence of outliers is reduced. When the parameters in those approaches are not properly chosen, RSVM will not be ...
This paper describes libbrkga, a GNU-style dynamic shared Python/C++ library of the biased random-key genetic algorithm (BRKGA) for bound constrained global optimization. BRKGA (J Heuristics 17:487–525,2011b) is a general search metaheuristic for finding optimal or near-optimal solutions to ...
A GENETIC ALGORITHM FOR THE WEIGHT SETTING PROBLEM IN OSPF… 热度: A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations(遗传算法求最短路径) 热度: A Hybrid Honey Bees Mating Optimization Algorithm for the Probabilistic Traveling Salesman Problem ...
Weight distribution considerations in container loading European Journal of Operational Research (1999) G. Wäscher et al. An improved typology of cutting and packing problems European Journal of Operational Research (2007) A. Bortfeldt et al. A hybrid genetic algorithm for the container loading pro...
Additionally, the authors proposed to use sampling space division, obstacles discretization, distance weight function, and the adaptive node sampling probability method of RRT algorithm in space. This approach provides reduction unnecessary sampling nodes and optimize the sampling efficiency, and also ...
1) random weight multi-objective genetic algorithm 随机权重多目标遗传算法 例句>> 2) multi-objective genetic algorithm 多目标遗传算法 1. Process parameters optimization for sheet metal forming during drawing with amulti-objective genetic algorithm; ...