找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Evolutionary Computation in Combinatorial Optimization; 9th European Confere Carlos Cotta,Peter Cowling Conference proceedings 2009 Springe

[復(fù)制鏈接]
樓主: Kennedy
51#
發(fā)表于 2025-3-30 09:57:01 | 只看該作者
52#
發(fā)表于 2025-3-30 15:34:58 | 只看該作者
Reflections on Multiculturalism,sed to perform nearly 155 CPU-days of experiments. The results show that the new methods can produce results fitter than rVNS methods and within 99% of the fitness of those produced by a highly CPU-intensive greedy hyperheuristic in a fraction of the time.
53#
發(fā)表于 2025-3-30 18:45:44 | 只看該作者
Milta Oyola Little D.O., C.M.D.local search and problem-dependent local searches. The experimental results for the standard benchmarks for the JSP demonstrate that the suggested GES is robust and highly competitive with the state-of-the-art metaheuristics for the JSP.
54#
發(fā)表于 2025-3-30 23:53:09 | 只看該作者
55#
發(fā)表于 2025-3-31 03:11:51 | 只看該作者
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse,local improvement procedure within VNS. Experimental results indicate that our method provides valuable pickup plans, whereas the computation times are kept low and several constraints typically stated by spare parts suppliers are fulfilled.
56#
發(fā)表于 2025-3-31 06:34:46 | 只看該作者
57#
發(fā)表于 2025-3-31 09:27:11 | 只看該作者
An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem,l results which revealed a link between predefined profit values of a mode assignment and its makespan. The impact of the algorithmic parameters and the initial population generation method is observed and detailed comparative computational results for the MRCPSP are presented.
58#
發(fā)表于 2025-3-31 13:24:37 | 只看該作者
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windownding information for differentiating between partial solutions. In this work we use stochastic sampling as an alternative to bounding information. Our results clearly demonstrate that the proposed algorithm is currently a state-of-the-art method for the tackled problem.
59#
發(fā)表于 2025-3-31 18:27:29 | 只看該作者
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics,sed to perform nearly 155 CPU-days of experiments. The results show that the new methods can produce results fitter than rVNS methods and within 99% of the fitness of those produced by a highly CPU-intensive greedy hyperheuristic in a fraction of the time.
60#
發(fā)表于 2025-4-1 01:25:32 | 只看該作者
Guided Ejection Search for the Job Shop Scheduling Problem,local search and problem-dependent local searches. The experimental results for the standard benchmarks for the JSP demonstrate that the suggested GES is robust and highly competitive with the state-of-the-art metaheuristics for the JSP.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 10:31
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
文昌市| 永定县| 高青县| 南和县| 东城区| 晋宁县| 无极县| 嘉定区| 乾安县| 桦川县| 句容市| 邯郸市| 凤冈县| 寿宁县| 河曲县| 略阳县| 山东省| 林芝县| 辽中县| 剑阁县| 乐清市| 灵宝市| 清涧县| 苗栗市| 浏阳市| 商洛市| 读书| 新昌县| 清远市| 瓮安县| 藁城市| 漳平市| 莒南县| 岳西县| 会泽县| 鄄城县| 繁昌县| 五常市| 玛曲县| 印江| 黔江区|