Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Krishnendu Basuli"'
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 44:3825-3849
In this study, Bat algorithm (BA) is modified along with K-opt operation and one newly proposed perturbation approach to solve the well known covering salesman problem (CSP). Here, along with the restriction of the radial distances of the unvisited c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6af1e7ee03520b76ade710b17389b4f
https://doi.org/10.3233/jifs-220396
https://doi.org/10.3233/jifs-220396
Publikováno v:
Soft Computing. 26:5773-5803
In this study, the ant colony optimization (ACO) algorithm is modified with the K-opt operation to solve the covering salesman problem(CSP) under one restriction in crisp and imprecise (fuzzy, rough) environments. A CSP involves two phases- the divis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2da21951b9fdff5fee903dbe7811b4d8
https://doi.org/10.1007/s00500-022-06978-0
https://doi.org/10.1007/s00500-022-06978-0
Publikováno v:
Applied Intelligence. 52:11755-11783
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f0312f40e2c61ceaea94f4a45fbe969
https://doi.org/10.1007/s10489-021-02989-w
https://doi.org/10.1007/s10489-021-02989-w
Publikováno v:
Evolutionary Intelligence. 16:229-245
A random-permutation technique and the features of the genetic algorithm (GA) are combined together to develop a novel heuristic for solving generalized travelling salesman problem. Here, the random-permutation technique is used to find the sequence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::841b8b2c3c8eb8bdf9364f359ec8a78e
https://doi.org/10.1007/s12065-021-00651-5
https://doi.org/10.1007/s12065-021-00651-5
Autor:
Dr. Krishnendu Basuli
In real life, the problems may be of infinite dimensions. Design of ingenious information structure, for minimizing complexity and redundancy of the problem space are versatile. This is unique in the sense: given an arbitrary ’n’ node graph the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::e7bbff74f9ed12060abec7abd1228304
https://zenodo.org/record/8090569
https://zenodo.org/record/8090569
Publikováno v:
Applied Intelligence. 50:3942-3960
Using the concept of swap operation and swap sequence on the sequence of paths of a Traveling Salesman Problem(TSP) Artificial Bee Colony (ABC) algorithm is modified to solve multi-objective TSP. The fitness of a solution is determined using a rule f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd32f88a4df7c919c4ce2531bb2e8b5a
https://doi.org/10.1007/s10489-020-01713-4
https://doi.org/10.1007/s10489-020-01713-4
Autor:
Probir Mondal, Krishnendu Basuli
Publikováno v:
Proceedings of International Conference on Advanced Computing Applications ISBN: 9789811652066
Proceedings of International Conference on Advanced Computing Applications
Proceedings of International Conference on Advanced Computing Applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc99e9ed4205ef9f593d4d100b8aec2b
https://doi.org/10.1007/978-981-16-5207-3_33
https://doi.org/10.1007/978-981-16-5207-3_33
Publikováno v:
IOSR Journal of Engineering. :33-40
This paper is remodeling of Modified Booth's algorithm, where shift three at a time. The result shows that classical concept of single shift multiplication algorithms are to be revised with a multiple number of shifts. The observation is that in gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0514f5b6a4ac2ec233c876ebdb4a3a79
https://doi.org/10.9790/3021-02623340
https://doi.org/10.9790/3021-02623340
Publikováno v:
Ubiquity. 2008:1-7
The term CBIR seems to have originated in 1992, when it was describe experiments into automatic retrieval of images from a database, based on the colors and shapes present. Since then, the term has been used to describe the process of retrieving desi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84588960bc28e56bd3e8c5d0ff8b34ce
https://doi.org/10.1145/1459229.1459228
https://doi.org/10.1145/1459229.1459228
Two-level logic minimization is a central problem in logic synthesis, and has applications in reliability analysis and automated reasoning. This paper represents a method of minimizing Boolean sum of products function with binary decision diagram and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::561bcb48d5ac1f38d58f8f278145ceac
https://zenodo.org/record/1299135
https://zenodo.org/record/1299135