The problem has been excessively studied[1][2][3][4][5][6] and a vast array of methods have been introduced to either find the optimal tour or a good less time consuming approximation. This paper will concentrate onthe second path of meta-heuristics and specifically on genetic algorithms(GA) and the historical association with the TSP. GA's have been around since 1957[7], starting with simulations for biological evolution. GA's are used for optimization problems with large search spaces. The TSP as an optimization problem therefore fits the usage and an application of GA's to the TSP was conceivable. In1975 Holland [8] laid the foundation for the success and the resulting interestin GA's. With his fundamental theorem of genetic algorithms he proclaimed the efficiency of GA's for optimization problems. A generic GA starts with the generation of a population of several different tours.

Build a repertoire of algorithms, discovering terms and approaches that apply generally. Bake intelligence into your algorithms, guiding them to discover good solutions to problems. Test your code and get inspired to try new problems. Work through scenarios to code your way out of a paper bag; an important skill for any competent programmer. See how the algorithms explore and learn by creating visualizations of each problem.

Distributed computing which uses Web services as fundamental elements, enables high-speed development of software applications through composing many interoperating, distributed, re-usable, and autonomous services. As a fundamental challenge for service developers, service composition must fulfil functional requirements and optimise Quality of Service (QoS) attributes, simultaneously. On the other hand, huge amounts of data have been created by advances in technologies, which may be exchanged between services. Data-intensive Web services are of great interest to implement data-intensive processes. However, current approaches to Web service composition have omitted either the effect of data, or the distribution of services. Evolutionary Computing (EC) techniques allow for the creation of compositions that meet all the above factors. In this paper, we will develop Genetic Algorithm (GA)-based approach for solving the problem of distributed data-intensive Web service composition (DWSC). In particular, we will introduce two new heuristics, i.e. Longest Common Subsequence(LCS) distance of services, in designing crossover operators. Additionally, a new local search technique incorporating distance of services will be proposed.

Imagine a black box which can help us to decide over an unlimited number of possibilities, with a criterion such that we can find an acceptable solution (both in time and quality) to a problem that we formulate. Genetic Algortithms (GA) are a mathematical model inspired by the famous Charles Darwin's idea of natural selection. The natural selection preserves only the fittest individuals, over the different generations. Imagine a population of 100 rabbits in 1900, if we look the population today, we are going to others rabbits more fast and skillful to find food than their ancestors. In machine learning, one of the uses of genetic algorithms is to pick up the right number of variables in order to create a predictive model.

Artificial Intelligence is a very exciting field of study. It has always seemed like the stuff of science fiction. However, Artificial Intelligence (AI) is becoming more and more prevalent and ingrained in our society. Machine Learning, a sub-field of AI where computers learn how to solve a task by incrementally improving their performance, has become commonplace in a wide variety of industries and applications. Examples of machine learning in business include the well-known filtering of spam emails or product reviews, credit card fraud detection, and even programming barbies to have interactive conversations.

We demonstrate high-accuracy tuning of poly(2-oxazoline) cloud point via machine learning. With a design space of four repeating units and a range of molecular masses, we achieve an accuracy of 4 C root mean squared error (RMSE) in a temperature range of 24– 90 C, employing gradient boosting with decision trees. The RMSE is 3x better than linear and polynomial regression. We perform inverse design via particle-swarm optimization, predicting and synthesizing 17 polymers with constrained design at 4 target cloud points from 37 to 80 C. Our approach challenges the status quo in polymer design with a machine learning algorithm, that is capable of fast and systematic discovery of new polymers.

In the last decade or so we have seen tremendous progress in Artificial Intelligence (AI). AI is now in the real world, powering applications that have a large practical impact. Most of it is based on modeling, i.e. machine learning of statistical models that make it possible to predict what the right decision might be in future situations. The next step for AI is machine creativity, i.e. tasks where the correct, or even good, solutions are not known, but need to be discovered. Methods for machine creativity have existed for decades. I believe we are now in a similar situation as deep learning was a few years ago: with the million-fold increase in computational power, those methods can now be used to scale up to creativity in real-world tasks. In particular, Evolutionary Computation is in a unique position to take advantage of that power, and become the next deep learning.

This paper presents a semantic brain computer interface (BCI) agent with particle swarm optimization (PSO) based on a Fuzzy Markup Language (FML) for Go learning and prediction applications. Additionally, we also establish an Open Go Darkforest (OGD) cloud platform with Facebook AI research (FAIR) open source Darkforest and ELF OpenGo AI bots. The Japanese robot Palro will simultaneously predict the move advantage in the board game Go to the Go players for reference or learning. The proposed semantic BCI agent operates efficiently by the human-based BCI data from their brain waves and machine-based game data from the prediction of the OGD cloud platform for optimizing the parameters between humans and machines. Experimental results show that the proposed human and smart machine co-learning mechanism performs favorably. We hope to provide students with a better online learning environment, combining different kinds of handheld devices, robots, or computer equipment, to achieve a desired and intellectual learning goal in the future.

Physicists speak of four fundamental forces that govern the interactions among the bits of matter that make up our universe. The strongest of these four forces, aptly known as the Strong Force, is so powerful that it can keep an atom's positively charged protons from ripping the atom's nucleus apart as their mutually repellent positive charges push them in opposite directions. The second fundamental force, electromagnetism, is 137 times weaker than the strong force, but its ability to cause bits of matter with opposing electrical charges to attract each other, and to cause bits of matter with like charges to avoid each other, is what gives unique three-dimensional structure to atoms, molecules, and even the proteins that form the building blocks of our body's cells. At only one-millionth the strength of the strong force, the third fundamental force--the so-called weak force--changes quarks from one bizarre "flavor" to another and gives rise to nuclear fusion reactions. The weak force deserves a better name: It's actually the fourth force--gravity--that's the weakling of the bunch.

Software development effort estimation is considered a fundamental task for software development life cycle as well as for managing project cost, time and quality. Therefore, accurate estimation is a substantial factor in projects success and reducing the risks. In recent years, software effort estimation has received a considerable amount of attention from researchers and became a challenge for software industry. In the last two decades, many researchers and practitioners proposed statistical and machine learning-based models for software effort estimation. In this work, Firefly Algorithm is proposed as a metaheuristic optimization method for optimizing the parameters of three COCOMO-based models. These models include the basic COCOMO model and other two models proposed in the literature as extensions of the basic COCOMO model. The developed estimation models are evaluated using different evaluation metrics. Experimental results show high accuracy and significant error minimization of Firefly Algorithm over other metaheuristic optimization algorithms including Genetic Algorithms and Particle Swarm Optimization.