Skip to content

Commit a3e1198

Browse files
committed
.
0 parents  commit a3e1198

35 files changed

+6284
-0
lines changed

LICENSE

+176
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,176 @@
1+
Apache License
2+
Version 2.0, January 2004
3+
http://www.apache.org/licenses/
4+
5+
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6+
7+
1. Definitions.
8+
9+
"License" shall mean the terms and conditions for use, reproduction,
10+
and distribution as defined by Sections 1 through 9 of this document.
11+
12+
"Licensor" shall mean the copyright owner or entity authorized by
13+
the copyright owner that is granting the License.
14+
15+
"Legal Entity" shall mean the union of the acting entity and all
16+
other entities that control, are controlled by, or are under common
17+
control with that entity. For the purposes of this definition,
18+
"control" means (i) the power, direct or indirect, to cause the
19+
direction or management of such entity, whether by contract or
20+
otherwise, or (ii) ownership of fifty percent (50%) or more of the
21+
outstanding shares, or (iii) beneficial ownership of such entity.
22+
23+
"You" (or "Your") shall mean an individual or Legal Entity
24+
exercising permissions granted by this License.
25+
26+
"Source" form shall mean the preferred form for making modifications,
27+
including but not limited to software source code, documentation
28+
source, and configuration files.
29+
30+
"Object" form shall mean any form resulting from mechanical
31+
transformation or translation of a Source form, including but
32+
not limited to compiled object code, generated documentation,
33+
and conversions to other media types.
34+
35+
"Work" shall mean the work of authorship, whether in Source or
36+
Object form, made available under the License, as indicated by a
37+
copyright notice that is included in or attached to the work
38+
(an example is provided in the Appendix below).
39+
40+
"Derivative Works" shall mean any work, whether in Source or Object
41+
form, that is based on (or derived from) the Work and for which the
42+
editorial revisions, annotations, elaborations, or other modifications
43+
represent, as a whole, an original work of authorship. For the purposes
44+
of this License, Derivative Works shall not include works that remain
45+
separable from, or merely link (or bind by name) to the interfaces of,
46+
the Work and Derivative Works thereof.
47+
48+
"Contribution" shall mean any work of authorship, including
49+
the original version of the Work and any modifications or additions
50+
to that Work or Derivative Works thereof, that is intentionally
51+
submitted to Licensor for inclusion in the Work by the copyright owner
52+
or by an individual or Legal Entity authorized to submit on behalf of
53+
the copyright owner. For the purposes of this definition, "submitted"
54+
means any form of electronic, verbal, or written communication sent
55+
to the Licensor or its representatives, including but not limited to
56+
communication on electronic mailing lists, source code control systems,
57+
and issue tracking systems that are managed by, or on behalf of, the
58+
Licensor for the purpose of discussing and improving the Work, but
59+
excluding communication that is conspicuously marked or otherwise
60+
designated in writing by the copyright owner as "Not a Contribution."
61+
62+
"Contributor" shall mean Licensor and any individual or Legal Entity
63+
on behalf of whom a Contribution has been received by Licensor and
64+
subsequently incorporated within the Work.
65+
66+
2. Grant of Copyright License. Subject to the terms and conditions of
67+
this License, each Contributor hereby grants to You a perpetual,
68+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69+
copyright license to reproduce, prepare Derivative Works of,
70+
publicly display, publicly perform, sublicense, and distribute the
71+
Work and such Derivative Works in Source or Object form.
72+
73+
3. Grant of Patent License. Subject to the terms and conditions of
74+
this License, each Contributor hereby grants to You a perpetual,
75+
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76+
(except as stated in this section) patent license to make, have made,
77+
use, offer to sell, sell, import, and otherwise transfer the Work,
78+
where such license applies only to those patent claims licensable
79+
by such Contributor that are necessarily infringed by their
80+
Contribution(s) alone or by combination of their Contribution(s)
81+
with the Work to which such Contribution(s) was submitted. If You
82+
institute patent litigation against any entity (including a
83+
cross-claim or counterclaim in a lawsuit) alleging that the Work
84+
or a Contribution incorporated within the Work constitutes direct
85+
or contributory patent infringement, then any patent licenses
86+
granted to You under this License for that Work shall terminate
87+
as of the date such litigation is filed.
88+
89+
4. Redistribution. You may reproduce and distribute copies of the
90+
Work or Derivative Works thereof in any medium, with or without
91+
modifications, and in Source or Object form, provided that You
92+
meet the following conditions:
93+
94+
(a) You must give any other recipients of the Work or
95+
Derivative Works a copy of this License; and
96+
97+
(b) You must cause any modified files to carry prominent notices
98+
stating that You changed the files; and
99+
100+
(c) You must retain, in the Source form of any Derivative Works
101+
that You distribute, all copyright, patent, trademark, and
102+
attribution notices from the Source form of the Work,
103+
excluding those notices that do not pertain to any part of
104+
the Derivative Works; and
105+
106+
(d) If the Work includes a "NOTICE" text file as part of its
107+
distribution, then any Derivative Works that You distribute must
108+
include a readable copy of the attribution notices contained
109+
within such NOTICE file, excluding those notices that do not
110+
pertain to any part of the Derivative Works, in at least one
111+
of the following places: within a NOTICE text file distributed
112+
as part of the Derivative Works; within the Source form or
113+
documentation, if provided along with the Derivative Works; or,
114+
within a display generated by the Derivative Works, if and
115+
wherever such third-party notices normally appear. The contents
116+
of the NOTICE file are for informational purposes only and
117+
do not modify the License. You may add Your own attribution
118+
notices within Derivative Works that You distribute, alongside
119+
or as an addendum to the NOTICE text from the Work, provided
120+
that such additional attribution notices cannot be construed
121+
as modifying the License.
122+
123+
You may add Your own copyright statement to Your modifications and
124+
may provide additional or different license terms and conditions
125+
for use, reproduction, or distribution of Your modifications, or
126+
for any such Derivative Works as a whole, provided Your use,
127+
reproduction, and distribution of the Work otherwise complies with
128+
the conditions stated in this License.
129+
130+
5. Submission of Contributions. Unless You explicitly state otherwise,
131+
any Contribution intentionally submitted for inclusion in the Work
132+
by You to the Licensor shall be under the terms and conditions of
133+
this License, without any additional terms or conditions.
134+
Notwithstanding the above, nothing herein shall supersede or modify
135+
the terms of any separate license agreement you may have executed
136+
with Licensor regarding such Contributions.
137+
138+
6. Trademarks. This License does not grant permission to use the trade
139+
names, trademarks, service marks, or product names of the Licensor,
140+
except as required for reasonable and customary use in describing the
141+
origin of the Work and reproducing the content of the NOTICE file.
142+
143+
7. Disclaimer of Warranty. Unless required by applicable law or
144+
agreed to in writing, Licensor provides the Work (and each
145+
Contributor provides its Contributions) on an "AS IS" BASIS,
146+
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147+
implied, including, without limitation, any warranties or conditions
148+
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149+
PARTICULAR PURPOSE. You are solely responsible for determining the
150+
appropriateness of using or redistributing the Work and assume any
151+
risks associated with Your exercise of permissions under this License.
152+
153+
8. Limitation of Liability. In no event and under no legal theory,
154+
whether in tort (including negligence), contract, or otherwise,
155+
unless required by applicable law (such as deliberate and grossly
156+
negligent acts) or agreed to in writing, shall any Contributor be
157+
liable to You for damages, including any direct, indirect, special,
158+
incidental, or consequential damages of any character arising as a
159+
result of this License or out of the use or inability to use the
160+
Work (including but not limited to damages for loss of goodwill,
161+
work stoppage, computer failure or malfunction, or any and all
162+
other commercial damages or losses), even if such Contributor
163+
has been advised of the possibility of such damages.
164+
165+
9. Accepting Warranty or Additional Liability. While redistributing
166+
the Work or Derivative Works thereof, You may choose to offer,
167+
and charge a fee for, acceptance of support, warranty, indemnity,
168+
or other liability obligations and/or rights consistent with this
169+
License. However, in accepting such obligations, You may act only
170+
on Your own behalf and on Your sole responsibility, not on behalf
171+
of any other Contributor, and only if You agree to indemnify,
172+
defend, and hold each Contributor harmless for any liability
173+
incurred by, or claims asserted against, such Contributor by reason
174+
of your accepting any such warranty or additional liability.
175+
176+
END OF TERMS AND CONDITIONS

