Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the
echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat …
echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat …
A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem
The water cycle algorithm (WCA) is a nature-inspired meta-heuristic recently contributed to
the community in 2012, which finds its motivation in the natural surface runoff phase in water …
the community in 2012, which finds its motivation in the natural surface runoff phase in water …
Solving traveling salesman problem using hybridization of rider optimization and spotted hyena optimization algorithm
Abstract Traveling Salesman Problem (TSP) is the combinatorial optimization problem,
where a salesman starting from a home city travels all the other cities and returns to the …
where a salesman starting from a home city travels all the other cities and returns to the …
Hyperparameter setting of LSTM-based language model using grey wolf optimizer
Hyperparameters is one of the most essential part of deep learning, because they can give
big impact to the performance of the model. Recent works show that if the hyperparameters …
big impact to the performance of the model. Recent works show that if the hyperparameters …
Discrete komodo algorithm for traveling salesman problem
This work presents a Discrete Komodo Algorithm (DKA) to solve the traveling salesman
problem (TSP). Inspired by the Komodo Mlipir Algorithm, a swarm intelligence algorithm …
problem (TSP). Inspired by the Komodo Mlipir Algorithm, a swarm intelligence algorithm …
Permutation rules and genetic algorithm to solve the traveling salesman problem
In this paper, a new approach including permutation rules and a genetic algorithm is
proposed to solve the symmetric travelling salesman problem. This problem is known to be …
proposed to solve the symmetric travelling salesman problem. This problem is known to be …
Heuristic and metaheuristic algorithms for the traveling salesman problem
Y Marinakis - Encyclopedia of optimization, 2024 - Springer
The traveling salesman problem (TSP) is one of the most representative problems in
combinatorial optimization. If we consider a salesman who has to visit n cities [77], the …
combinatorial optimization. If we consider a salesman who has to visit n cities [77], the …
The plant propagation algorithm for discrete optimisation: The case of the travelling salesman problem
Bİ Selamoğlu, A Salhi - Nature-inspired computation in engineering, 2016 - Springer
Abstract The Plant Propagation algorithm (PPA), has been demonstrated to work well on
continuous optimization problems. In this paper, we investigate its use in discrete …
continuous optimization problems. In this paper, we investigate its use in discrete …
Firefly algorithm-based hyperparameters setting of DRNN for Weather Prediction
A Deep Recurrent Neural Networks (DRNN) is powerful to be used in sequential datasets.
Quite hard tasks in DRNN is setting the optimum hyperparameters. There are known to be …
Quite hard tasks in DRNN is setting the optimum hyperparameters. There are known to be …
Discrete Firefly Algorithm for an Examination Timetabling
F Ghaisani, S Suyanto - 2019 International Seminar on …, 2019 - ieeexplore.ieee.org
Timetabling or scheduling is a common problem in an institution of medicine, transportation,
education, etc. It is a process of resource allocation by considering some predetermined …
education, etc. It is a process of resource allocation by considering some predetermined …