Parameter adaptation-based ant colony optimization with dynamic hybrid mechanism
In this paper, a parameter adaptation-based ant colony optimization (ACO) algorithm based
on particle swarm optimization (PSO) algorithm with the global optimization ability, fuzzy …
on particle swarm optimization (PSO) algorithm with the global optimization ability, fuzzy …
Discrete spider monkey optimization for travelling salesman problem
Meta-heuristic algorithms inspired by biological species have become very popular in recent
years. Collective intelligence of various social insects such as ants, bees, wasps, termites …
years. Collective intelligence of various social insects such as ants, bees, wasps, termites …
A novel collaborative optimization algorithm in solving complex optimization problems
W Deng, H Zhao, L Zou, G Li, X Yang, D Wu - Soft Computing, 2017 - Springer
To overcome the deficiencies of weak local search ability in genetic algorithms (GA) and
slow global convergence speed in ant colony optimization (ACO) algorithm in solving …
slow global convergence speed in ant colony optimization (ACO) algorithm in solving …
DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem
S Ebadinezhad - Engineering Applications of Artificial Intelligence, 2020 - Elsevier
Abstract Ant Colony Optimization (ACO) algorithm is one of the effective solutions to solve
the problem of combination optimization like traveling salesman problem (TSP) which …
the problem of combination optimization like traveling salesman problem (TSP) which …
A new efficient hybrid algorithm for large scale multiple traveling salesman problems
C Jiang, Z Wan, Z Peng - Expert Systems with Applications, 2020 - Elsevier
Multiple traveling salesmen problem (MTSP) is not only a generalization of the traveling
salesman problem (TSP), but also more suitable for modeling practical problems in the real …
salesman problem (TSP), but also more suitable for modeling practical problems in the real …
Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms
Mobile collection of e-waste on demand is one of the methods that can contribute to an
increase in the collection rate of waste. In this method, a person requests the waste pick up …
increase in the collection rate of waste. In this method, a person requests the waste pick up …
Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem
Y Zhong, J Lin, L Wang, H Zhang - Swarm and Evolutionary Computation, 2018 - Elsevier
Particle swarm optimization (PSO) algorithm, one of the most popular swarm intelligence
algorithms, has been widely studied and applied to a large number of continuous and …
algorithms, has been widely studied and applied to a large number of continuous and …
Priority-based constructive algorithms for scheduling agile earth observation satellites with total priority maximization
R Xu, H Chen, X Liang, H Wang - Expert Systems with Applications, 2016 - Elsevier
This paper investigated an Earth observation scheduling problem for agile satellites under a
time window constraint and resource constraints of limited on-board memory capacity and …
time window constraint and resource constraints of limited on-board memory capacity and …
Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing–tabu search algorithm to solve the symmetrical traveling salesman problem
This paper applies a hybrid simulated annealing–tabu search algorithm to solve the
Traveling Salesman Problem (TSP). Fully considering the characteristics of the hybrid …
Traveling Salesman Problem (TSP). Fully considering the characteristics of the hybrid …
Solving travelling salesman problem using black hole algorithm
A Hatamlou - Soft Computing, 2018 - Springer
Over the last few decades, many nature-inspired algorithms have been proposed for solving
complex and difficult problems. Each algorithm has its own merits and drawbacks. One of …
complex and difficult problems. Each algorithm has its own merits and drawbacks. One of …