default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIndadul Khan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Indadul Khan
, Manas Kumar Maiti, Krishnendu Basuli:
A random-permutation based GA for generalized traveling salesman problem in imprecise environments. Evol. Intell. 16(1): 229-245 (2023)- [j9]Sova Pal, Prasanta Dutta, Indadul Khan, Prasenjit Pramanik, Ajoy Kumar Maiti, Manas Kumar Maiti:
Coordination of Cyclic crossover and Bat Algorithm for the Travelling Salesman Problems in Different Environments: A Simulation Approach. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 31(6): 975-1003 (2023) - [j8]Indadul Khan, Prasanta Dutta, Manas Kumar Maiti, Krishnendu Basuli:
A perturbation based modified BAT algorithm for priority based covering salesman problem. J. Intell. Fuzzy Syst. 44(3): 3825-3849 (2023) - [j7]Indadul Khan, Krishnendu Basuli, Manas Kumar Maiti:
Multi-objective covering salesman problem: a decomposition approach using grey wolf optimization. Knowl. Inf. Syst. 65(1): 281-339 (2023) - 2022
- [j6]Indadul Khan, Manas Kumar Maiti, Krishnendu Basuli:
Multi-objective generalized traveling salesman problem: A decomposition approach. Appl. Intell. 52(10): 11755-11783 (2022) - [j5]Prasanta Dutta, Indadul Khan, Krishnendu Basuli, Manas Kumar Maiti:
A modified ACO with K-Opt for restricted covering salesman problems in different environments. Soft Comput. 26(12): 5773-5803 (2022) - 2020
- [j4]Indadul Khan, Manas Kumar Maiti, Krishnendu Basuli:
Multi-objective traveling salesman problem: an ABC approach. Appl. Intell. 50(11): 3942-3960 (2020)
2010 – 2019
- 2019
- [j3]Indadul Khan, Sova Pal, Manas Kumar Maiti:
A Hybrid PSO-GA Algorithm for Traveling Salesman Problems in Different Environments. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 27(5): 693-717 (2019) - [j2]Indadul Khan, Manas Kumar Maiti:
A swap sequence based Artificial Bee Colony algorithm for Traveling Salesman Problem. Swarm Evol. Comput. 44: 428-438 (2019) - 2018
- [j1]Indadul Khan, Manas Kumar Maiti:
A novel hybrid algorithm for generalized traveling salesman problems in different environments. Vietnam. J. Comput. Sci. 5(1): 27-43 (2018) - [c3]Indadul Khan, Sova Pal, Manas Kumar Maiti:
A modified particle swarm optimization algorithm for solving traveling salesman problem with imprecise cost matrix. RAIT 2018: 1-8 - [c2]Sova Pal, Indadul Khan, Manas Kumar Maiti:
A heuristic approach to solve multidimensional assignment problem. RAIT 2018: 1-7 - 2017
- [c1]Indadul Khan, Manas Kumar Maiti, Manoranjan Maiti:
Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem. ICMC 2017: 103-119
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-04-24 23:15 CEST 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:
