Within the field of linguistic fuzzy modeling with fuzzy rule‐based systems, the automatic derivation of the linguistic fuzzy rules from numerical data is an important task. In the last few years, a large number of contributions based on techniques such as neural networks and genetic algorithms have been proposed to face this problem. In this article, we introduce a novel approach to the fuzzy rule learning problem with ant colony optimization (ACO) algorithms. To do so, this learning task is formulated as a combinatorial optimization problem. Our learning process is based on the COR methodology proposed in previous works, which provides a search space that allows us to obtain fuzzy models with a good interpretability–accuracy trade‐off. A specific ACO‐based algorithm, the Best–Worst Ant System, is used for this purpose due to the good performance shown when solving other optimization problems. We analyze the behavior of the proposed method and compare it to other learning methods and search techniques when solving two real‐world applications. The obtained results lead us to remark the good performance of our proposal in terms of interpretability, accuracy, and efficiency. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 433–452, 2005.

Debates have been used to develop critical thinking within teaching environments. Many learning activities are configured as working groups, which use debates to make decisions. Nevertheless, in a classroom debate, only a few students can participate; large work groups are similarly limited. Whilst the use of web tools would appear to offer a convenient solution, none of those currently available provides an automated system for organizing contributions into a logical structure, or for making decisions. To address this problem, this paper describes a new tool for managing and structuring debates over the Internet, and presents the results of a series of trials in an educational context. The tool enables users to post opinions and proposals, and to make multiple group decisions. The main advantages are that it does not require a moderator, and all contributions are automatically arranged into an intuitive structure. Thus, it enabled large groups to carry out bigger projects. Empirical results showed that it also encouraged the involvement of all the students in debates and allowed the participation of each student to be evaluated. The tool demonstrated its advantages over traditional oral debates and, as far as we are aware, it incorporates features not found in any other comparable web tool.

In recent years there has been a growing interest in resource sharing systems as one of the possible ways to support sustainability. The use of resource pools, where people can drop a resource to be used by others in a local context, is highly dependent on the distribution of those resources on a map or graph. The optimization of these systems is an NP-Hard problem given its combinatorial nature and the inherent computational load required to simulate the use of a system. Furthermore, it is difficult to determine system overhead or unused resources without building the real system and test it in real conditions. Nevertheless, algorithms based on a candidate solution allow measuring hypothetical situations without the inconvenience of a physical implementation. In particular, this work focuses on obtaining the past usage of bike loan network infrastructures to optimize the station’s capacity distribution. Bike sharing systems are a good model for resource sharing systems since they contain common characteristics, such as capacity, distance, and temporary restrictions, which are present in most geographically distributed resources systems. To achieve this target, we propose a new approach based on evolutionary algorithms whose evaluation function will consider the cost of non-used bike places as well as the additional kilometers users would have to travel in the new distribution. To estimate its value, we will consider the geographical proximity and the trend in the areas to infer the behavior of users. This approach, which improves user satisfaction considering the past usage of the former infrastructure, as far as we know, has not been applied to this type of problem and can be generalized to other resource sharing problems with usage data.