Snail Homing and Mating Search Algorithm: A Novel Bio-Inspired Metaheuristic Algorithm Article Swipe
Anand J. Kulkarni
,
Ishaan R. Kale
,
Apoorva Shastri
,
Aayush P. Khandekar
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2310.04020
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2310.04020
In this paper, a novel Snail Homing and Mating Search (SHMS) algorithm is proposed. It is inspired from the biological behaviour of the snails. Snails continuously travels to find food and a mate, leaving behind a trail of mucus that serves as a guide for their return. Snails tend to navigate by following the available trails on the ground and responding to cues from nearby shelter homes. The proposed SHMS algorithm is investigated by solving several unimodal and multimodal functions. The solutions are validated using standard statistical tests such as two-sided and pairwise signed rank Wilcoxon test and Friedman rank test. The solution obtained from the SHMS algorithm exhibited superior robustness as well as search space exploration capabilities within the less computational cost. The real-world application of SHMS algorithm is successfully demonstrated in the engineering design domain by solving three cases of design and economic optimization shell and tube heat exchanger problem. The objective function value and other statistical results obtained using SHMS algorithm are compared with other well-known metaheuristic algorithms.
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2310.04020
- https://arxiv.org/pdf/2310.04020
- OA Status
- green
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4394651881
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4394651881Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2310.04020Digital Object Identifier
- Title
-
Snail Homing and Mating Search Algorithm: A Novel Bio-Inspired Metaheuristic AlgorithmWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-10-06Full publication date if available
- Authors
-
Anand J. Kulkarni, Ishaan R. Kale, Apoorva Shastri, Aayush P. KhandekarList of authors in order
- Landing page
-
https://arxiv.org/abs/2310.04020Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2310.04020Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2310.04020Direct OA link when available
- Concepts
-
Algorithm, Snail, Metaheuristic, Computer science, Optimization algorithm, Mating, Search algorithm, Artificial intelligence, Mathematical optimization, Biology, Ecology, MathematicsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4394651881 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2310.04020 |
| ids.doi | https://doi.org/10.48550/arxiv.2310.04020 |
| ids.openalex | https://openalex.org/W4394651881 |
| fwci | |
| type | preprint |
| title | Snail Homing and Mating Search Algorithm: A Novel Bio-Inspired Metaheuristic Algorithm |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10100 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.4068000018596649 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Metaheuristic Optimization Algorithms Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C11413529 |
| concepts[0].level | 1 |
| concepts[0].score | 0.5942263603210449 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[0].display_name | Algorithm |
| concepts[1].id | https://openalex.org/C2779965526 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5551877021789551 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q308841 |
| concepts[1].display_name | Snail |
| concepts[2].id | https://openalex.org/C109718341 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5231351256370544 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q1385229 |
| concepts[2].display_name | Metaheuristic |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.49063268303871155 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C2987595161 |
| concepts[4].level | 2 |
| concepts[4].score | 0.44397661089897156 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Optimization algorithm |
| concepts[5].id | https://openalex.org/C514575182 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4196035861968994 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q228395 |
| concepts[5].display_name | Mating |
| concepts[6].id | https://openalex.org/C125583679 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4102494716644287 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q755673 |
| concepts[6].display_name | Search algorithm |
| concepts[7].id | https://openalex.org/C154945302 |
| concepts[7].level | 1 |
| concepts[7].score | 0.32386213541030884 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[7].display_name | Artificial intelligence |
| concepts[8].id | https://openalex.org/C126255220 |
| concepts[8].level | 1 |
| concepts[8].score | 0.27090027928352356 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[8].display_name | Mathematical optimization |
| concepts[9].id | https://openalex.org/C86803240 |
| concepts[9].level | 0 |
| concepts[9].score | 0.24919664859771729 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[9].display_name | Biology |
| concepts[10].id | https://openalex.org/C18903297 |
| concepts[10].level | 1 |
| concepts[10].score | 0.23483240604400635 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q7150 |
| concepts[10].display_name | Ecology |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.22715076804161072 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| keywords[0].id | https://openalex.org/keywords/algorithm |
| keywords[0].score | 0.5942263603210449 |
| keywords[0].display_name | Algorithm |
| keywords[1].id | https://openalex.org/keywords/snail |
| keywords[1].score | 0.5551877021789551 |
| keywords[1].display_name | Snail |
| keywords[2].id | https://openalex.org/keywords/metaheuristic |
| keywords[2].score | 0.5231351256370544 |
| keywords[2].display_name | Metaheuristic |
| keywords[3].id | https://openalex.org/keywords/computer-science |
| keywords[3].score | 0.49063268303871155 |
| keywords[3].display_name | Computer science |
| keywords[4].id | https://openalex.org/keywords/optimization-algorithm |
| keywords[4].score | 0.44397661089897156 |
| keywords[4].display_name | Optimization algorithm |
| keywords[5].id | https://openalex.org/keywords/mating |
| keywords[5].score | 0.4196035861968994 |
| keywords[5].display_name | Mating |
| keywords[6].id | https://openalex.org/keywords/search-algorithm |
| keywords[6].score | 0.4102494716644287 |
| keywords[6].display_name | Search algorithm |
| keywords[7].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[7].score | 0.32386213541030884 |
| keywords[7].display_name | Artificial intelligence |
| keywords[8].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[8].score | 0.27090027928352356 |
| keywords[8].display_name | Mathematical optimization |
| keywords[9].id | https://openalex.org/keywords/biology |
| keywords[9].score | 0.24919664859771729 |
| keywords[9].display_name | Biology |
| keywords[10].id | https://openalex.org/keywords/ecology |
| keywords[10].score | 0.23483240604400635 |
| keywords[10].display_name | Ecology |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.22715076804161072 |
| keywords[11].display_name | Mathematics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2310.04020 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2310.04020 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2310.04020 |
| locations[1].id | doi:10.48550/arxiv.2310.04020 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2310.04020 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5080691948 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-6242-9492 |
| authorships[0].author.display_name | Anand J. Kulkarni |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Anand J Kulkarni |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5004794906 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-2983-5004 |
| authorships[1].author.display_name | Ishaan R. Kale |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Ishaan R Kale |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5015753496 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-2242-1511 |
| authorships[2].author.display_name | Apoorva Shastri |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Apoorva Shastri |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5034691612 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | Aayush P. Khandekar |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Aayush Khandekar |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2310.04020 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Snail Homing and Mating Search Algorithm: A Novel Bio-Inspired Metaheuristic Algorithm |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10100 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.4068000018596649 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Metaheuristic Optimization Algorithms Research |
| related_works | https://openalex.org/W2323696430, https://openalex.org/W2359298083, https://openalex.org/W3024875419, https://openalex.org/W4390174812, https://openalex.org/W2991712431, https://openalex.org/W2887635449, https://openalex.org/W3128231434, https://openalex.org/W2375811398, https://openalex.org/W2424512924, https://openalex.org/W1034268615 |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2310.04020 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2310.04020 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2310.04020 |
| primary_location.id | pmh:oai:arXiv.org:2310.04020 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2310.04020 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2310.04020 |
| publication_date | 2023-10-06 |
| publication_year | 2023 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 3, 31, 35, 42 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.It | 14 |
| abstract_inverted_index.as | 41, 89, 111, 113 |
| abstract_inverted_index.by | 51, 73, 137 |
| abstract_inverted_index.in | 132 |
| abstract_inverted_index.is | 12, 15, 71, 129 |
| abstract_inverted_index.of | 21, 37, 126, 141 |
| abstract_inverted_index.on | 56 |
| abstract_inverted_index.to | 27, 49, 61 |
| abstract_inverted_index.The | 67, 80, 101, 123, 152 |
| abstract_inverted_index.and | 7, 30, 59, 77, 91, 97, 143, 147, 156 |
| abstract_inverted_index.are | 82, 164 |
| abstract_inverted_index.for | 44 |
| abstract_inverted_index.the | 18, 22, 53, 57, 105, 119, 133 |
| abstract_inverted_index.SHMS | 69, 106, 127, 162 |
| abstract_inverted_index.cues | 62 |
| abstract_inverted_index.find | 28 |
| abstract_inverted_index.food | 29 |
| abstract_inverted_index.from | 17, 63, 104 |
| abstract_inverted_index.heat | 149 |
| abstract_inverted_index.less | 120 |
| abstract_inverted_index.rank | 94, 99 |
| abstract_inverted_index.such | 88 |
| abstract_inverted_index.tend | 48 |
| abstract_inverted_index.test | 96 |
| abstract_inverted_index.that | 39 |
| abstract_inverted_index.this | 1 |
| abstract_inverted_index.tube | 148 |
| abstract_inverted_index.well | 112 |
| abstract_inverted_index.with | 166 |
| abstract_inverted_index.Snail | 5 |
| abstract_inverted_index.cases | 140 |
| abstract_inverted_index.cost. | 122 |
| abstract_inverted_index.guide | 43 |
| abstract_inverted_index.mate, | 32 |
| abstract_inverted_index.mucus | 38 |
| abstract_inverted_index.novel | 4 |
| abstract_inverted_index.other | 157, 167 |
| abstract_inverted_index.shell | 146 |
| abstract_inverted_index.space | 115 |
| abstract_inverted_index.test. | 100 |
| abstract_inverted_index.tests | 87 |
| abstract_inverted_index.their | 45 |
| abstract_inverted_index.three | 139 |
| abstract_inverted_index.trail | 36 |
| abstract_inverted_index.using | 84, 161 |
| abstract_inverted_index.value | 155 |
| abstract_inverted_index.(SHMS) | 10 |
| abstract_inverted_index.Homing | 6 |
| abstract_inverted_index.Mating | 8 |
| abstract_inverted_index.Search | 9 |
| abstract_inverted_index.Snails | 24, 47 |
| abstract_inverted_index.behind | 34 |
| abstract_inverted_index.design | 135, 142 |
| abstract_inverted_index.domain | 136 |
| abstract_inverted_index.ground | 58 |
| abstract_inverted_index.homes. | 66 |
| abstract_inverted_index.nearby | 64 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.search | 114 |
| abstract_inverted_index.serves | 40 |
| abstract_inverted_index.signed | 93 |
| abstract_inverted_index.trails | 55 |
| abstract_inverted_index.within | 118 |
| abstract_inverted_index.leaving | 33 |
| abstract_inverted_index.results | 159 |
| abstract_inverted_index.return. | 46 |
| abstract_inverted_index.several | 75 |
| abstract_inverted_index.shelter | 65 |
| abstract_inverted_index.snails. | 23 |
| abstract_inverted_index.solving | 74, 138 |
| abstract_inverted_index.travels | 26 |
| abstract_inverted_index.Friedman | 98 |
| abstract_inverted_index.Wilcoxon | 95 |
| abstract_inverted_index.compared | 165 |
| abstract_inverted_index.economic | 144 |
| abstract_inverted_index.function | 154 |
| abstract_inverted_index.inspired | 16 |
| abstract_inverted_index.navigate | 50 |
| abstract_inverted_index.obtained | 103, 160 |
| abstract_inverted_index.pairwise | 92 |
| abstract_inverted_index.problem. | 151 |
| abstract_inverted_index.proposed | 68 |
| abstract_inverted_index.solution | 102 |
| abstract_inverted_index.standard | 85 |
| abstract_inverted_index.superior | 109 |
| abstract_inverted_index.unimodal | 76 |
| abstract_inverted_index.algorithm | 11, 70, 107, 128, 163 |
| abstract_inverted_index.available | 54 |
| abstract_inverted_index.behaviour | 20 |
| abstract_inverted_index.exchanger | 150 |
| abstract_inverted_index.exhibited | 108 |
| abstract_inverted_index.following | 52 |
| abstract_inverted_index.objective | 153 |
| abstract_inverted_index.proposed. | 13 |
| abstract_inverted_index.solutions | 81 |
| abstract_inverted_index.two-sided | 90 |
| abstract_inverted_index.validated | 83 |
| abstract_inverted_index.biological | 19 |
| abstract_inverted_index.functions. | 79 |
| abstract_inverted_index.multimodal | 78 |
| abstract_inverted_index.real-world | 124 |
| abstract_inverted_index.responding | 60 |
| abstract_inverted_index.robustness | 110 |
| abstract_inverted_index.well-known | 168 |
| abstract_inverted_index.algorithms. | 170 |
| abstract_inverted_index.application | 125 |
| abstract_inverted_index.engineering | 134 |
| abstract_inverted_index.exploration | 116 |
| abstract_inverted_index.statistical | 86, 158 |
| abstract_inverted_index.capabilities | 117 |
| abstract_inverted_index.continuously | 25 |
| abstract_inverted_index.demonstrated | 131 |
| abstract_inverted_index.investigated | 72 |
| abstract_inverted_index.optimization | 145 |
| abstract_inverted_index.successfully | 130 |
| abstract_inverted_index.computational | 121 |
| abstract_inverted_index.metaheuristic | 169 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile |