以重排九宫问题/八数码问题为例，以启发式搜索方法求解给定初始状态和目标状态的最优搜索路径

启发式算法设计与实现 ISBN: 978-0-470-27858-1 Hardcover 624 pages June 2009 This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.

a*启发式搜索算法的matlab仿真程序

物流网络选址与路径优化问题的模型与启发式解法

八数码问题是人工智能经典难题之一。问题是在3×3 方格盘上，放有八个数码，剩下一个为空，每一空格其上下左右的数码可移至空格。问题给定初始位置和目标位置，要求通过一系列的数码移动，将初始位置转化为目标位置。本文介绍用A星算法，采用估计值h（n）（曼哈顿距离）和g(m)(当前深度)的和作为估计函数。

有一条河，河的左岸有m个传教士(Missionary)和m个野人(Cannibal)，和一艘最多可乘n人的小船。约定左岸，右岸和船上或者没有传教士，或者野人数量少于传教士，否则野人会把传教士吃掉。 C语言实现A*算法！

文件夹包含一些流水车间作业调度算法，启发式算法有cds,johnson,neh,palmer,ra,neh,moore等，智能算法有遗传算法，还包含绘制甘特图、生成测试数据的代码等。

进阶生产规划及排程系统　便是利用先进的信息科技及规划技术，例如基因算法﹝Genetic Algorithm﹞、限制理论﹝Theory of Constraints﹞、作业分析 ﹝Operations Research﹞、 生产仿真﹝Simulation﹞及限制条件满足技术﹝Constraint Satisfaction Technique﹞等，在考虑企业资源﹝主要为物料与产能﹞限制条件与生产现场的控制与派工法则下，规划可行的物 料需求计划与生产排程计划，以满足顾客需求及面对竞争激烈的市场。进阶生产规划及排程亦提供了what-if 的分析，可以让规划者快速结合生产信息﹝如订单、途程、存货、BOM与产能限 制等﹞，作出平衡企业利益与顾客权益的最佳规划和决策。

人工智能 八数码问题 A*算法 智能搜索 用人工智能的A*算法解决八数码的问题

C语言写的八数码搜索过程，有源代码+运行结果截图