Welcome![Sign In][Sign Up]
Location:
Search - METAHEURISTIC

Search list

[Other resourceSFProgWed

Description: The concept of Adaptive Memory coupled with advances in neighborhood structures derived from dynamic and adaptive search constructions have been the source of numerous important developments in metaheuristic optimization throughout the last decade.
Platform: | Size: 346823 | Author: 郑林 | Hits:

[Other resourceACO

Description: 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。
Platform: | Size: 236255 | Author: wangliang | Hits:

[OtherSFProgWed

Description: The concept of Adaptive Memory coupled with advances in neighborhood structures derived from dynamic and adaptive search constructions have been the source of numerous important developments in metaheuristic optimization throughout the last decade.
Platform: | Size: 346112 | Author: 郑林 | Hits:

[AI-NN-PRACO

Description: 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 -Ant colony optimization algorithm is a metaheuristic based on natural-inspired algorithms, from their proposed up to now after 10 years of development to the present has become a kind of combinatorial optimization problems to solve an effective tool. Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.
Platform: | Size: 236544 | Author: wangliang | Hits:

[Otherant.wsn

Description: Wireless Sensor Networks are wireless networks where every nodes recolects surrounding information. WSNs have several aplications such as militar survival, traffic control, building security, scientific research in other planets, etc. This project presents a communication protocol for wireless sensor networks based on the ant colony optimization metaheuristic, which uses artificial ant agents that recolects data from all sensor nodes of the network. Every ants fuzes data from a node and sends it to every other sensor and then to the base station. All ants look for a way to go where there is an energy eficient path.
Platform: | Size: 60416 | Author: rodrigo | Hits:

[matlabMetaheuristic

Description: M e t a h e u r i s t i c 算法的实例,-M etaheuristic algorithm instance,
Platform: | Size: 1024 | Author: wgl | Hits:

[OtherAntNet

Description: AntNet is an Ant Colony Optimization (ACO) metaheuristic for data network routing proposed by Gianni Di Caro and Marco Dorigo ( http://www.idsia.ch/~gianni/antnet.html ). We have implemented AntNet on network simulator, NS2. This manual describes how to modify NS2 and install our code to simulate and experiment with AntNet algorithm created by Lavina Jain. We have tested our simulations on ns-2.33.
Platform: | Size: 103424 | Author: zipzap | Hits:

[matlabsimAnealing

Description: Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.
Platform: | Size: 7168 | Author: massumeh | Hits:

[matlabTSP_2OPT_Greedy

Description: 2opt metaheuristic algorithm greedy
Platform: | Size: 1024 | Author: saman | Hits:

[AlgorithmSimulatedAnnealing

Description: Simmulated annealing is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space.
Platform: | Size: 26624 | Author: monica1987is | Hits:

[Successful incentiveA_Survey_Animal-Inspired_Metaheuristic_Algorithms

Description: Metaheuristic Monkey search
Platform: | Size: 143360 | Author: destroy | Hits:

[Data structsgecco09

Description: Metaheuristic Monkey search algorithm
Platform: | Size: 189440 | Author: destroy | Hits:

[AI-NN-PRMATLAB

Description: 遗传算法(Genetic Algorithm)是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型,是一种通过模拟自然进化过程搜索最优解的方法,它最初由美国Michigan大学J.Holland教授于1975年首先提出来的,并出版了颇有影响的专著《Adaptation in Natural and Artificial Systems》,GA这个名称才逐渐为人所知,J.Holland教授所提出的GA通常为简单遗传算法(SGA)。 -In artificial intelligence, an evolutionary algorithm (EA) is a subset of evolutionary computation, a generic population-based metaheuristic optimization algorithm. An EA uses some mechanisms inspired by biological evolution: reproduction, mutation, recombination, and selection. Candidate solutions to the optimization problem play the role of individuals in a population, and the fitness function determines the environment within which the solutions "live" (see also cost function). Evolution of the population then takes place after the repeated application of the above operators. Artificial evolution (AE) describes a process involving individual evolutionary algorithms EAs are individual components that participate in an AE.
Platform: | Size: 47104 | Author: 李际超 | Hits:

[Data structsBook-Essentials-of-Metaheuristic

Description: 计算机科学的两大基础目标,就是发现可证明其执行效率良好且可得最佳解或次佳解的算法。而启发式算法则试图一次提供一或全部目标。 例如它常能发现很不错的解,但也没办法证明它不会得到较坏的解;它通常可在合理时间解出答案,但也没办法知道它是否每次都可以这样的速度求解。-Book-Essentials of Metaheuristic
Platform: | Size: 4388864 | Author: 王登华 | Hits:

[ToolBarPSO

Description: Here is a very simple version of PSO in Matlab. PSO is a very popular, population based metaheuristic algorithm that mimics swarming behavior/intelligence in order to solve optimization problems.
Platform: | Size: 2048 | Author: ehsan | Hits:

[Software Engineeringfitnessfun

Description: a novel fitness function for utilization for images segmentation using a metaheuristic method (GA, pso, sfla, aco...)
Platform: | Size: 161792 | Author: harouni | Hits:

[Program docManuscript-Journal-of-Flow-Visualization-and-Imag

Description: a manuscript that describes a novel method of benchmark and medical images segmentation using MSFLA metaheuristic
Platform: | Size: 361472 | Author: harouni | Hits:

[Program docSVMPSFLA-communication-1

Description: manuscript which describes a support vector machines svm optimization with SFLA metaheuristic GLCM
Platform: | Size: 225280 | Author: harouni | Hits:

[matlabA-Comparative-Study-of-Metaheuristic-Methods-for-

Description: A Comparative Study of Metaheuristic Methods for Transmission Network Expansion Planning
Platform: | Size: 153600 | Author: ali | Hits:

[OtherA-parallel-bi-objective-hybrid-metaheuristic-for-

Description: A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for
Platform: | Size: 606208 | Author: Nitromira | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net