نتایج جستجو برای: ant colony optimisation

تعداد نتایج: 87633  

Journal: :Engineering research express 2022

Abstract To improve the inspection efficiency of free-form surfaces using coordinate measuring machines (CMMs), this paper proposes a CMM path optimization method based on an improved ant colony optimisation algorithm. The composition and its mathematical model are first analysed, then algorithm is applied to minimize objective function. address problem that has difficulty jumping out local opt...

Journal: :CoRR 2013
James McLaughlin John A. Clark

The two most important criteria for vectorial Boolean functions used as S-boxes in block ci-phers are differential uniformity and nonlinearity. Previous work in this field has focused onlyon nonlinearity and a different criterion, autocorrelation. In this paper, we describe the resultsof experiments in using simulated annealing, memetic algorithms, and ant colony optimisation to...

2004
Michael P. Oakes

This paper describes the use of Ant Colony Optimisation for the classification of works of disputed authorship, in this case the Federalist Papers.Classification accuracy was 79.1%, which compares reasonably well with previous work on the same data set using neural networks and genetic algorithms. Although statistical approaches have performed much better than this, the advantage of a rule-base...

2003
HALINA KWAŚNICKA H. Kwaśnicka

The paper presents a simulation study of the usefulness of a number of meta-heuristics used as optimisation methods for TSP problems. The five considered approaches are outlined: Genetic Algorithm, Simulated Annealing, Ant Colony System, Tabu Search and Hopfield Neural Network. Using a purpose-developed computer program, efficiency of the meta-heuritics has been studied and compared. Results ob...

2004
Philip Hingston Graham Kendall

In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism of ACO’s to simultaneously search for tours starting from all positions on the chessboard. We compare the new algorithm to a recently reported genetic algorithm, and to a depth-first backtracking search using Warnsdorff...

Journal: :Algorithms 2021

The increasing demand for work-ready students has heightened the need universities to provide work integrated learning programs enhance and reinforce students’ experiences. Students benefit most when placements meet their academic requirements graduate aspirations. Businesses community partners are more engaged they allocated that industry requirements. In this paper, both an integer programmin...

Journal: :International Journal of Bio-Inspired Computation 2014

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :journal of the iranian chemical research 0
vali zare-shahabadi department of chemistry, mahshahr branch, islamic azad university, mahshahr, iran

the classification and regression trees (cart) possess the advantage of being able to handlelarge data sets and yield readily interpretable models. in spite to these advantages, they are alsorecognized as highly unstable classifiers with respect to minor perturbations in the training data.in the other words methods present high variance. fuzzy logic brings in an improvement in theseaspects due ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید