This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adjoint weak form (discrete adjoint) with the Gradient Projection method (GPM) , the Gradient method (GM), or the Frank Wolfe method (FWM) to the DCOCP. Within each of these three methods, the Armijo step option (ARSO) or the optimal step option (OPSO) is used to improve (to accelerate the step) the solution of the discrete classical control problem. Finally, some illustrative numerical examples for the considered discrete control problem are provided. The results show that the GPM with ARSO method is better than GM or FWM with ARSO methods. On the other hand, the results show that the GPM and GM with OPSO methods are better than the FWM with the OPSO method.
The continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vecto
Internet technology has revolutionized the landscape of communication technologies in the modern era. However, because the internet is open to the public, communication security cannot be guaranteed. As a result, data concealment approaches have been developed to ensure confidential information sharing. Various methods have emerged to achieve the goal of secure data communication via multimedia documents. This study proposes a method, which is both adaptable and imperceptible, for concealing a secret text in a color image. From an adaptivity perspective, image corners are detected using the Harris corner detection algorithm and utilized as anchor points for picking the optimal hiding regions of interest using Bezier curve interp
... Show MoreThis paper presents a research for magnetohydrodynamic (MHD) flow of an incompressible generalized Burgers’ fluid including by an accelerating plate and flowing under the action of pressure gradient. Where the no – slip assumption between the wall and the fluid is no longer valid. The fractional calculus approach is introduced to establish the constitutive relationship of the generalized Burgers’ fluid. By using the discrete Laplace transform of the sequential fractional derivatives, a closed form solutions for the velocity and shear stress are obtained in terms of Fox H- function for the following two problems: (i) flow due to a constant pressure gradient, and (ii) flow due to due to a sinusoidal pressure gradient. The solutions for
... Show MoreThis paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.
In this paper, we proposed a modified Hestenes-Stiefel (HS) conjugate
gradient method. This achieves a high order accuracy in approximating the second
order curvature information of the objective function by utilizing the modified
secant condition which is proposed by Babaie-Kafaki [1], also we derive a nonquadratic
conjugate gradient model. The important property of the suggestion
method that is satisfy the descent property and global convergence independent of
the accuracy of the line search. In addition, we prove the global convergence under
some suitable conditions, and we reported the numerical results under these
conditions.
In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.
In petroleum industry, the early knowledge of “pore pressure gradient” is the basis in well design and the extraction of these information is more direct when the pore pressure gradient is equal to normal gradient; however, this matter will be more complex if it deviate from that limit which is called “abnormal pore pressure”, if this variable does not put in consideration, then many drilling problems will occur might lead to entire hole loss. To estimate the pore pressure gradient there are several methods, in this study; Eaton method’s is selected to extract the underground pressure program using drilling data (normalized rate of penetration) and logs data (sonic and density log). The results shows that an abnormal high press
... Show MoreSolving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t
... Show More