搜索结果: 1-5 共查到“计算机科学技术 Annealing”相关记录5条 . 查询时间(0.062 秒)
mulated annealing is a computational heuristic for obtaining approximate solutions to combinatorial optimization problems. It is used to construct good source codes, error-correcting codes, and spheri...
Simulated Annealing Algorithm to Minimize Makespanin Single Machine Scheduling Problem withUniform Parallel Machines
Uniform Parallel Machines Measure of Performance Heuristic Simulated Annealing Algorithm ANOVA
2013/1/28
This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform paralle...
Design and Comparison of Simulated Annealing Algorithm and GRASP to Minimize Makespan in Single Machine Scheduling with Unrelated Parallel Machines
Makespan Simulated Annealing Algorithm GRASP Unrelated Parallel Machines Mathematical Model
2013/1/29
This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independen...
基于不可行度的机压树状管网退火遗传算法优化（Optimization of Pumping Tree Pipe Network by Using Annealing-genetic Algorithms Based on Infeasible Degree）
树状管网 遗传算法 模拟退火
2009/9/25
规定管网中每一管段最多只能由两种管径的管道组成，提出一种以管网年费用为目标函数，以水泵扬程、管长和标准管径为决策变量的机压树状输水管网优化数学模型。定义种群中个体的不可行度函数，采用基于解的不可行度退火算法处理约束条件。应用模拟退火算法，对解的不可行度进行局部优化，使其逐步逼近可行解。将遗传算法全局优化和模拟退火的良好局部搜索能力有机结合，构造出一种退火遗传算法用于机压树状管网优化设计。仿真结果表...
A Genetic and Simulated Annealing Based Algorithms for Solving the Flow Assignment Problem in Computer Networks
Genetic Algorithms Flow Assignment Routing Computer network
2010/2/2
Selecting the routes and the assignment of link flow
in a computer communication networks are extremely complex
combinatorial optimization problems. Metaheuristics, such as genetic
or simulated ann...