类 型
15 篇文献
 
MC-ANT: A Multi-Colony Ant Algorithm  
In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures th......
Artificial Evolution  2009
0次引用 0 0
Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search  
The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial optimization and belongs to the NP-complete classes, which means that it may be require an infeasible process......
Applied Soft Computing  2011
0次引用 0 0
Bus Network Optimization with a Time-Dependent Hybrid Algorithm  
This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve the Bus-Network Sched......
Journal of Universal Computer Science  2008
0次引用 0 0
KARINCA KOLONİSİ ALGORİTMASI İLE GEZEN SATICI PROBLEMİNİN ÇÖZÜMÜ  
Özet: Karinca kolonisi algoritmasi (KKA), gezgin satici ve benzer yapidaki problemlerin çözümü için geliştirilen sezgisel bir yöntemdir. Koloniler halinde yaşayan karincalar, yuvalariyla yiyecek arasi......
0次引用 0 0
Ant Colony Algorithms in Diverse Combinational Optimization Problems -A Survey  
Ant Colony Optimization (ACO) metaheuristic is a recent population-based approach inspired by the observation of real ants colony and based upon their collective foraging behavior. In ACO, solutions o......
0次引用 0 0
Multi-colony ant colony optimization for the node placement problem  
In this paper we propose a multi-colony ant colony optimization architecture. In this approach several colonies try to simultaneously solve a problem. Each colony has its own trail and set of control ......
Genetic and Evolutionary Computation Conference  2009
0次引用 0 0
An Improved Multi-agent Approach for Solving Large Traveling Salesman Problem  
The traveling salesman problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-hard, and is an often-used benchmark for new optimization techn......
Pacific Rim International Workshop on Multi-Agents  2006
0次引用 0 0
An analysis of communication policies for homogeneous multi-colony ACO algorithms  
Information Sciences  2010
6次引用 0 0
Adaptive Exchanging Strategies in Parallel Ant Colony Algorithm  
Two strategies for information exchange between processors in parallel ant colony algorithm are presented. Theses strategies can make each processor choose other processors to communicate and to updat......
Journal of Software  2007
0次引用 0 0
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem  
This paper introduces a new hybrid algorithmic nature inspired approach based on Honey Bees Mating Optimization for successfully solving the Euclidean Traveling Salesman Problem. The proposed algorit......
Information Sciences  2011
1次引用 0 0

1/2 第一页 上一页 1 2 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