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.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
Software Defined Network (SDN) is a new technology that separate the control plane from the data plane. SDN provides a choice in automation and programmability faster than traditional network. It supports the Quality of Service (QoS) for video surveillance application. One of most significant issues in video surveillance is how to find the best path for routing the packets between the source (IP cameras) and destination (monitoring center). The video surveillance system requires fast transmission and reliable delivery and high QoS. To improve the QoS and to achieve the optimal path, the SDN architecture is used in this paper. In addition, different routing algorithms are used with different steps. First, we eva
... Show MoreIn this paper, we proposed to zoom Volterra equations system Altfazlah linear complementarity of the first type in this approximation were first forming functions notch Baschtdam matrix and then we discussed the approach and stability, to notch functions
This paper demonstrates a new technique based on a combined form of the new transform method with homotopy perturbation method to find the suitable accurate solution of autonomous Equations with initial condition. This technique is called the transform homotopy perturbation method (THPM). It can be used to solve the problems without resorting to the frequency domain.The implementation of the suggested method demonstrates the usefulness in finding exact solution for linear and nonlinear problems. The practical results show the efficiency and reliability of technique and easier implemented than HPM in finding exact solutions.Finally, all algorithms in this paper implemented in MATLAB version 7.12.
This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori
... Show MoreAnomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the
... Show MoreIn this paper, an adaptive active disturbance rejection control is newly designed for precise angular steering position tracking of the uncertain and nonlinear SBW system with time delay communications. The proposed adaptive active disturbance rejection control comprises the following two elements: (1) An adaptive extended state observer and (2) an adaptive state error feedback controller. The adaptive extended state observer with adaptive gains is employed for estimating the unmeasured velocity, acceleration, and compound disturbance which consists of system parameter uncertainties, nonlinearities, exterior disturbances, and time delay in which the observer gains are dynamically adjusted based on the estimation error to enhance est
... Show More