Search

As a well-known NP-hard problem, the dynamic job shop scheduling problem has significant practical value, so this paper proposes an Improved Heuristic Kalman Algorithm to solve this problem. In Improved Heuristic Kalman Algorithm, the cellular neighbor network is introduced, together with the boundary handling function, and the best position of each individual is recorded for constructing the cellular neighbor network. The encoding method is introduced based on the relative position index so that the Improved Heuristic Kalman Algorithm can be applied to solve the dynamic job shop scheduling problem. Solving the benchmark example of dynamic job shop scheduling problem and comparing it with the original Heuristic Kalman Algorithm and Genetic Algorithm-Mixed, the results show that Improved Heuristic Kalman Algorithm is effective for solving the dynamic job shop scheduling problem. The convergence rate of the Improved Heuristic Kalman Algorithm is reduced significantly, which is beneficial to avoid the algorithm from falling into the local optimum. For all 15 benchmark instances, Improved Heuristic Kalman Algorithm and Heuristic Kalman Algorithm have obtained the best solution obtained by Genetic Algorithm-Mixed. Moreover, for 9 out of 15 benchmark instances, they achieved significantly better solutions than Genetic Algorithm-Mixed. They have better robustness and reasonable running time (less than 30 s even for large size problems), which means that they are very suitable for solving the dynamic job shop scheduling problem. According to the dynamic job shop scheduling problem applicability, the integration-communication protocol was presented, which enables the transfer and use of the Improved Heuristic Kalman Algorithm optimization results in the conventional Simio simulation environment. The results of the integration-communication protocol proved the numerical and graphical matching of the optimization results and, thus, the correctness of the data transfer, ensuring high-level usability of the decision-making method in a real-world environment. [ABSTRACT FROM AUTHOR]

This manuscript presents the numerical optimization (through a mathematical model and an evolutionary algorithm) of the voltage-doubler boost converter, also called the series-capacitor boost converter. The circuit is driven by two transistors, each of them activated according to a switching signal. In the former operation, switching signals have an algebraic dependence from each other. This article proposes a new method to operate the converter. The proposed process reduces the input current ripple without changing any converter model parameter, only the driving signals. In the proposed operation, switching signals of transistors are independent of each other, providing an extra degree of freedom, but on the other hand, this produces an infinite number of possible combinations of duty cycles (the main parameter of switching signals) to achieve the desired voltage gain. In other words, this leads to a problem with infinite possible solutions. The proposed method utilizes an evolutionary algorithm to determine the switching functions and, at the same time, to minimize the input current ripple of the converter. A comparison made between the former and the proposed operation shows that the proposed process achieves a lower input current ripple while achieving the desired voltage gain. [ABSTRACT FROM AUTHOR]