业余爱好者 发表于 2025-3-26 21:07:12

Evolutionary Computation in Combinatorial Optimization978-3-642-20364-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

maroon 发表于 2025-3-27 01:40:12

https://doi.org/10.1057/9780333981733tions, and two local search schemes to enhance its performance for the MOUCTP. The experimental results based on a set of test problems show that the proposed algorithm is efficient for solving the MOUCTP.

guzzle 发表于 2025-3-27 07:15:39

http://reply.papertrans.cn/32/3179/317890/317890_33.png

heartburn 发表于 2025-3-27 11:41:25

http://reply.papertrans.cn/32/3179/317890/317890_34.png

GROUP 发表于 2025-3-27 16:21:09

http://reply.papertrans.cn/32/3179/317890/317890_35.png

EXALT 发表于 2025-3-27 19:18:12

Tom Dyson,Theodore Konstadinidesocess. This paper presents a new methodology to design and implement efficiently GPU-based multiobjective local search algorithms. The experimental results show that the approach is promising especially for large problem instances.

珊瑚 发表于 2025-3-27 22:20:07

http://reply.papertrans.cn/32/3179/317890/317890_37.png

Sleep-Paralysis 发表于 2025-3-28 02:31:57

http://reply.papertrans.cn/32/3179/317890/317890_38.png

暂时别动 发表于 2025-3-28 06:45:55

http://reply.papertrans.cn/32/3179/317890/317890_39.png

trigger 发表于 2025-3-28 14:26:06

Experiments in Parallel Constraint-Based Local Search, manner, that is, each process is an independent search engine and there is no communication between the simultaneous computations. Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.
页: 1 2 3 [4] 5 6 7
查看完整版本: Titlebook: Evolutionary Computation in Combinatorial Optimization; 11th European Confer Peter Merz,Jin-Kao Hao Conference proceedings 2011 Springer Be