To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( hmb ) , an intelligent virtual design method was proposed with combining modern intelligent optimization methods with virtual design technology 摘要为解决液压集成块设计中外部布局和内部布孔集成的组合优化问题,提出了一种融合现代智能优化方法和虚拟设计技术的智能虚拟设计方法。
Ant colony algorithm is a novel simulated evolutionary algorithm , which is used to solve the optimization problems through simulating the way of ants finding the shortest path for food . this algorithm has been applied successfully to combinatorial optimization problems such as traveling salesman problem 蚁群算法是一种新型的模拟进化算法,它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题,目前在旅行商问题等组合优化问题中有成功的应用。
In recent years , the theory and algorithm for semidefinite programming have developed greatly , and its most important applications are found in combinatorial optimization , system engineering and electrical engineering . semidefinite programming is a new and important research field in mathematical programming 近年来其理论和算法取得了很大的进展,并且在组合优化、系统工程和电子工程等领域得到广泛的应用,已经成为数学规划领域中一个新的活跃的研究方向
Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs . the theory of scheduling has become a very important subject after half a century ' s development , and its application is very extensive 排序问题是一类重要的组合优化问题,它是利用一些处理机、机器或资源最优的完成一批给定的任务或作业,经过近半个世纪的努力,排序理论已经发展成一门相当重要的学科,并且应用非常广泛。
Traveling salesman problem is combinatorial optimization problem in graph theory , it has npc computation complexity , and lots of problem can transfer to traveling salesman problem . the computation of tsp is analyzed , then the hopfield network method for solving tsp is given , at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling 首先分析了旅行商问题在穷举搜索法下的工作量;其次给出了求解旅行商问题的hopfield神经网络方法,同时分析了利用人工神经网络求解旅行商问题所存在的问题;最后利用混饨神经网络模型求解10城市旅行商问题和中国旅行商问题。
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.Schrijver, p.