找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Evolutionary Computation in Combinatorial Optimization; 12th European Confer Jin-Kao Hao,Martin Middendorf Conference proceedings 2012 Spri

[復(fù)制鏈接]
樓主: deferential
51#
發(fā)表于 2025-3-30 12:01:29 | 只看該作者
Intensification/Diversification-Driven ILS for a Graph Coloring Problem,This paper presents an extension of the ILS algorithm, called ., by introducing new local search devices that enforce an efficient tradeoff of intensification and diversification. Experiments performed on the DIMACS benchmarks show that our method is competitive with the best coloring algorithms.
52#
發(fā)表于 2025-3-30 16:07:15 | 只看該作者
53#
發(fā)表于 2025-3-30 19:37:29 | 只看該作者
Europe and the End of the Age of Innocencerine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the literature and its competitiveness is verified.
54#
發(fā)表于 2025-3-31 00:26:42 | 只看該作者
An ILS-Based Metaheuristic for the Stacker Crane Problem,ractical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented.
55#
發(fā)表于 2025-3-31 02:58:23 | 只看該作者
Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem,rine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the literature and its competitiveness is verified.
56#
發(fā)表于 2025-3-31 07:13:11 | 只看該作者
https://doi.org/10.1007/978-3-642-29124-1evolutionary algorithm; genetic algorithm; hyper-heuristic; multi-objective optimization; stochastic opt
57#
發(fā)表于 2025-3-31 12:16:02 | 只看該作者
58#
發(fā)表于 2025-3-31 13:28:40 | 只看該作者
59#
發(fā)表于 2025-3-31 20:23:50 | 只看該作者
60#
發(fā)表于 2025-4-1 01:18:59 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(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-26 18:39
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
吉隆县| 额敏县| 平远县| 株洲市| 桓台县| 彰武县| 荣昌县| 垦利县| 建宁县| 淳安县| 海口市| 甘孜县| 桐梓县| 阿坝县| 福建省| 临颍县| 延寿县| 盐池县| 尼玛县| 蓬溪县| 武山县| 宣恩县| 昆山市| 甘泉县| 佳木斯市| 延边| 资源县| 梨树县| 全南县| 孟津县| 集安市| 全州县| 双江| 定日县| 右玉县| 福海县| 务川| 昆山市| 河西区| 黄浦区| 钦州市|