標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 17th European Confer Bin Hu,Manuel López-Ibá?ez Conference proceedings 2017 Springe [打印本頁(yè)] 作者: Stubborn 時(shí)間: 2025-3-21 16:05
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization影響因子(影響力)
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization被引頻次
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization被引頻次學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization年度引用
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization年度引用學(xué)科排名
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization讀者反饋
書(shū)目名稱(chēng)Evolutionary Computation in Combinatorial Optimization讀者反饋學(xué)科排名
作者: Habituate 時(shí)間: 2025-3-21 23:15
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作者: 心痛 時(shí)間: 2025-3-22 02:36 作者: conjunctiva 時(shí)間: 2025-3-22 06:14
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作者: 拒絕 時(shí)間: 2025-3-22 09:07 作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-22 14:42 作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-22 17:52 作者: 破裂 時(shí)間: 2025-3-23 00:05 作者: Mediocre 時(shí)間: 2025-3-23 04:17
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作者: SLAY 時(shí)間: 2025-3-23 07:55 作者: 少量 時(shí)間: 2025-3-23 12:59 作者: 安撫 時(shí)間: 2025-3-23 13:53 作者: AVERT 時(shí)間: 2025-3-23 19:08 作者: conception 時(shí)間: 2025-3-23 23:33 作者: 我要威脅 時(shí)間: 2025-3-24 04:33 作者: 離開(kāi)就切除 時(shí)間: 2025-3-24 09:55
Understanding Phase Transitions with Local Optima Networks: Number Partitioning as a Case Study,d a clear link between fitness landscape properties and the phase transition. We explore whether the global landscape structure of the number partitioning problem changes with the phase transition. Using the local optima network model, we analyse a number of instances before, during, and after the p作者: 不可侵犯 時(shí)間: 2025-3-24 12:10 作者: MULTI 時(shí)間: 2025-3-24 18:02
Evolutionary Computation in Combinatorial Optimization978-3-319-55453-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 有權(quán) 時(shí)間: 2025-3-24 21:04
https://doi.org/10.1007/978-3-319-55453-2combinatorial optimization; discrete space search; evolutionary algorithms; metaheuristics; particle swa作者: 谷物 時(shí)間: 2025-3-25 01:20
Bin Hu,Manuel López-Ibá?ezIncludes supplementary material: 作者: In-Situ 時(shí)間: 2025-3-25 05:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317876.jpg作者: 消散 時(shí)間: 2025-3-25 10:16
https://doi.org/10.1007/978-3-319-65563-5shop scheduling problems with other objectives such as the minimization of the weighted or unweighted tardiness, the number of late jobs, or the sum of the jobs’ completion times have been considered. However, the problems under the latter objectives have been generally less studied than makespan. I作者: discord 時(shí)間: 2025-3-25 15:18 作者: 缺陷 時(shí)間: 2025-3-25 15:54
Tom Vine,Jessica Clark,David Weiring all features. This paper presents the first study on Large Neighborhood Search (LNS) algorithm for the feature selection problem. We propose a novel hybrid Wrapper and Filter feature selection method using LNS algorithm (WFLNS). In LNS, an initial solution is gradually improved by alternately de作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-25 20:08
Ethnographic Study of Marine Conservationions 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作者: LEERY 時(shí)間: 2025-3-26 02:18 作者: 要求比…更好 時(shí)間: 2025-3-26 05:16 作者: Aggregate 時(shí)間: 2025-3-26 09:14 作者: intrude 時(shí)間: 2025-3-26 13:00 作者: 可行 時(shí)間: 2025-3-26 17:04
Joanna Reynolds,Sarah Milton,Emma Garnett 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作者: 不能平靜 時(shí)間: 2025-3-26 21:23
https://doi.org/10.1007/978-3-319-53097-0. A comparative study is performed to assess the performance of different Beam Search algorithms at tackling the combinatorial problem of finding the ideal sequence of bodies. Special focus is placed on the development of a new hybridization between Beam Search and the Population-based Ant Colony Op作者: MELD 時(shí)間: 2025-3-27 03:02 作者: 詞匯記憶方法 時(shí)間: 2025-3-27 06:31 作者: 巨碩 時(shí)間: 2025-3-27 10:25 作者: resuscitation 時(shí)間: 2025-3-27 13:37 作者: Eviction 時(shí)間: 2025-3-27 18:44 作者: 使糾纏 時(shí)間: 2025-3-28 00:30 作者: MAIM 時(shí)間: 2025-3-28 04:04 作者: 流逝 時(shí)間: 2025-3-28 09:30 作者: neoplasm 時(shí)間: 2025-3-28 13:02
https://doi.org/10.1007/978-94-007-6916-8e instances into thousands of connected components. This decomposition serves as a key stepping stone for applying the powerful recombination operator, partition crossover, to the SAT domain. Moreover, we establish a priori analysis for identifying problem instances with potential decomposability us作者: mitral-valve 時(shí)間: 2025-3-28 15:08 作者: Endemic 時(shí)間: 2025-3-28 20:11 作者: subacute 時(shí)間: 2025-3-28 23:47 作者: CROW 時(shí)間: 2025-3-29 04:47 作者: 裂隙 時(shí)間: 2025-3-29 10:14 作者: 有幫助 時(shí)間: 2025-3-29 14:53 作者: Mortal 時(shí)間: 2025-3-29 16:49 作者: wall-stress 時(shí)間: 2025-3-29 22:44
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting andered candidate route: What are optimal times for the individual visits of objects that minimize the overall penalty for time window violations? We call this .. In this paper, we investigate this subproblem in particular and first give an exact solution approach based on .. As this method is quite ti作者: 我悲傷 時(shí)間: 2025-3-30 03:20 作者: Foreshadow 時(shí)間: 2025-3-30 07:23
Optimizing Charging Station Locations for Electric Car-Sharing Systems,orithm is evaluated on a set of benchmark instances which are based on real-world data from Vienna, Austria using a demand model derived from taxi data of about 3500 taxis operating in Vienna. Computational tests show that for smaller instances the algorithm is able to find near optimal solutions an作者: averse 時(shí)間: 2025-3-30 12:00 作者: 專(zhuān)橫 時(shí)間: 2025-3-30 16:20
Conference proceedings 2017d 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作者: Seizure 時(shí)間: 2025-3-30 19:23
Tom Vine,Jessica Clark,David Weirn based feature ranking method. The proposed algorithm has been tested on twelve benchmark data sets and the results have been compared with ten most recent wrapper methods where WFLNS outperforms other methods in several the data sets.作者: anagen 時(shí)間: 2025-3-31 00:38 作者: 集合 時(shí)間: 2025-3-31 02:57
