Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Indadul Khan"'
Autor:
Indadul Khan, Manas Kumar Maiti
Publikováno v:
Vietnam Journal of Computer Science, Vol 5, Iss 1, Pp 27-43 (2017)
Abstract A swap sequence-based particle swarm optimization (SSPSO) technique and genetic algorithm (GA) are used in tandem to develop a hybrid algorithm to solve generalized traveling salesman problem. Local search algorithm K-Opt is occasionally use
Externí odkaz:
https://doaj.org/article/c6631ea383b748caae45e36b11551ca0
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
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
Publikováno v:
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 27:693-717
In this study particle swarm optimization (PSO) is modified and hybridised with genetic algorithm (GA) using one’s output as the other's input to solve Traveling Salesman Problem(TSP). Here multiple velocity update rules are introduced to modify th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1119a5ddf700c3b0b090297effd98672
https://doi.org/10.1142/s0218488519500314
https://doi.org/10.1142/s0218488519500314
Autor:
Indadul Khan, Manas Kumar Maiti
Publikováno v:
Swarm and Evolutionary Computation. 44:428-438
In this research paper, Artificial Bee Colony algorithm is modified with multiple update rules and K-opt operation to solve the Traveling Salesman Problem. Here the features of swap sequences and swap operations on the sequence of cities (solution/pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f943baf631bf2a33b962a62f4b86c2e8
https://doi.org/10.1016/j.swevo.2018.05.006
https://doi.org/10.1016/j.swevo.2018.05.006
Publikováno v:
RAIT
Here a general methodology is proposed to solve both the balanced and the unbalanced multidimensional assignment problems (MAP) using any existing soft computing technique. Since MAP belongs to NP hard class, it cannot be solved in a reasonable time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caca2b254a750d2e77cd6ef67171275e
https://doi.org/10.1109/rait.2018.8389061
https://doi.org/10.1109/rait.2018.8389061
Publikováno v:
RAIT
Here, using swap sequence, swap operation and different velocity update rules a modified form of Particle Swarm Optimization(PSO) technique is outlined to solve Traveling Salesman Problem (TSP) having crisp or fuzzy cost matrix. In the propose approa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cebc42026894cb46a9dfcbcb310399a
https://doi.org/10.1109/rait.2018.8389060
https://doi.org/10.1109/rait.2018.8389060