This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal algorithm. The structure of the algorithm is planned with the goal that the program does not require a substantial database to store the data, which accelerates the usage of the program execution to acquire the solution. The algorithm has demonstrated its accomplishment in resolving the issue and finds a most limited route.
There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show MoreThe problem of Multicollinearity is one of the most common problems, which deal to a large extent with the internal correlation between explanatory variables. This problem is especially Appear in economics and applied research, The problem of Multicollinearity has a negative effect on the regression model, such as oversized variance degree and estimation of parameters that are unstable when we use the Least Square Method ( OLS), Therefore, other methods were used to estimate the parameters of the negative binomial model, including the estimated Ridge Regression Method and the Liu type estimator, The negative binomial regression model is a nonline
... Show MoreEDIRKTO, an Implicit Type Runge-Kutta Method of Diagonally Embedded pairs, is a novel approach presented in the paper that may be used to solve 4th-order ordinary differential equations of the form . There are two pairs of EDIRKTO, with three stages each: EDIRKTO4(3) and EDIRKTO5(4). The derivation techniques of the method indicate that the higher-order pair is more accurate, while the lower-order pair provides superior error estimates. Next, using these pairs as a basis, we developed variable step codes and applied them to a series of -order ODE problems. The numerical outcomes demonstrated how much more effective their approach is in reducing the quantity of function evaluations needed to resolve fourth-order ODE issues.
Linear Feedback Shift Register (LFSR) systems are used widely in stream cipher systems field. Any system of LFSR's which wauldn't be attacked must first construct the system of linear equations of the LFSR unit. In this paper methods are developed to construct a system of linear/nonlinear equations of key generator (a LFSR's system) where the effect of combining (Boolean) function of LFSR is obvious. Before solving the system of linear/nonlinear equations by using one of the known classical methods, we have to test the uniqueness of the solution. Finding the solution to these systems mean finding the initial values of the LFSR's of the generator. Two known generators are used to test and apply the ideas of the paper,
... Show MoreThe inverse kinematic equation for a robot is very important to the control robot’s motion and position. The solving of this equation is complex for the rigid robot due to the dependency of this equation on the joint configuration and structure of robot link. In light robot arms, where the flexibility exists, the solving of this problem is more complicated than the rigid link robot because the deformation variables (elongation and bending) are present in the forward kinematic equation. The finding of an inverse kinematic equation needs to obtain the relation between the joint angles and both of the end-effector position and deformations variables. In this work, a neural network has been proposed to solve the problem of inverse kinemati
... Show MoreIn this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi
... Show More
An automatic text summarization system mimics how humans summarize by picking the most significant sentences in a source text. However, the complexities of the Arabic language have become challenging to obtain information quickly and effectively. The main disadvantage of the traditional approaches is that they are strictly constrained (especially for the Arabic language) by the accuracy of sentence feature functions, weighting schemes, and similarity calculations. On the other hand, the meta-heuristic search approaches have a feature tha
... Show More