-
Book Overview & Buying
-
Table Of Contents
Hands-On Genetic Algorithms with Python - Second Edition
By :
In this chapter, you will learn how genetic algorithms can be utilized in combinatorial optimization applications. We will start by describing search problems and combinatorial optimization, and outline several hands-on examples of combinatorial optimization problems. We will then analyze each of these problems and match them with Python-based solutions using the DEAP framework. The optimization problems we’ll cover are the well-known knapsack problem, the traveling salesman problem (TSP), and the vehicle routing problem (VRP). As a bonus, we will cover the topics of genotype-to-phenotype mapping and exploration versus exploitation.
By the end of this chapter, you will be able to do the following: