搜索结果: 1-4 共查到“计算机科学技术 Simulated Annealing”相关记录4条 . 查询时间(0.063 秒)
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...
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...