A. J. Umbarkar
A. J. Umbarkar has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Madhuri Satish Joshi
MGM's Jawaharlal Nehru Engineering College, India
5 shared publications - Pranali D. Sheth
Department of Information Technology Walchand College of Engineering 416-416 Sangli India
5 shared publications S. V. Kamble
Department of Computer Science & Engineering Rajarambapu Institute of Technology Sakharale MS India
2 shared publications- Sandip Mane
Rajarambapu Institute of Technology
2 shared publications - A.S. Sathe
Department of Information Technology Walchand College of Engineering Sangli MS India
1 shared publication - Amol C. Adamuthe
Department of Information Technology, Kasegaon Education Society’s Rajarambapu Institute of Technology, affiliated to Shivaji University, Sakharale, India
1 shared publication
Latest Publications
- 4 February 2020
- Published by Springer Nature
- p. 521-528
Improved Ant Colony Optimization in K-Means for Data Clustering
- 4 February 2020
- Published by Springer Nature
- p. 521-528
Improved Ant Colony Optimization in K-Means for Data Clustering
- 14 December 2018
- Published by Springer Nature
- p. 949-959
Performance Evaluation of Runner–Root Algorithm on CEC 2013 Benchmark Functions
- 14 December 2018
- Published by Springer Nature
- p. 949-959
Performance Evaluation of Runner–Root Algorithm on CEC 2013 Benchmark Functions
- Open Access
- 8 September 2018
- Published by MECS Publisher in International Journal of Information Engineering and Electronic Business
- Vol. 10 (5) , 40-45
Comparative Study of CEC’2013 Problem Using Dual Population Genetic Algorithm
- 8 September 2018
- Published by MECS Publisher in International Journal of Information Engineering and Electronic Business
- Vol. 10 (5) , 40-45
Open AccessComparative Study of CEC’2013 Problem Using Dual Population Genetic Algorithm
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1836, 020032
Performance evaluation of firefly algorithm with variation in sorting for non-linear benchmark problems
The field of nature inspired computing and optimization techniques have evolved to solve difficult optimization problems in diverse fields of engineering, science and technology. The firefly attraction process is mimicked in the algorithm for solving optimization problems. In Firefly Algorithm (FA) sorting of fireflies is done by using sorting algorithm. The original FA is proposed with bubble sort for ranking the fireflies. In this paper, the quick sort replaces bubble sort to decrease the time complexity of FA. The dataset used is unconstrained benchmark functions from CEC 2005 [22]. The comparison of FA using bubble sort and FA using quick sort is performed with respect to best, worst, mean, standard deviation, number of comparisons and execution time. The experimental result shows that FA using quick sort requires less number of comparisons but requires more execution time. The increased number of fireflies helps to converge into optimal solution whereas by varying dimension for algorithm performed better at a lower dimension than higher dimension.
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1836, 020032
Performance evaluation of firefly algorithm with variation in sorting for non-linear benchmark problems
The field of nature inspired computing and optimization techniques have evolved to solve difficult optimization problems in diverse fields of engineering, science and technology. The firefly attraction process is mimicked in the algorithm for solving optimization problems. In Firefly Algorithm (FA) sorting of fireflies is done by using sorting algorithm. The original FA is proposed with bubble sort for ranking the fireflies. In this paper, the quick sort replaces bubble sort to decrease the time complexity of FA. The dataset used is unconstrained benchmark functions from CEC 2005 [22]. The comparison of FA using bubble sort and FA using quick sort is performed with respect to best, worst, mean, standard deviation, number of comparisons and execution time. The experimental result shows that FA using quick sort requires less number of comparisons but requires more execution time. The increased number of fireflies helps to converge into optimal solution whereas by varying dimension for algorithm performed better at a lower dimension than higher dimension.
- 21 April 2016
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 203-214
OpenMP Genetic Algorithm for Continuous Nonlinear Large-Scale Optimization Problems
- 21 April 2016
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 203-214
OpenMP Genetic Algorithm for Continuous Nonlinear Large-Scale Optimization Problems
- Open Access
- 8 March 2016
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 8 (3) , 34-40
Analysis of Cryptographic Protocols AKI, ARPKI and OPT using ProVerif and AVISPA
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.
- 8 March 2016
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 8 (3) , 34-40
Open AccessAnalysis of Cryptographic Protocols AKI, ARPKI and OPT using ProVerif and AVISPA
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.
- Open Access
- 8 June 2015
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 7 (7) , 57-65
OpenMP Teaching-Learning Based Optimization Algorithm over Multi-Core System
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 multicore 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.
- 8 June 2015
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 7 (7) , 57-65
Open AccessOpenMP Teaching-Learning Based Optimization Algorithm over Multi-Core System
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 multicore 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.
- Open Access
- 8 March 2015
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 7 (4) , 54-61
Hybrid Multi-Objective Particle Swarm Optimization for Flexible Job Shop Scheduling Problem
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.
- 8 March 2015
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 7 (4) , 54-61
Open AccessHybrid Multi-Objective Particle Swarm Optimization for Flexible Job Shop Scheduling Problem
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.
- Open Access
- 8 March 2015
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 7 (4) , 1-10
A Comparison of Crowding Differential Evolution Algorithms for Multimodal Optimization Problems
Multimodal problems are related to locating multiple, redundant global optima, as opposed to single solution. In practice, generally in engineering problems it is desired to obtain many redundant solutions instead of single global optima since the available resources cannot be enough or not possible to implement the solution in real-life. Hence, as a toolbox for finding multimodal solutions, modified single objective algorithms can able to use. As one of the fundamental modification, from one of the niching schemes, crowding method was applied to Differential Evolution (DE) algorithm to solve multimodal problems and frequently preferred to compared with developed methods. Therefore, in this study, eight different DE are considered/evaluated on ten benchmark problems to provide best possible DE algorithm for crowding operation. In conclusion, the results show that the time varying scale mutation DE algorithm outperforms against other DE algorithms on benchmark problems.
- 8 March 2015
- Published by MECS Publisher in International Journal of Intelligent Systems and Applications
- Vol. 7 (4) , 1-10
Open AccessA Comparison of Crowding Differential Evolution Algorithms for Multimodal Optimization Problems
Multimodal problems are related to locating multiple, redundant global optima, as opposed to single solution. In practice, generally in engineering problems it is desired to obtain many redundant solutions instead of single global optima since the available resources cannot be enough or not possible to implement the solution in real-life. Hence, as a toolbox for finding multimodal solutions, modified single objective algorithms can able to use. As one of the fundamental modification, from one of the niching schemes, crowding method was applied to Differential Evolution (DE) algorithm to solve multimodal problems and frequently preferred to compared with developed methods. Therefore, in this study, eight different DE are considered/evaluated on ten benchmark problems to provide best possible DE algorithm for crowding operation. In conclusion, the results show that the time varying scale mutation DE algorithm outperforms against other DE algorithms on benchmark problems.
- Open Access
- 8 January 2015
- Published by MECS Publisher in International Journal of Information Engineering and Electronic Business
- Vol. 7 (1) , 59-65
OpenMP Dual Population Genetic Algorithm for Solving Constrained Optimization Problems
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.
- 8 January 2015
- Published by MECS Publisher in International Journal of Information Engineering and Electronic Business
- Vol. 7 (1) , 59-65
Open AccessOpenMP Dual Population Genetic Algorithm for Solving Constrained Optimization Problems
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.