该代码包括遗传算法应用于函数优化和解决旅行商问题详细注释解析，以及本人做成的PPT。详细解析参考博客（https://blog.csdn.net/weixin_43935696/article/details/107045716）

作者：Pedro Domingos，华盛顿大学教授，高清英文原版

遗传算法（Genetic Algorithm, GA）是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型，是一种通过模拟自然进化过程搜索最优解的方法。该资源使用matlab对该算法进行了代码实现。

作者: Thomas H. Cormen / Charles E. Leiserson / Ronald L. Rivest / Clifford Stein 出版社: The MIT Press 出版年: 2009-7-31 页数: 1312 定价: USD 92.00 装帧: Hardcover ISBN: 9780262033848 内容简介 · · · · · · 　　Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. 　　The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide-and-Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. 　　As of the third edition, this textbook is published exclusively by the MIT Press.

用遗传算法实现二进制背包问题。 求解器的输入（KnapSackGA.java）是一个名为init.txt的文件，该文件的每一行包含以下内容： 项目数（例如7） 每个项目的值（以空格分隔）（例如1 2 3 4 5 6 7） 每个项目的重量（以空格分隔）（例如14 11 10 13 12 9 8） 背包最大尺寸（例如70） 人口规模（例如50） 世代数（例如100） 交叉概率（例如0.6） 突变概率（例如0.015）

Astar_Mahattn 如何修改墙体来限制路线？ 打开mainControl.java， 然后你就可以看到一系列前缀为wallShape的protected属性。你可以参照原有代码来修改或创建新的墙体。然后在内部类Monitor里面写一段wallShape.add()即可。 如何阅读代码？ 直接阅读mainProces.java。这是所有的操作步骤。 How to change the organazation of walls? Open mainControl.java, then you will see a list of protected atributes named wallShape#. And you can create your own walls or alter the old walls by imitating the code. After that,

非常经典的量子计算论文

本文件包括： 1、基本的微机保护算法仿真程序（m文件）。 2、电力系统简单故障matlab仿真线路(simulink文件)。 3、程序参考课本（pdf）。

机器学习算法文献

文章代码