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

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

2007

Stochastic solvers are researched primarily with the goal of providing ‘black box’ optimisation approaches for situations where the optimisation problem is too complex to model and therefore impossible to solve using a deterministic approach. Sometimes, however, problems or their instances have characteristics which interact with the solver in undocumented and unpredictable ways. This paper rev...

2007
Irene Moser

Stochastic solvers are researched primarily with the goal of providing ‘black box’ optimisation approaches for situations where the optimisation problem is too complex to model and therefore impossible to solve using a deterministic approach. Sometimes, however, problems or their instances have characteristics which interact with the solver in undocumented and unpredictable ways. This paper rev...

Journal: :IJAPUC 2016
Yin Huan

No part of this journal may be reproduced or used in any form or by any means without written permission from the publisher, except for noncommercial, educational use including classroom teaching purposes. Product or company names used in this journal are for identification purposes only. Inclusion of the names of the products or companies does not indicate a claim of ownership by IGI Global of...

Journal: :JSW 2013
Yongcheng Xu Ling Chen Shengrong Zou

In this paper, an algorithm based on ant colony optimization for community detection from bipartite networks is presented. The algorithm establishes a model graph for the ants’ searching. Each ant chooses its path according to the pheromone and heuristic information on each edge to construct a solution. Experimental results show that our algorithm can not only accurately identify the number of ...

2012
Matthew Medland Fernando E. B. Otero Alex Alves Freitas

Ant Colony Optimisation (ACO) has been successfully applied to the classification task of data mining in the form of Ant-Miner. A new extension of Ant-Miner, called cAnt-MinerPB, uses the ACO procedure in a different fashion. The main difference is that the search in cAnt-MinerPB is optimised to find the best list of rules, whereas in AntMiner the search is optimised to find the best individual...

2013
Luca Di Gaspero Andrea Rendl Tommaso Urli

Balancing bike sharing systems is an increasingly important problem, because of the rising popularity of this mean of transportation. Bike sharing systems need to be balanced so that bikes (and empty slots for returning bikes) are available to the customers, thus ensuring an adequate level of service. In this paper, we tackle the problem of balancing a real-world bike sharing system (BBSS) by m...

2000
Carlos A. Coello Coello Rosa Laura Zavala Gutierrez Benito Mendoza García Arturo Hernández Aguirre

In this paper we propose an application of the Ant System (AS) to optimize combinational logic circuits at the gate level. We deene a measure of quality improvement in partially built circuits to compute the distances required by the AS and we consider as optimal those solutions that represent functional circuits with a minimum amount of gates. The proposed methodology is described together wit...

2004
James Montgomery Marcus Randall Tim Hendtlass

Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution representations allow particular solutions to be reached on a greater number of paths in this construction tree than other solutions, which can introduce a bias to the search. A bias can also be introduced by the topology o...

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

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