La metaheurística sistema hormiga consiste en la analogía entre el procedimiento que utilizan las hormigas reales para la búsqueda de alimentos, encontrando la ruta más corta, y los problemas de optimización combinatoria para encontrar la... more
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or... more
Bus transit network modeling is a complex and combinatorial problem. The main purpose of this paper is to apply a contemporary method for designing a bus transit network with the objective of achieving optimum results. The method is... more
Le déclin fonctionnel est un syndrome grave qui touche les personnes âgées et qui peut être retardé ou évité par une détection précoce des risques. Dans cette étude, la reconnaissance vocale est utilisée pour aider à l'auto-évaluation des... more
In this contribution, we will study the influence of the three components of the Best-Worst Ant System (BWAS) algorithm. As the importance of each of them as the fact whether all of them are necessary will be analyzed. Besides, we will... more
Abstract: The collection of wild larvae seed as a source of raw material is a major sub industry of shellfish aquaculture. To predict when, where and in what quantities wild seed will be available, it is necessary to track the appearance... more
Ant colony optimization (ACO) is nowadays one of the most promising metaheuristics and an increasing amount of research has been devoted to its empirical and theoretical analysis. Some authors believe that the performance of ant colony... more
In this work we present a new approach to tackle the problem of Post Enrolment Course Timetabling as specified for the International Timetabling Competition 2007 (ITC2007), competition track 2. The heuristic procedure is based on Ant... more
This paper presents some results of the implementation of several optimization algorithms based on ant colonies, applied to the fuel reload design in a Boiling Water Reactor. The system called Azcaxalli is constructed with the following... more
We present an ant-based algorithm to solve multi-level capacitated lot sizing problems. We apply a hybrid approach where we use the ant system to optimize the decomposition of the problem into smaller subproblems. These subproblems... more
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply a hybrid approach where we use ant colony optimization in... more
Resumen La Inteligencia de Enjambres involucra acciones de grupos de individuos descentralizados y auto-organizados, las cuales pueden realizarse en paralelo. Las GPUs han mostrado ser arquitecturas capaces de proporcionar paralelismo... more
We present an ant-based algorithm to solve multi-level capacitated lot sizing problems. We apply a hybrid approach where we use the ant system to optimize the decomposition of the problem into smaller subproblems. These subproblems... more
Ant colony optimization (ACO) has widely been applied to solve combinatorial optimization problems in recent years. There are few studies, however, on its convergence time, which re?ects how many iteration times ACO algorithms spend in... more
Social insects are self-organized living organism without a commanding system with a single leader. A model which realizes self-organization of social insects can be constructed using a reaction threshold model based on the concept of... more
This article is based on a previous study made by Bris, Châtelet and Yalaoui [Bris R, Chatelet E, Yalaoui F. New method to minimise the preventive maintenance cost of series-parallel systems. Reliab Eng Syst Saf 2003;82:247-55]. They use... more
Schedule Generation and Fleet Assignment problems usually are solved separately. The integrated solution for both problems, although desirable, leads to large scale models of the NP-Hard class. This article presents a mathematical... more
Intelligent Transportation Systems (ITSs) are providing a broad range of services to all the actors involved in any type of transportation activities. Path planning is a common transportation problem, which can be extremely difficult when... more
Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when... more
This paper describes how biologically-inspired agents can be used to solve complex routing problems incorporating prioritized information flow. These agents, inspired by the foraging behavior of ants, exhibit the desirable characteristics... more
This paper describes how the Ant System can be improved by selfadaptation of its controlling parameters. Adaptation is achieved by integrating a genetic algorithm with the ant system and maintaining a population of agents (ants) that have... more
Self-adaptive cuckoo search algorithm is used to optimize the design of water distribution system problems. It is proposed to dynamically adjust the two sensitive parameters of the algorithm, (i) step size control parameter 'α' and (ii)... more
In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from... more
In this paper we try to describe the main characters of Heuristics ‘derived’ from Nature, a border area between Operations Research and Artificial Intelligence, with applications to graph optimization problems. These algorithms take... more
This article is based on a previous study made by Bris, Châtelet and Yalaoui [Bris R, Chatelet E, Yalaoui F. New method to minimise the preventive maintenance cost of series-parallel systems. Reliab Eng Syst Saf 2003;82:247-55]. They use... more
Resumen Muchos problemas de optimización en configuraciones geométricas son NP-duros por lo que interesa obtener soluciones aproximadas. En este trabajo proponemos la utilización de una técnica metaheurística, Optimización basada en... more
This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques. Genetic algorithms (GAs) are also known as efficient... more
We have used the metaphor of ant colonies to define "the Ant system", a class of distributed algorithms for combinatorial optimization. To test the Ant system we used the travelling salesman problem. In this paper we analyze some... more
Understanding connectivity among populations in fragmented landscapes is of paramount importance in species conservation because it determines their long-term viability and helps to identify and prioritize populations to conserve. Rare... more
Unmanned Aerial Vehicle (UAV) is defined as aircraft without the onboard presence of pilots. UAVs have been used to perform intelligence, surveillance, and reconnaissance missions. The UAVs are not limited to military operations, they can... more
Statistical-based feature extraction has been typically used to purpose obtaining the important features from the sky image for cloud classification. These features come up with many kinds of noise, redundant and irrelevant features which... more
En este trabajo se aplica un algoritmo de optimización de colonia de hormigas con límites de feromona superior e inferior denominado Max�Min Ant System, para resolver problemas de programación de una máquina con tiempos de preparación... more
This paper presents a case study of a local brewery situated near to Prague. Even though its management already has the software which solves the vehicle routing problem by Mayer and Branch and Bound methods, it is still favourable to... more
Skripsi ini menjelaskan tentang permasalahan dalam travelling salesman problem yang membahas masalah pencarian rute terpendek dalam graf untuk melewati semua tempat dan kembali lagi ke tempat awal. Tujuan skripsi ini adalah untuk... more
The research conducted is the Comparative Analysis of the ACO-TS and ACO-SMARTER Algorithms in Solving the Traveling Salesman Problem where the problem to be solved is the traveling salesman problem (TSP). The purpose of this study is to... more
In this paper, we extend upon current research in the vehicle routing problem whereby labour regulations affect planning horizons, and therefore, profitability. We call this extension the multiperiod vehicle routing problem with profit... more
This paper gives an algorithm for the graph bisection problem using the Ant System (AS) technique. The ant algorithm given in this paper differs from the usual ant algorithms in that the individual ant in the system does not construct a... more
Semantic Web data is increasing day by day. The important issue of this web is to handle inordinate volume of information that has many other challenges like query processing and optimisation over widely distributed RDF data. The proposed... more
A simple strategy for routing and load balancing in unstructured P2P network based on ant-like agents is presented [1]. In [Unger, Wulff], the authors present an algorithm, which enables to build a sorted structure on top of a P2P Network... more
This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and accurate way. A classification scheme is introduced and presented in a tabular form called TEA (Table of Evolutionary Algorithms). It... more
Travelling Salesman Problem (TSP) is the problem for finding the shortest route starting from start node then visiting number of nodes exactly once and finally go back to start node. If a TSP has a lot of nodes, it will be a NP-Hard... more
The Ant Colony Optimization method is a heuristic algorithm for solving various optimization problems, particularly the combinatorial optimization problems. Traditional ant-optimization methods might encounter search stagnation owing to a... more
Multi-goal navigation of an autonomous mobile robot seeks to reach multiple goals with a planned shortest trajectory in some real-world applications such as search and rescue robots, agricultural harvesting robots, resource prospecting... more
This chapter reviews the approaches that have been studied for the online adaptation of the parameters of ant colony optimization (ACO) algorithms, that is, the variation of parameter settings while solving an instance of a problem. We... more
In the field of textile industry, the distribution process is an important factor that can affect the cost of production. For that we need optimization on the distribution process to be more efficient. This problem is a model in the Multi... more
Ant Colony Extended (ACE) is a novel algorithm belonging to the general Ant Colony Optimisation (ACO) framework. Two specific features of ACE are: the division of tasks between two kinds of ants, namely patrollers and foragers, and the... more
One of the main roles of the nuclear fuel bundle spacer grid (SG) is to safely support the fuel rods (FRs) through springs and dimples. The SG design is an important matter for nuclear power plant operation when a damaged FR could release... more
Graphical Processing Units have been applied to solve NP-hard problems with no known polynomial time solutions. An example of such a problem is the Traveling Salesman Problem (TSP). The TSP is one of the most commonly studied... more
Wireless Sensor Networks have become a technology for the new millennium with the endless possibilities for applications ranging from academic to military. These tiny sensors are deployed in open environments, where security for data or... more
In Figure 1, a graphical representation of an example building sensor network is shown. Where a two building net-work with four floors and rooms equipped with or without sensors (denoted by shaded circles, and the arrows denotes the route... more