搜索资源列表
METSlib
- METSlib提供基本的启发式算法框架,包括局部搜索及其变体,模拟退火和禁忌搜索等。 -METSlib implements the basics of some metaheuristics algorithm: * Random Restart Local Search * Variable Neighborhood Search * Iterated Local Search * Simulated Annealing (with line
Ant-Colony-Optimisation-for-vehicle-routing-probl
- Ant Colony Optimisation for vehicle routing problems: from theory to applications. Keywords: Metaheuristics, Ant Colony Optimisation, Vehicle Routing Problem.
metaheuristics-algo-Monkey-search
- implementation of the Monkey search optimization algorithme
generateQ
- what i present there is part of the source code to solve problems with metaheuristics like tabu search, simulated annealing,genetic algorithms, etc
DE
- In computer science, differential evolution (DE) is a method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Such methods are commonly known as metaheuristics as they make few
ant-colony-optimization
- Large-scale problems are nonlinear problems that need metaheuristics, or global optimization algorithms. This paper reviews nature-inspired metaheuristics, then it introduces a framework named Competitive Ant Colony Optimization inspired by the chemi
jMetal-master
- jmetal5.0The jMetal project started in 2006 as the result of our need of having a easy to use, flexible, extensible and portable multi-objective optimization framework with metaheuristics.-Document which describes to Nondominated Sorting Genetic Algo
Metaheuristics-for-the-vrp
- Metaheuristics for the VRP with pick-up and deliver. This problem was solved using 5 metaheuristics which are detailed in the WinRAR file.
ant-colony-optimization
- 蚁群优化是一组概率性元启发式算法和智能优化算法,受蚂蚁社会行为的启发。(Ant Colony Optimization (ACO) are a set of probabilistic metaheuristics and an intelligent optimization algorithms, inspired by social behavior of ants.)