default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnand Jayant Kulkarni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Anand J. Kulkarni, Patrick Siarry:
Editorial: Metaheuristics for sustainable supply chain management. Eng. Appl. Artif. Intell. 133: 108239 (2024)- [j32]Ruturaj Reddy, Utkarsh Gupta, Ishaan R. Kale
, Apoorva S. Shastri, Anand J. Kulkarni:
Modified Leader-Advocate-Believer Algorithm with Clustering-Based Search Space Reduction Method for Solving Engineering Design Problems. SN Comput. Sci. 5(4): 376 (2024) - [j31]Ali Husseinzadeh Kashan, Somayyeh Karimiyan, Anand J. Kulkarni:
The Golf Sport Inspired Search metaheuristic algorithm and the game theoretic analysis of its operators' effectiveness. Soft Comput. 28(2): 1073-1125 (2024) - [j30]Anand J. Kulkarni, Ishaan R. Kale, Apoorva S. Shastri, Aayush Khandekar:
Snail Homing and Mating Search algorithm: a novel bio-inspired metaheuristic algorithm. Soft Comput. 28(17-18): 10629-10668 (2024) - [j29]Deepak Kumar Jain, Shamimul Qamar, Saurabh Raj Sangwan, Weiping Ding, Anand J. Kulkarni:
Ontology-Based Natural Language Processing for Sentimental Knowledge Analysis Using Deep Learning Architectures. ACM Trans. Asian Low Resour. Lang. Inf. Process. 23(1): 17:1-17:17 (2024) - 2023
- [j28]Aniket Nargundkar, Anand J. Kulkarni:
Application of cohort intelligence algorithm for goal programming problems with improved constraint handling method. Int. J. Bio Inspired Comput. 21(2): 94-105 (2023) - [j27]Ruturaj Reddy, Anand J. Kulkarni, Ganesh Krishnasamy, Apoorva S. Shastri, Amir H. Gandomi:
LAB: a leader-advocate-believer-based optimization algorithm. Soft Comput. 27(11): 7209-7243 (2023) - [i7]Ruturaj Reddy, Utkarsh Gupta, Ishaan R. Kale, Apoorva S. Shastri, Anand J. Kulkarni:
Modified LAB Algorithm with Clustering-based Search Space Reduction Method for solving Engineering Design Problems. CoRR abs/2310.03055 (2023) - [i6]Anand J. Kulkarni, Ishaan R. Kale, Apoorva S. Shastri, Aayush Khandekar:
Snail Homing and Mating Search Algorithm: A Novel Bio-Inspired Metaheuristic Algorithm. CoRR abs/2310.04020 (2023) - [i5]Aniket Nargundkar, Madhav Rawal, Aryaman Patel, Anand J. Kulkarni, Apoorva S. Shastri:
Solution to Advanced Manufacturing Process Problems using Cohort Intelligence Algorithm with Improved Constraint Handling Approaches. CoRR abs/2310.10085 (2023) - 2022
- [j26]Mukundraj V. Patil, Satish Kumar, Anand J. Kulkarni:
Multi-stopping criterion multi-feature-based multi-objective cohort intelligence algorithm for thermoacoustic engine optimisation. Int. J. Model. Identif. Control. 40(4): 356-370 (2022) - [j25]Zericho R. Marak, Dilip Ambarkhane, Anand J. Kulkarni:
Application of artificial neural network model in predicting profitability of Indian banks. Int. J. Knowl. Based Intell. Eng. Syst. 26(3): 159-173 (2022) - [i4]Ruturaj Reddy, Anand J. Kulkarni, Ganesh Krishnasamy, Apoorva S. Shastri, Amir H. Gandomi:
LAB: A Leader-Advocate-Believer Based Optimization Algorithm. CoRR abs/2204.11049 (2022) - [i3]Ishaan R. Kale, Anand J. Kulkarni, Efrén Mezura-Montes:
A socio-physics based hybrid metaheuristic for solving complex non-convex constrained optimization problems. CoRR abs/2212.03711 (2022) - 2021
- [j24]Mandar Sapre, Anand J. Kulkarni, Lakshmanan Chettiar, Ishani Deshpande, Bharat Piprikar:
Mesh smoothing of complex geometry using variations of cohort intelligence algorithm. Evol. Intell. 14(2): 227-242 (2021) - 2020
- [b3]Dipti Kapoor Sarmah, Anand J. Kulkarni, Ajith Abraham:
Optimization Models in Steganography Using Metaheuristics. Intelligent Systems Reference Library 187, Springer 2020, ISBN 978-3-030-42043-7, pp. 1-166 - [j23]Mukundraj V. Patil, Anand J. Kulkarni:
Pareto dominance based Multiobjective Cohort Intelligence algorithm. Inf. Sci. 538: 69-118 (2020) - [j22]Apoorva S. Shastri, Aniket Nargundkar, Anand J. Kulkarni, Kamal Kumar Sharma:
Multi-cohort intelligence algorithm for solving advanced manufacturing process problems. Neural Comput. Appl. 32(18): 15055-15075 (2020) - [c12]Apoorva S. Shastri, Aniket Nargundkar, Anand J. Kulkarni:
Modified Multi-cohort Intelligence Algorithm with Panoptic Learning for Unconstrained Problems. FICTA (2) 2020: 145-153
2010 – 2019
- 2019
- [j21]Vidyadhar H. Iyer, S. Mahesh, Rohit Malpani, Mandar Sapre, Anand J. Kulkarni:
Adaptive Range Genetic Algorithm: A hybrid optimization approach and its application in the design and economic optimization of Shell-and-Tube Heat Exchanger. Eng. Appl. Artif. Intell. 85: 444-461 (2019) - [j20]Dipti Kapoor Sarmah, Anand J. Kulkarni:
Improved Cohort Intelligence - A high capacity, swift and secure approach on JPEG image steganography. J. Inf. Secur. Appl. 45: 90-106 (2019) - 2018
- [j19]Meeta Kumar, Anand J. Kulkarni, Suresh Chandra Satapathy:
Socio evolution & learning optimization algorithm: A socio-inspired optimization methodology. Future Gener. Comput. Syst. 81: 252-272 (2018) - [j18]Dipti Kapoor Sarmah, Anand J. Kulkarni:
JPEG based steganography methods using Cohort Intelligence with Cognitive Computing and modified Multi Random Start Local Search optimization algorithms. Inf. Sci. 430: 378-396 (2018) - [j17]Pritesh Shah, Sudhir Agashe, Anand J. Kulkarni:
Design of a fractional PIλDμ controller using the cohort intelligence method. Frontiers Inf. Technol. Electron. Eng. 19(3): 437-445 (2018) - [j16]Shreesh V. Dhavle, Anand J. Kulkarni, Apoorva S. Shastri, Ishaan R. Kale:
Design and economic optimization of shell-and-tube heat exchanger using cohort intelligence algorithm. Neural Comput. Appl. 30(1): 111-125 (2018) - [j15]Omkar Kulkarni, Ninad Kulkarni, Anand J. Kulkarni, Ganesh Kakandikar:
Constrained cohort intelligence using static and dynamic penalty function approach for mechanical components design. Int. J. Parallel Emergent Distributed Syst. 33(6): 570-588 (2018) - [j14]Ishaan R. Kale, Anand J. Kulkarni:
Cohort intelligence algorithm for discrete and mixed variable engineering problems. Int. J. Parallel Emergent Distributed Syst. 33(6): 627-662 (2018) - [j13]Apoorva S. Shastri, Anand J. Kulkarni:
Multi-Cohort Intelligence algorithm: an intra- and inter-group learning behaviour based socio-inspired optimisation methodology. Int. J. Parallel Emergent Distributed Syst. 33(6): 675-715 (2018) - [j12]Neha S. Patankar, Anand J. Kulkarni:
Variations of cohort intelligence. Soft Comput. 22(6): 1731-1747 (2018) - [i2]Apoorva S. Shastri, Anand J. Kulkarni:
Multi-Cohort Intelligence Algorithm: An Intra- and Inter-group Learning Behavior based Socio-inspired Optimization Methodology. CoRR abs/1806.01681 (2018) - 2017
- [b2]Anand Jayant Kulkarni, Ganesh Krishnasamy, Ajith Abraham:
Cohort Intelligence: A Socio-inspired Optimization Method. Intelligent Systems Reference Library 114, Springer 2017, ISBN 978-3-319-44253-2, pp. 1-134 - [j11]Wen Liang Chang, Jeevan Kanesan, Anand Jayant Kulkarni, Harikrishnan Ramiah:
Data clustering using seed disperser ant algorithm. Turkish J. Electr. Eng. Comput. Sci. 25: 4522-4532 (2017) - [j10]Teo Ting Huan, Anand J. Kulkarni, Jeevan Kanesan, Joon Huang Chuah, Ajith Abraham:
Ideology algorithm: a socio-inspired optimization methodology. Neural Comput. Appl. 28(S-1): 845-876 (2017) - 2016
- [j9]Anand J. Kulkarni, Md. Fazle Baki, Ben A. Chaouch:
Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems. Eur. J. Oper. Res. 250(2): 427-447 (2016) - [j8]Anand J. Kulkarni, Ishaan R. Kale, Kang Tai:
Probability collectives for solving discrete and mixed variable problems. Int. J. Comput. Aided Eng. Technol. 8(4): 325-361 (2016) - [j7]Anand J. Kulkarni, Neha S. Patankar, Kang Tai:
Constraint handling in probability collectives using a modified feasibility-based rule. Int. J. Comput. Sci. Eng. 13(4): 303-321 (2016) - [j6]Anand J. Kulkarni, Hinna Shabir:
Solving 0-1 Knapsack Problem using Cohort Intelligence Algorithm. Int. J. Mach. Learn. Cybern. 7(3): 427-441 (2016) - [i1]Omkar Kulkarni, Ninad Kulkarni, Anand J. Kulkarni, Ganesh Kakandikar:
Constrained Cohort Intelligence using Static and Dynamic Penalty Function Approach for Mechanical Components Design. CoRR abs/1610.06009 (2016) - 2015
- [b1]Anand Jayant Kulkarni, Kang Tai, Ajith Abraham:
Probability Collectives - A Distributed Multi-agent System Approach for Optimization. Intelligent Systems Reference Library 86, Springer 2015, ISBN 978-3-319-15999-7, pp. 1-144 - [c11]Wen Liang Chang, Jeevan Kanesan, Anand Jayant Kulkarni:
Seed Disperser Ant Algorithm: An Evolutionary Approach for Optimization. EvoApplications 2015: 643-654 - [c10]Apoorva S. Shastri, Priya S. Jadhav, Anand Jayant Kulkarni, Ajith Abraham:
Solution to Constrained Test Problems Using Cohort Intelligence Algorithm. IBICA 2015: 427-435 - [c9]Suhas Machhindra Gaikwad, Rahul Raghvendra Joshi, Anand Jayant Kulkarni:
Cohort Intelligence and Genetic Algorithm Along with AHP to Recommend an Ice Cream to a Diabetic Patient. SEMCCO 2015: 40-49 - 2014
- [j5]Ganesh Krishnasamy, Anand J. Kulkarni, Paramesran Raveendran:
A hybrid approach for data clustering based on modified cohort intelligence and K-means. Expert Syst. Appl. 41(13): 6009-6016 (2014) - [j4]Neha S. Patankar, Anand Jayant Kulkarni, Kang Tai, T. D. Ghate, A. R. Parvate:
Multi-criteria probability collectives. Int. J. Bio Inspired Comput. 6(6): 369-383 (2014) - 2013
- [c8]Aditya Milind Deshpande, Gaurav Mohan Phatnani, Anand J. Kulkarni:
Constraint handling in Firefly Algorithm. CYBCONF 2013: 186-190 - [c7]Shubham J. Metkar, Anand J. Kulkarni:
Boundary Searching Genetic Algorithm: A Multi-objective Approach for Constrained Problems. FICTA 2013: 269-276 - [c6]Anand J. Kulkarni, Ishan P. Durugkar, Mrinal Kumar:
Cohort Intelligence: A Self Supervised Learning Behavior. SMC 2013: 1396-1400 - [p1]Anand J. Kulkarni, Kang Tai:
A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure. Agent-Based Optimization 2013: 175-201 - 2012
- [c5]Anand J. Kulkarni, Neha S. Patankar, Amani Sandupatla, Kang Tai:
A modified feasibility-based rule for solving constrained optimization problems using Probability Collectives. HIS 2012: 213-218 - [c4]Anand J. Kulkarni, Ishaan R. Kale, Kang Tai, S. Kazemzadeh Azad:
Discrete optimization of truss structure using Probability Collectives. HIS 2012: 225-230 - 2011
- [j3]Anand J. Kulkarni, Kang Tai:
A Probability Collectives Approach with a Feasibility-Based Rule for Constrained Optimization. Appl. Comput. Intell. Soft Comput. 2011: 980216:1-980216:19 (2011) - [j2]Anand J. Kulkarni, Kang Tai:
Solving Constrained Optimization Problems Using Probability Collectives and a Penalty Function Approach. Int. J. Comput. Intell. Appl. 10(4): 445-470 (2011) - 2010
- [j1]Anand Jayant Kulkarni, Kang Tai:
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems. Appl. Soft Comput. 10(3): 759-771 (2010) - [c3]Anand Jayant Kulkarni, Kang Tai:
Probability Collectives: A distributed optimization approach for constrained problems. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2008
- [c2]Anand J. Kulkarni, Kang Tai:
Probability Collectives for decentralized, distributed optimization: A Collective Intelligence Approach. SMC 2008: 1271-1275 - 2005
- [c1]Anand J. Kulkarni, René V. Mayorga:
The Design of the Spindle of the Cylindrical Grinding Machine through Neural Networks and Genetic Algorithm. IICAI 2005: 3323-3336
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
