找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Evolutionary Computation in Combinatorial Optimization; 17th European Confer Bin Hu,Manuel López-Ibá?ez Conference proceedings 2017 Springe

[復制鏈接]
查看: 21652|回復: 54
樓主
發(fā)表于 2025-3-21 16:05:12 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Evolutionary Computation in Combinatorial Optimization
副標題17th European Confer
編輯Bin Hu,Manuel López-Ibá?ez
視頻videohttp://file.papertrans.cn/318/317876/317876.mp4
概述Includes supplementary material:
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Evolutionary Computation in Combinatorial Optimization; 17th European Confer Bin Hu,Manuel López-Ibá?ez Conference proceedings 2017 Springe
描述This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications..The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial opti
出版日期Conference proceedings 2017
關鍵詞combinatorial optimization; discrete space search; evolutionary algorithms; metaheuristics; particle swa
版次1
doihttps://doi.org/10.1007/978-3-319-55453-2
isbn_softcover978-3-319-55452-5
isbn_ebook978-3-319-55453-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing AG 2017
The information of publication is updating

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




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




書目名稱Evolutionary Computation in Combinatorial Optimization網絡公開度




書目名稱Evolutionary Computation in Combinatorial Optimization網絡公開度學科排名




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




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




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




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




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




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




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 23:15:28 | 只看該作者
A Genetic Algorithm for Multi-component Optimization Problems: The Case of the Travelling Thief Pronce are not a good choice to assess algorithm performance. In recent literature, a benchmark problem called Travelling Thief Problem (TTP) was proposed to better represent real-world multi-component problems. TTP is a combination of two well-known problems: 0-1 Knapsack Problem (KP) and the Travelli
板凳
發(fā)表于 2025-3-22 02:36:15 | 只看該作者
地板
發(fā)表于 2025-3-22 06:14:42 | 只看該作者
A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling,ions usually operate in a stochastic environment and are confronted with unexpected events in the short term. These unexpected events affect the workability of the personnel roster and need to be resolved efficiently and effectively. To facilitate this short-term recovery, it is important to conside
5#
發(fā)表于 2025-3-22 09:07:42 | 只看該作者
6#
發(fā)表于 2025-3-22 14:42:35 | 只看該作者
7#
發(fā)表于 2025-3-22 17:52:23 | 只看該作者
8#
發(fā)表于 2025-3-23 00:05:54 | 只看該作者
9#
發(fā)表于 2025-3-23 04:17:35 | 只看該作者
LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows, of homogeneous trucks. Its main objective is to minimize the number of vehicles, and the secondary objective is to minimize the distance traveled during the service. In this paper, we propose the longest common subsequence based selective route exchange crossover (LCS-SREX), and apply this operator
10#
發(fā)表于 2025-3-23 07:55:10 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-7 02:43
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
客服| 玉田县| 炎陵县| 绥阳县| 娱乐| 荆州市| 广宗县| 中山市| 新丰县| 尼勒克县| 鄢陵县| 温宿县| 慈利县| 十堰市| 贵阳市| 白朗县| 囊谦县| 城市| 陵川县| 滨海县| 鄂州市| 红安县| 盐山县| 个旧市| 西充县| 襄城县| 廊坊市| 武隆县| 封开县| 新巴尔虎右旗| 禹城市| 姜堰市| 宣威市| 黑龙江省| 墨竹工卡县| 新巴尔虎右旗| 中牟县| 微山县| 越西县| 娱乐| 文成县|