default search action
Apoorva S. Shastri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]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) - [j5]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) - 2023
- [j4]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) - [i5]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) - [i4]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) - [i3]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
- [i2]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) - 2020
- [j3]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) - [c2]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
- 2018
- [j2]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) - [j1]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) - [i1]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) - 2015
- [c1]Apoorva S. Shastri, Priya S. Jadhav, Anand Jayant Kulkarni, Ajith Abraham:
Solution to Constrained Test Problems Using Cohort Intelligence Algorithm. IBICA 2015: 427-435
Coauthor Index
aka: Anand J. Kulkarni
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 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint