A hierarchic approach based on swarm intelligence to solve the traveling salesman problem
The purpose of this paper is to present a new hierarchic method based on swarm
intelligence algorithms for solving the well-known traveling salesman problem. The swarm …
intelligence algorithms for solving the well-known traveling salesman problem. The swarm …
Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP
Ant Colony Optimization (ACO) is a bioinspired metaheuristic based on ants foraging used
to solve different classes of problems. In this paper, we show how, using a Two-Stage …
to solve different classes of problems. In this paper, we show how, using a Two-Stage …
An overview of different techniques and algorithms for network topology discovery
RA Alhanani, J Abouchabaka - 2014 Second World Conference …, 2014 - ieeexplore.ieee.org
Network topology discovery describes the physical structure of the network, which in turn
reflects the purpose of this network design. Used tools and techniques vary depending on …
reflects the purpose of this network design. Used tools and techniques vary depending on …
The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems
This work investigates the effect of elite pool that has high-quality and diverse solutions in
three hybrid population-based meta-heuristics with an elite pool of a hybrid Elitist-Ant …
three hybrid population-based meta-heuristics with an elite pool of a hybrid Elitist-Ant …
Two-stage updating pheromone for invariant ant colony optimization algorithm
Z Zhang, Z Feng - Expert Systems with Applications, 2012 - Elsevier
Ant colony optimization (ACO) is a metaheuristic approach for combinatorial optimization
problems. With the introduction of hypercube framework, invariance property of ACO …
problems. With the introduction of hypercube framework, invariance property of ACO …
Adaptive elitist-ant system for solving combinatorial optimization problems
A Abuhamdah - Applied Soft Computing, 2021 - Elsevier
This work investigates the effects achieved by using an adaptive elite pool over a basic
population-based approach, such as, the ant system approach, to different combinatorial …
population-based approach, such as, the ant system approach, to different combinatorial …
Algorithms and methods inspired from nature for solving supply chain and logistics optimization problems: a survey
G Dounias, V Vassiliadis - Research Methods: Concepts …, 2015 - igi-global.com
The current work surveys 245 papers and research reports related to algorithms and
methods inspired from nature for solving supply chain and logistics optimization problems …
methods inspired from nature for solving supply chain and logistics optimization problems …
Hybrid elitist-ant system for a symmetric traveling salesman problem: case of Jordan
GM Jaradat - Neural Computing and Applications, 2018 - Springer
This work investigates the performance of a hybrid population-based meta-heuristic with an
external memory structure of a hybrid elitist-ant system (elitist-AS). This memory is known as …
external memory structure of a hybrid elitist-ant system (elitist-AS). This memory is known as …
改进型蚁群算法求解旅行Agent 问题
马骏, 张健沛, 杨静, 程丽丽 - 北京邮电大学学报, 2008 - journal.bupt.edu.cn
旅行Agent 问题是一类复杂的组合优化问题, 目的在于解决移动Agent 在不同主机间移动如何
规划最优的迁移路线. 在蚁群算法的基础上, 引入变异运算, 并且对蚁群算法的全局和局部更新 …
规划最优的迁移路线. 在蚁群算法的基础上, 引入变异运算, 并且对蚁群算法的全局和局部更新 …
[PDF][PDF] Improved chicken swarm optimization algorithm to solve the travelling salesman problem
F Chebihi, ME Riffi, A Agharghor… - Indonesian Journal of …, 2018 - academia.edu
This paper proposes a novel discrete bio-inspired chicken swarm optimization algorithm
(CSO) to solve the problem of the traveling salesman problem (TSP) which is one of the …
(CSO) to solve the problem of the traveling salesman problem (TSP) which is one of the …