2002, Vol. IX, Núm. 2-3

 

Part B: Special issue on Ant Colony Optimization: models & applications.

Summary

  • On the possbilities of fuzzification of the solution in fuzzy cooperative games 

    Mareš, Milan (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    Some possibilities of fuzzification of the von Neumann--Morgenstern solution of cooperative games with transferable utility (TU games) are briefly investigated. The fuzzification based on the transformation of individual ...

  • Two approaches to fuzzification of payments in NTU coalitional game 

    Mareš, Milan (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    There exist several possibilities of fuzzification of a coalitional game. It is quite usual to fuzzify, e.\,g., the concept of coalition, as it was done in [1]. Another possibility is to fuzzify the expected pay-offs, ...

  • A review on the ant colony optimization metaheuristic: basis, models and new trends 

    Cordón García, Oscar; Herrera Triguero, Francisco; Stützle, Thomas (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    Ant Colony Optimization (ACO) is a recent metaheuristic method that is inspired by the behavior of real ant colonies. In this paper, we review the underlying ideas of this approach that lead from the biological inspiration ...

  • Analysis of the best-worst ant system and its variants on the TSP 

    Cordón García, Oscar; Fernández de Viana, Iñaki; Herrera Triguero, Francisco (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    In this contribution, we will study the influence of the three main components of Best-Worst Ant System: the best-worst pheromone trail update rule, the pheromone trail mutation and the restart. Both the importance of ...

  • Experiments writh variants of ant algorithms 

    Stützle, Thomas; Linke, Sebastian (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the ...

  • Adaptive search heuristics for the generalized assignment problem 

    Ramalhinho Lourenço, Helena; Serra, Daniel (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, ...

  • An approach based on the use of the ant system to design combinatorial logic circuits 

    Mendoza García, Benito; Coello Coello, Carlos (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    In this paper we report the first attempt to design combinational logic circuits using the ant system. In order to design circuits, a measure of quality improvement in partially built circuits is introduced and a ...

  • Learning bayesian networks by ant colony optimisation: searching in two different spaces 

    Campos, Luís Miguel de; Gámez Martín, José Antonio; Puerta Castellón, José Miguel (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Article
    Open Access
    The most common way of automatically learning Bayesian networks from data is the combination of a scoring metric, the evaluation of the fitness of any given candidate network to the data base, and a search procedure to ...

  • Ant colony optimization: models and applications [Guest editorial] 

    Cordón García, Oscar; Herrera Triguero, Francisco; Stützle, Thomas (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
    Review
    Open Access
    Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the shortest path searching behavior of various ant species [1,2]. The initial work of Dorigo, Maniezzo and Colorni [3,4] who proposed the first ACO ...