README.md

+69
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,69 @@
1+
# Genetic Algorithms with Python
2+
Source code from the book Genetic Algorithms with Python by Clinton Sheppard
3+
4+
![alt text](http://www.cs.unm.edu/~sheppard/img/Genetic_Algorithms_with_Python_cover.jpg "Genetic Algorithms with Python")
5+
6+
ISBN-10: 1540324001, ISBN-13: 978-1540324009
7+
8+
Get it from:
9+
- https://www.amazon.com/Genetic-Algorithms-Python-Clinton-Sheppard/dp/1540324001/ (paperback)
10+
- https://www.amazon.com/dp/B01MYOWVJ2/ (Kindle)
11+
12+
Table of Contents
13+
===
14+
15+
A brief introduction to genetic algorithms
16+
17+
Chapter 1: Hello World!
18+
- Guess a password given the number of correct letters in the guess. Build a mutation engine.
19+
20+
Chapter 2: One Max Problem
21+
- Produce an array of bits where all are 1s. Expands the engine to work with any type of gene.
22+
23+
Chapter 3: Sorted Numbers
24+
- Produce a sorted integer array. Demonstrates handling multiple fitness goals and constraints between genes.
25+
26+
Chapter 4: The 8 Queens Puzzle
27+
- Find safe Queen positions on an 8x8 board and then expand to NxN. Demonstrates the difference between phenotype and genotype.
28+
29+
Chapter 5: Graph Coloring
30+
- Color a map of the United States using only 4 colors. Introduces standard data sets and working with files. Also introduces using rules to work with gene constraints.
31+
32+
Chapter 6: Card Problem
33+
- More gene constraints. Introduces custom mutation, memetic algorithms, and the sum-of-difference technique. Also demonstrates a chromosome where the way a gene is used depends on its position in the gene array.
34+
35+
Chapter 7: Knights Problem
36+
- Find the minimum number of knights required to attack all positions on a board. Introduces custom genes and gene-array creation. Also demonstrates local minimums and maximums.
37+
38+
Chapter 8: Magic Squares
39+
- Find squares where all the rows, columns and both diagonals of an NxN matrix have the same sum. Introduces simulated annealing.
40+
41+
Chapter 9: Knapsack Problem
42+
- Optimize the content of a container for one or more variables. Introduces branch and bound and variable length chromosomes.
43+
44+
Chapter 10: Solving Linear Equations
45+
- Find the solutions to linear equations with 2, 3 and 4 unknowns. Branch and bound variation. Reinforces genotype flexibility.
46+
47+
Chapter 11: Generating Sudoku
48+
- A guided exercise in generating Sudoku puzzles.
49+
50+
Chapter 12: Traveling Salesman Problem (TSP)
51+
- Find the optimal route to visit cities. Introduces crossover and a pool of parents.
52+
53+
Chapter 13: Approximating Pi
54+
- Find the two 10-bit numbers whose dividend is closest to Pi. Introduces using one genetic algorithm to tune another.
55+
56+
Chapter 14: Equation Generation
57+
- Find the shortest equation that produces a specific result using addition, subtraction, multiplication, &c. Introduces symbolic genetic programming.
58+
59+
Chapter 15: The Lawnmower Problem
60+
- Generate a series of instructions that cause a lawnmower to cut a field of grass. Genetic programming with control structures, objects and automatically defined functions (ADFs).
61+
62+
Chapter 16: Logic Circuits
63+
- Generate circuits that behave like basic gates, gate combinations and finally a 2-bit adder. Introduces tree nodes and hill climbing.
64+
65+
Chapter 17: Regular Expressions
66+
- Find regular expressions that match wanted strings. Introduces chromosome repair and growth control.
67+
68+
Chapter 18: Tic-tac-toe
69+
- Create rules for playing the game without losing. Introduces tournament selection.

ch01/genetic.py

+85
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,85 @@
1+
# File: genetic.py
2+
# from chapter 1 of _Genetic Algorithms with Python_
3+
#
4+
# Author: Clinton Sheppard <[email protected]>
5+
# Copyright (c) 2016 Clinton Sheppard
6+
#
7+
# Licensed under the Apache License, Version 2.0 (the "License").
8+
# You may not use this file except in compliance with the License.
9+
# You may obtain a copy of the License at
10+
# http://www.apache.org/licenses/LICENSE-2.0
11+
#
12+
# Unless required by applicable law or agreed to in writing, software
13+
# distributed under the License is distributed on an "AS IS" BASIS,
14+
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
15+
# implied. See the License for the specific language governing
16+
# permissions and limitations under the License.
17+
18+
import random
19+
import statistics
20+
import sys
21+
import time
22+
23+
24+
def _generate_parent(length, geneSet, get_fitness):
25+
genes = []
26+
while len(genes) < length:
27+
sampleSize = min(length - len(genes), len(geneSet))
28+
genes.extend(random.sample(geneSet, sampleSize))
29+
genes = ''.join(genes)
30+
fitness = get_fitness(genes)
31+
return Chromosome(genes, fitness)
32+
33+
34+
def _mutate(parent, geneSet, get_fitness):
35+
index = random.randrange(0, len(parent.Genes))
36+
childGenes = list(parent.Genes)
37+
newGene, alternate = random.sample(geneSet, 2)
38+
childGenes[index] = alternate if newGene == childGenes[index] else newGene
39+
genes = ''.join(childGenes)
40+
fitness = get_fitness(genes)
41+
return Chromosome(genes, fitness)
42+
43+
44+
def get_best(get_fitness, targetLen, optimalFitness, geneSet, display):
45+
random.seed()
46+
bestParent = _generate_parent(targetLen, geneSet, get_fitness)
47+
display(bestParent)
48+
if bestParent.Fitness >= optimalFitness:
49+
return bestParent
50+
while True:
51+
child = _mutate(bestParent, geneSet, get_fitness)
52+
if bestParent.Fitness >= child.Fitness:
53+
continue
54+
display(child)
55+
if child.Fitness >= optimalFitness:
56+
return child
57+
bestParent = child
58+
59+
60+
class Chromosome:
61+
Genes = None
62+
Fitness = None
63+
64+
def __init__(self, genes, fitness):
65+
self.Genes = genes
66+
self.Fitness = fitness
67+
68+
69+
class Benchmark:
70+
@staticmethod
71+
def run(function):
72+
timings = []
73+
stdout = sys.stdout
74+
for i in range(100):
75+
sys.stdout = None
76+
startTime = time.time()
77+
function()
78+
seconds = time.time() - startTime
79+
sys.stdout = stdout
80+
timings.append(seconds)
81+
mean = statistics.mean(timings)
82+
if i < 10 or i % 10 == 9:
83+
print("{0} {1:3.2f} {2:3.2f}".format(
84+
1 + i, mean,
85+
statistics.stdev(timings, mean) if i > 1 else 0))

0 commit comments

Comments
 (0)