找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 13746|回復(fù): 64
樓主
發(fā)表于 2025-3-21 20:05:42 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Evolutionary Computation in Combinatorial Optimization
副標(biāo)題12th European Confer
編輯Jin-Kao Hao,Martin Middendorf
視頻videohttp://file.papertrans.cn/318/317886/317886.mp4
概述State-of-the-art research.Fast-track conference proceedings.Unique visibility
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Evolutionary Computation in Combinatorial Optimization; 12th European Confer Jin-Kao Hao,Martin Middendorf Conference proceedings 2012 Spri
描述This book constitutes the refereed proceedings of the 12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2012, held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. . The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.
出版日期Conference proceedings 2012
關(guān)鍵詞evolutionary algorithm; genetic algorithm; hyper-heuristic; multi-objective optimization; stochastic opt
版次1
doihttps://doi.org/10.1007/978-3-642-29124-1
isbn_softcover978-3-642-29123-4
isbn_ebook978-3-642-29124-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)




書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學(xué)科排名




書目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開度




書目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次




書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次學(xué)科排名




書目名稱Evolutionary Computation in Combinatorial Optimization年度引用




書目名稱Evolutionary Computation in Combinatorial Optimization年度引用學(xué)科排名




書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋




書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 20:29:00 | 只看該作者
Conference proceedings 2012 held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. . The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers present the latest research and discuss current developments and appl
板凳
發(fā)表于 2025-3-22 01:24:47 | 只看該作者
Henryk Kierzkowski (Professor of Economics)ent processors. In this paper, we present a proposal for such a methodology, as well as an example of its use applied to two well-known algorithms (Genetic Algorithms and Simulated Annealing) and solving the MAXSAT problem.
地板
發(fā)表于 2025-3-22 04:33:18 | 只看該作者
5#
發(fā)表于 2025-3-22 10:08:23 | 只看該作者
https://doi.org/10.1007/978-3-030-54541-3arch space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method.
6#
發(fā)表于 2025-3-22 13:30:23 | 只看該作者
The Future of Europe in Prisons,tuned using the design of experiments. The influence of the number of Pareto fronts is studied experimentally. Finally GAME’s performance is assessed and compared with three other algorithms according to the conditions of the CEC?2009 competition.
7#
發(fā)表于 2025-3-22 18:07:25 | 只看該作者
8#
發(fā)表于 2025-3-22 22:53:10 | 只看該作者
A Methodology for Comparing the Execution Time of Metaheuristics Running on Different Hardware,ent processors. In this paper, we present a proposal for such a methodology, as well as an example of its use applied to two well-known algorithms (Genetic Algorithms and Simulated Annealing) and solving the MAXSAT problem.
9#
發(fā)表于 2025-3-23 04:47:13 | 只看該作者
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveriesis proposed. A new method based on branch and bound optimisation attempts to optimise the final ordering of requests in routes to further improve the solutions. Results are analysed for a standard set of benchmark instances and are shown to be competitive with the state of the art.
10#
發(fā)表于 2025-3-23 05:56:09 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-26 21:49
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
西和县| 宜城市| 榆林市| 天长市| 亚东县| 余干县| 拜泉县| 花莲县| 茌平县| 称多县| 高碑店市| 松桃| 如东县| 郁南县| 二连浩特市| 遂溪县| 曲水县| 民乐县| 沁源县| 阜平县| 沈阳市| 乾安县| 柳林县| 漠河县| 神池县| 历史| 花垣县| 柳江县| 巴马| 宽甸| 阿荣旗| 栖霞市| 东丰县| 内黄县| 集贤县| 沂水县| 鄂温| 西丰县| 海南省| 江陵县| 彩票|