Work place: Department of Information Technology, WCE, Sangli, Maharashtra, India
Research Interests: Computer systems and computational processes, Evolutionary Computation, Parallel Computing, Data Structures and Algorithms
A. J. Umbarkar is presently working as an Assistant Professor in Information Technology department at Walchand College of Engineering, at Sangli, MS, India. He has 13 years of teaching experience. His research interests include Function Optimization, Parallel Evolutionary Algorithms and Parallel programming. He has published 20 research papers in Conferences and Journals.
DOI: https://doi.org/10.5815/ijieeb.2018.05.06, Pub. Date: 8 Sep. 2018
Evolutionary Algorithms (EAs) are found to be effective for solving a large variety of optimization problems. In this Paper Dual Population Genetic Algorithm (DPGA) is used for solving the test functions of Congress on Evolutionary Computation 2013 (CEC’2013), by using two different crossovers. Dual Population Genetic Algorithm is found to be better in performance than traditional Genetic Algorithm. It is also able to solve the problem of premature convergence and diversity of the population in genetic algorithm. This paper proposes Dual Population Genetic Algorithm for solving the problem regarding unconstrained optimization. Dual Population Genetic Algorithm is used as meta-heuristic which is verified against 28 functions from Problem Definitions and Evaluation Criteria for the Congress on Evolutionary Computation 2013 on unconstrained set of benchmark functions using two different crossovers. The results of both the crossovers are compared with each other. The results of both the crossovers are also compared with the existing results of Standard Particle Swarm Optimization algorithm. The Experimental results showed that the algorithm found to be better for finding the solution of multimodal functions of the problem set.[...] Read more.
DOI: https://doi.org/10.5815/ijcnis.2016.03.05, Pub. Date: 8 Mar. 2016
In recent years, the area of formal verification of cryptographic protocols became important because of the active intruders. These intruders can find out the flaws in the protocols and can use them to create attacks. To avoid such possible attacks, the protocols must be verified to check if the protocols contain any flaws. The formal verification tools have helped in verifying and correcting the protocols. Various tools are available these days for verifying the protocols. In this paper, the two verification tools namely ProVerif and AVISPA are used for analysis of protocols - AKI (Accountable Key Infrastructure), ARPKI (Attack Resilient Public Key Infrastructure) and OPT (Origin and Path Trace). A comparative evaluation of the selected tools is presented and revealed security properties of the protocols selected.[...] Read more.
DOI: https://doi.org/10.5815/ijisa.2015.07.08, Pub. Date: 8 Jun. 2015
The problem with metaheuristics, including Teaching-Learning-Based Optimization (TLBO) is that, it increases in the number of dimensions (D) leads to increase in the search space which increases the amount of time required to find an optimal solution (delay in convergence). Nowadays, multi-core systems are getting cheaper and more common. To solve the above large dimensionality problem, implementation of TLBO on a multi-core system using OpenMP API’s with C/C++ is proposed in this paper. The functionality of a multi-core system is exploited using OpenMP which maximizes the CPU (Central Processing Unit) utilization, which was not considered till now. The experimental results are compared with a sequential implementation of Simple TLBO (STLBO) with Parallel implementation of STLBO i.e. OpenMP TLBO, on the basis of total run time for standard benchmark problems by studying the effect of parameters, viz. population size, number of cores, dimension size, and problems of differing complexities. Linear speedup is observed by proposed OpenMP TLBO implementation over STLBO.[...] Read more.
DOI: https://doi.org/10.5815/ijisa.2015.04.08, Pub. Date: 8 Mar. 2015
Hybrid algorithm based on Particle Swarm Optimization (PSO) and Simulated annealing (SA) is proposed, to solve Flexible Job Shop Scheduling with five objectives to be minimized simultaneously: makespan, maximal machine workload, total workload, machine idle time & total tardiness. Rescheduling strategy used to shuffle workload once the machine breakdown takes place in proposed algorithm. The hybrid algorithm combines the high global search efficiency of PSO with the powerful ability to avoid being trapped in local minimum of SA. A hybrid multi-objective PSO (MPSO) and SA algorithm is proposed to identify an approximation of the pareto front for Flexible job shop scheduling (FJSSP). Pareto front and crowding distance is used for identify the fitness of particle. MPSO is significant to global search and SA used to local search. The proposed MPSO algorithm is experimentally applied on two benchmark data set. The result shows that the proposed algorithm is better in term quality of non-dominated solution compared to the other algorithms in the literature.[...] Read more.
DOI: https://doi.org/10.5815/ijisa.2015.02.05, Pub. Date: 8 Jan. 2015
Dual Population Genetic Algorithm is an effective optimization algorithm that provides additional diversity to the main population. It addresses the premature convergence problem as well as the diversity problem associated with Genetic Algorithm. Thus it restricts their individuals to be trapped in the local optima. This paper proposes Dual Population Genetic Algorithm for solving Constrained Optimization Problems. A novel method based on maximum constrains satisfaction is applied as constrains handling technique and Dual Population Genetic Algorithm is used as meta-heuristic. This method is verified against 9 problems from Problem Definitions and Evaluation Criteria for the Congress on Evolutionary Computation 2006 Special Session on Constrained Real-Parameter Optimization problem set. The results are compared with existing algorithms such as Ant Bee Colony Algorithm, Differential Evolution Algorithm and Genetic Algorithm that have been used for solving same problem set. Analysis shows that this technique gives results close to optimum value but fails to obtain exact optimum solution. In future Dual Population Genetic Algorithm can produce more efficient solutions using alternative constrains handling technique.[...] Read more.
DOI: https://doi.org/10.5815/ijieeb.2015.01.08, Pub. Date: 8 Jan. 2015
Dual Population Genetic Algorithm is an effective optimization algorithm that provides additional diversity to the main population. It deals with the premature convergence problem as well as the diversity problem associated with Genetic Algorithm. But dual population introduces additional search space that increases time required to find an optimal solution. This large scale search space problem can be easily solved using all available cores of current age multi-core processors. Experiments are conducted on the problem set of CEC 2006 constrained optimization problems. Results of Sequential DPGA and OpenMP DPGA are compared on the basis of accuracy and run time. OpenMP DPGA gives speed up in execution.[...] Read more.
DOI: https://doi.org/10.5815/ijisa.2014.10.05, Pub. Date: 8 Sep. 2014
The 0/1 Knapsack Problem is an optimization problem solved using various soft computing methods. The solution to the 0/1 Knapsack Problem (KP) can be viewed as the result of a sequence of decisions. Simple Genetic Algorithm (SGA) effectively solves knapsack problem for large data set. But it has problems like premature convergence and population diversity. Dual Population Genetic Algorithm (DPGA) is an improved version of Genetic Algorithm (GA) with the solution to above problems. This paper proposes Dual Population GA for solving 0/1 knapsack Problem. Experimental results of knapsack on SGA and DPGA are compared on standard as well as random data sets. The experimental result shows DPGA performs better than knapsack on SGA.[...] Read more.
Subscribe to receive issue release notifications and newsletters from MECS Press journals