


default search action
Ishaan R. Kale
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [i5]Aswathi Malanthara, Ishaan R. Kale:
Hybrid Firefly-Genetic Algorithm for Single and Multi-dimensional 0-1 Knapsack Problems. CoRR abs/2501.14775 (2025) - 2024
- [j6]Ishaan R. Kale
, Mandar S. Sapre, Ayush Khedkar, Kaustubh Dhamankar, Abhinav Anand, Aayushi Singh:
Hybrid ACO-CI Algorithm for Beam Design Problems. SN Comput. Sci. 5(3): 282 (2024) - [j5]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) - [j4]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
- [i4]Ishaan R. Kale, Mandar S. Sapre, Ayush Khedkar, Kaustubh Dhamankar, Abhinav Anand, Aayushi Singh:
Hybrid ACO-CI Algorithm for Beam Design problems. CoRR abs/2303.16908 (2023) - [i3]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) - [i2]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) - 2022
- [i1]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)
2010 – 2019
- 2018
- [j3]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) - [j2]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) - 2016
- [j1]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) - 2012
- [c1]Anand J. Kulkarni
, Ishaan R. Kale, Kang Tai
, S. Kazemzadeh Azad:
Discrete optimization of truss structure using Probability Collectives. HIS 2012: 225-230
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 2025-02-27 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint