Abstract
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keeping both the total travel cost at the minimum and the tours balanced. Eleven different problems with several variants were analyzed to validate the method. The 20 variants considered three to twenty salesmen regarding 11 to 783 cities. The results were compared with best-known solutions (BKSs) in the literature. Computational experiments showed that a total of eight final results were better than those of the BKSs, and the others were quite promising, showing that with few adaptations, it will be possible to obtain better results than those of the BKSs. Although the ACO metaheuristic does not guarantee that the best solution will be found, it is essential in problems with non-deterministic polynomial time complexity resolution or when used as an initial bound solution in an integer programming formulation. Computational experiments on a wide range of benchmark problems within an acceptable time limit showed that compared with four existing algorithms, the proposed algorithm presented better results for several problems than the other algorithms did.

Abstract
The massive industrialization of products in a factory environment requires testing the product at a stage before its exportation to the sales market. For example, the end-of-line tests at Continental Advanced Antenna contribute to the validation of an antenna's functionality, a product manufactured by this organization. In addition, the storage of information from the testing process allows the data manipulation through automated machine learning algorithms in search of a beneficial contribution. Studies in this area (automatic learning/machine learning) lead to the search and development of tools designed with objectives such as preventing anomalies in the production line, predictive maintenance, product quality assurance, forecast demand, forecasting safety problems, increasing resources, proactive maintenance, resource scalability, reduced production time, and anomaly detection, isolation, and correction. Once applied to the manufacturing environment, these advantages make the EOL system more productive, reliable, and less time-consuming. This way, a tool is proposed that allows the visualization and previous detection of trends associated with faults in the antenna testing system. Furthermore, it focuses on predicting failures at Continental's EOL.

Abstract
Artificial intelligence is transforming the way chatbots are created and used. The recent boom of artificial intelligence development is creating a whole new generation of intelligent approaches that enable a more efficient and effective design of chatbots. On the other hand, the increasing need and interest from the industry in artificial intelligence based solutions, is guaranteeing the necessary investment and applicational know-how that is pushing such solutions to a new dimension. Some relevant examples are e-commerce, health or education, which is the main focus of this work. This paper studies and analyses the impact that artificial intelligence models and solutions is having on the design and development of chatbots, when compared to the previously used approaches. Some of the most relevant current and future challenges in this domain are highlighted, which include language learning, sentiment interpretation, integration with other services, or data security and privacy issues.

Abstract
The continuous changes in electricity markets' mechanisms and operations turn this environment into a challenging domain for the participating entities. Simulation tools are increasingly being used for decision support purposes of such entities. In particular, multi-agent based simulation, which facilitates the modeling of different types of mechanisms and players, is being fruitfully applied to the study of worldwide electricity markets. An effective decision support to market players' negotiations is, however, still not properly reached due to the uncertainty that results from the increasing penetration of renewable generation and the complexity of market mechanisms themselves. In this scope, this paper proposes a novel metalearner that provides decision support to market players in their negotiations. The proposed metalearner uses as input the output of several other market negotiation strategies, which are used to create a new, enhanced response. The final result is achieved through the combination and evolution of the strategies' learning results by applying a genetic algorithm. © 2015 IEEE.

Abstract
One important issue in a machining robotic cell is the location of the workpiece with respect to the robot. The feasibility of the task, the quality of the final work and the energy consumption, just to mention a few, are all dependent upon it. This can be formulated as an optimization problem where the objective functions are chosen in order to meet desired performance criteria. Typically, the complexity of the problems and the large number of optimization parameters that, usually, are involved, make the genetic algorithms an appropriate tool in this context. In this paper, two optimization problems are formulated: firstly, the power consumed by the manipulator is considered and the problem is solved using a single-objective genetic algorithm; then the stiffness of the manipulator is also included and the respective optimization problem is solved using a multi-objective genetic algorithm. Simulation results are presented for a parallel manipulator robotic cell.

Abstract
In this paper the kinematic design of a 6-dof parallel robotic manipulator is analysed. Firstly, the condition number of the inverse kinematic jacobian is considered as the objective function, measuring the manipulator's dexterity and a genetic algorithm is used to solve the optimization problem. In a second approach, a neural network model of the analytical objective function is developed and subsequently used as the objective function in the genetic algorithm optimization search process. It is shown that the neuro-genetic algorithm can find close to optimal solutions for maximum dexterity, significantly reducing the computational burden. The sensitivity of the condition number in the robot's workspace is analysed and used to guide the designer in choosing the best structural configuration. Finally, a global optimization problem is also addressed.