The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

This paper aims at the fact that most organizations today suffer from a waste of time, effort, and cost, and they have difficulty in achieving the best performance situations and compete strongly. The researcher distributed 108 questionnaires as a statistical analyzable sample society where the sample intentionally consists of general managers, department head, and division head. The questionnaire was formulated according to the Likert scale. The use of personal interviews and observations are additional tools for data collection and a number of statistical methods is used for data analysis such as simple regression and correlation coefficient (Pearson). One of the most prominent conclusions is that the company has adequate and c

Evolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce

Electronic remote identification (ER-ID) is a new radio frequency (RF) technology that is initiated by the Federal Aviation Authorities (FAA). For security reasons, traffic control, and so on, ER-ID has been applied for drones by the FAA to enable them to transmit their unique identification and location so that unauthorized drones can be identified. The current limitation of the existing ER-ID algorithms is that the application is limited to the Wi-Fi and Bluetooth wireless controllers, which results in a maximum range of 10–20 m for Bluetooth and 50–100 m for Wi-Fi. In this study, a mathematical computing technique based on finite state automaton (FSA) is introduced to expand the range of the ER-ID RF system and reduce the ene