標題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 15th European Confer Gabriela Ochoa,Francisco Chicano Conference proceedings 2015 S [打印本頁] 作者: Randomized 時間: 2025-3-21 19:53
書目名稱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讀者反饋學科排名
作者: 灰姑娘 時間: 2025-3-21 21:41
https://doi.org/10.1007/978-3-0348-6047-5te cloud resource management and deployment processes, we propose an efficient Biased Random-Key Genetic Algorithm. The computational experiments over a benchmark suite generated based on real cloud market offerings indicate that the performance of our approach outperforms the approaches proposed in the literature.作者: 詞匯表 時間: 2025-3-22 01:36
Separation De Deux Ensembles Convexes,olution values obtained by state-of-the-art algorithms. We show experimentally that our proposed algorithm is effective on well-known benchmark instances available in the literature. It is also able to improve the best known solution of some benchmark instances.作者: consolidate 時間: 2025-3-22 06:48 作者: Lamina 時間: 2025-3-22 08:46
Masanori Sawa,Masatake Hirao,Sanpei Kageyama Previously it was shown that it runs in . on . when configured to use the randomized local search algorithm and the Q-learning algorithm with the greedy exploration strategy..We present the runtime analysis for the case when the .-EA algorithm is used. It is shown that the expected running time is at most ..作者: Oscillate 時間: 2025-3-22 16:32
Positive Semidefinite Matrices,ith 47 colors, DSJC1000.5 with 82 colors and flat1000_76_0 with 81 colors. The analysis performed in this work will allow to improve . efficiency in terms of computation time and maybe to decrease the number of needed colors for other graphs.作者: Oscillate 時間: 2025-3-22 19:10
Similarity on a Euclidean Plane (SIM),e algorithm..Obtained results confirm that the multipopulation approach works better than the decomposition approach in which a single specimen is assigned to each direction. Given less computational resources than the decomposition approach, the Sim-EA algorithm produces better results than a decomposition-based algorithm.作者: GRE 時間: 2025-3-23 00:41
A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem,te cloud resource management and deployment processes, we propose an efficient Biased Random-Key Genetic Algorithm. The computational experiments over a benchmark suite generated based on real cloud market offerings indicate that the performance of our approach outperforms the approaches proposed in the literature.作者: lymphoma 時間: 2025-3-23 01:47 作者: 諷刺 時間: 2025-3-23 05:53
Evolving Deep Recurrent Neural Networks Using Ant Colony Optimization, that it is easily parallizable and scalable, and can operate using any method for training neural networks. Further, the networks it evolves can typically be trained in fewer iterations than fully connected networks.作者: 突變 時間: 2025-3-23 13:15
Runtime Analysis of , Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration St Previously it was shown that it runs in . on . when configured to use the randomized local search algorithm and the Q-learning algorithm with the greedy exploration strategy..We present the runtime analysis for the case when the .-EA algorithm is used. It is shown that the expected running time is at most ..作者: 柔美流暢 時間: 2025-3-23 14:49 作者: Anemia 時間: 2025-3-23 21:10 作者: PHONE 時間: 2025-3-23 23:07
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem,-world ship trajectories. Notable improvements can be achieved. In addition, the number of (empty) lockages can be significantly reduced when taking them into account during optimization without loosing too much of quality in travel time optimization.作者: abysmal 時間: 2025-3-24 02:26
Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapwo initialisation methods are considered in?the algorithm: local search initialisation and greedy search initialisation. Then the solution quality of the algorithm is analysed in terms of the approximation ratio.作者: Oversee 時間: 2025-3-24 09:31
True Pareto Fronts for Multi-objective AI Planning Instances, obtained by varying the parameters of the generator. The experimental performances of an actual implementation of the exact solver are demonstrated, and some large instances with remarkable Pareto Front shapes are proposed, that will hopefully become standard benchmarks of the AI planning domain.作者: frozen-shoulder 時間: 2025-3-24 12:36 作者: 牽索 時間: 2025-3-24 17:50
https://doi.org/10.1007/978-3-319-54319-2 well as other methods for the standard set of medium-size problems taken from Beasley’s benchmark, but produces comparatively good results in terms of quality, runtime and memory footprint on our specific benchmark based on real Swedish data.作者: CLOT 時間: 2025-3-24 21:22
Kapitel 7: Hauptergebnisse der Untersuchung,improved variant of GC-AIS is compared with a well known multi-objective evolutionary algorithm NSGA-II on the multi-objective knapsack problem. We show that our improved GC-AIS performs better than NSGA-II on the instances of the knapsack problem taken from [.] inheriting the same benefits of having to set fewer parameters manually.作者: Collision 時間: 2025-3-25 00:00 作者: BUOY 時間: 2025-3-25 05:32 作者: Affiliation 時間: 2025-3-25 10:06
0302-9743 in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications..The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, application作者: 上腭 時間: 2025-3-25 14:01
Fundamental Theories of Physics-world ship trajectories. Notable improvements can be achieved. In addition, the number of (empty) lockages can be significantly reduced when taking them into account during optimization without loosing too much of quality in travel time optimization.作者: 急性 時間: 2025-3-25 17:42
https://doi.org/10.1007/BFb0080456wo initialisation methods are considered in?the algorithm: local search initialisation and greedy search initialisation. Then the solution quality of the algorithm is analysed in terms of the approximation ratio.作者: optional 時間: 2025-3-25 23:41 作者: 固定某物 時間: 2025-3-26 02:00 作者: 平息 時間: 2025-3-26 04:31 作者: Cuisine 時間: 2025-3-26 09:59
On the Complexity of Searching the Linear Ordering Problem Neighborhoods,. – after an initialization in .. We also consider an alternative neighborhood named the interchange neighborhood. We show that this neighborhood can be searched in . – versus . in the best existing implementation.作者: 暫時中止 時間: 2025-3-26 14:15 作者: 暫停,間歇 時間: 2025-3-26 19:32 作者: CRASS 時間: 2025-3-26 23:56
Ettore Majorana,Massimo Inguscioal is to deploy a given number of firefighters on strategic points at each time step to contain the fire in a most efficient way, so that as many areas are saved from the fire as possible. In this paper we introduce a new solution representation for the FFP which can be applied in metaheuristic appr作者: 洞察力 時間: 2025-3-27 01:11 作者: 開頭 時間: 2025-3-27 07:31
Fundamental Theories of Physicsng problem, in which the nodes are partitioned into clusters, and the vehicle routing problem with stochastic demands, where the exact demands of the nodes are not known beforehand. It is an NP-hard problem for which we propose a variable neighborhood search (VNS) approach to minimize the expected t作者: breadth 時間: 2025-3-27 12:40
Separation De Deux Ensembles Convexes,times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, which is based on several . operations, such as ., .,作者: adhesive 時間: 2025-3-27 15:44
https://doi.org/10.1007/BFb0080456tion. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in?the algorithm: local search initialisation and greedy search initialisation. Then the solution quality of 作者: 混合,攙雜 時間: 2025-3-27 18:28 作者: 外來 時間: 2025-3-27 23:19 作者: BET 時間: 2025-3-28 04:51
Kapitel 7: Hauptergebnisse der Untersuchung,arameters to be set by hand. The population of solutions in GC-AIS is dynamic in nature and has no restrictions on its size which can cause problems of population explosion, where the population keeps growing very rapidly, leading to wasteful fitness evaluations. In this paper we try to address this作者: 大看臺 時間: 2025-3-28 09:36 作者: Emg827 時間: 2025-3-28 11:33 作者: vertebrate 時間: 2025-3-28 15:07 作者: fatty-streak 時間: 2025-3-28 19:32
Positive Semidefinite Matrices,very specific population of individuals. Indeed, the main characteristic of . is to work with a population of only two individuals. This provides a very simple algorithm with neither selection operator nor replacement strategy. Because of its simplicity, . allows an easy way for managing the diversi作者: hematuria 時間: 2025-3-28 23:16
Similarity on a Euclidean Plane (SIM),f epidemics. Recently, this problem gained interest from the softcomputing research community and papers were published on applications of ant colony optimization and evolutionary algorithms to this problem. Also, the multiobjective version of the problem was formulated..In this paper a multipopulat作者: 污穢 時間: 2025-3-29 03:36
Schwinger-DeWitt Asymptotic Expansioncific solver that provably computes the true Pareto Front of the resulting instances. A wide range of Pareto Front shapes of various difficulty can be obtained by varying the parameters of the generator. The experimental performances of an actual implementation of the exact solver are demonstrated, 作者: BUCK 時間: 2025-3-29 07:50 作者: Hiatus 時間: 2025-3-29 11:56 作者: resuscitation 時間: 2025-3-29 15:40 作者: ARM 時間: 2025-3-29 23:25
Glue-Laminated Timber from, spp.,Mixing Network Extremal Optimization is a new algorithm designed to identify the community structure in networks by using a game theoretic approach and a network mixing mechanism as a diversity preserving method. Numerical experiments performed on synthetic and real networks illustrate the potential of the approach.作者: 毀壞 時間: 2025-3-30 00:58
Mixing Network Extremal Optimization for Community Structure Detection,Mixing Network Extremal Optimization is a new algorithm designed to identify the community structure in networks by using a game theoretic approach and a network mixing mechanism as a diversity preserving method. Numerical experiments performed on synthetic and real networks illustrate the potential of the approach.作者: exostosis 時間: 2025-3-30 04:13 作者: 千篇一律 時間: 2025-3-30 08:32 作者: ANTI 時間: 2025-3-30 15:39 作者: companion 時間: 2025-3-30 20:15
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317880.jpg作者: corporate 時間: 2025-3-30 21:57 作者: 策略 時間: 2025-3-31 00:57 作者: Thrombolysis 時間: 2025-3-31 07:51 作者: 向前變橢圓 時間: 2025-3-31 10:42
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem,iver in order to minimize the overall ship travel times. In computational experiments the performance of our approach is assessed and compared to real-world ship trajectories. Notable improvements can be achieved. In addition, the number of (empty) lockages can be significantly reduced when taking t作者: Audiometry 時間: 2025-3-31 13:20
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands,ng problem, in which the nodes are partitioned into clusters, and the vehicle routing problem with stochastic demands, where the exact demands of the nodes are not known beforehand. It is an NP-hard problem for which we propose a variable neighborhood search (VNS) approach to minimize the expected t作者: NICE 時間: 2025-3-31 20:00
An Iterated Local Search Algorithm for Solving the Orienteering Problem with Time Windows,times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, which is based on several . operations, such as ., .,作者: 藝術 時間: 2025-3-31 23:18 作者: Femine 時間: 2025-4-1 05:20 作者: disrupt 時間: 2025-4-1 06:47 作者: macrophage 時間: 2025-4-1 13:57 作者: 冷漠 時間: 2025-4-1 17:17 作者: albuminuria 時間: 2025-4-1 20:41 作者: 燒瓶 時間: 2025-4-2 01:41
