標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 11th European Confer Peter Merz,Jin-Kao Hao Conference proceedings 2011 Springer Be [打印本頁(yè)] 作者: 粗略 時(shí)間: 2025-3-21 16:08
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學(xué)科排名
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization被引頻次
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization被引頻次學(xué)科排名
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization年度引用
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization年度引用學(xué)科排名
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋
書(shū)目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋學(xué)科排名
作者: 共同時(shí)代 時(shí)間: 2025-3-21 23:11
Roberto Cavallo Perin,Gabriella M. Raccaution. Different diversification strategies and feasibility search rules are proposed. We present computational results on a wide set of instances up to 50 customers and 5 satellites and compare them with results from the literature, showing how the new methods outperform previous existent methods, 作者: 畸形 時(shí)間: 2025-3-22 02:52
Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem,ution. Different diversification strategies and feasibility search rules are proposed. We present computational results on a wide set of instances up to 50 customers and 5 satellites and compare them with results from the literature, showing how the new methods outperform previous existent methods, 作者: aneurysm 時(shí)間: 2025-3-22 08:25
Evolutionary Computation in Combinatorial Optimization11th European Confer作者: 兩棲動(dòng)物 時(shí)間: 2025-3-22 09:51 作者: 白楊 時(shí)間: 2025-3-22 13:51 作者: 白楊 時(shí)間: 2025-3-22 21:03
https://doi.org/10.1057/9780333981733metabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previous good solutions to guide the generation of new solu作者: CHIP 時(shí)間: 2025-3-23 00:09
Documentation and Bibliography, objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem specific characteristics into account can be seen as作者: 相信 時(shí)間: 2025-3-23 03:31 作者: 該得 時(shí)間: 2025-3-23 07:21
https://doi.org/10.1007/978-94-009-7371-8ective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with .(..) variables and .(.) constraints.作者: expeditious 時(shí)間: 2025-3-23 11:08
E. Millich,J. P. Joulia,D. Van Asseltpsack problem. A local search algorithm that explores this property is then proposed and its performance is compared against exact algorithms in terms of running time and number of optimal solutions found. The experimental results indicate that this simple local search algorithm is able to find a re作者: 一罵死割除 時(shí)間: 2025-3-23 14:23 作者: 鄙視讀作 時(shí)間: 2025-3-23 21:04
Data Retention in the Czech Republicatic programming (UBQP) problem as a case study. In particular, we provide insights as to why one particular variable fixing and scoring strategy leads to better computational results than another one. For this purpose, we perform two investigations, the first analyzing deviations from the best know作者: 秘方藥 時(shí)間: 2025-3-24 00:05
https://doi.org/10.1007/978-94-017-1484-6ducing the environmental pollution. In this work, we present an evolutionary multiobjective route planning algorithm for solving the route planning problem in the dynamic multi-hop ridesharing. The experiments indicate that the evolutionary approach is able to provide a good quality set of route pla作者: bizarre 時(shí)間: 2025-3-24 04:35
The Mexx Group: Textbook Innovation at Workdreds of processors. We choose as basic constraint solving algorithm for these experiments the ”adaptive search” method, an efficient sequential local search method for Constraint Satisfaction Problems. The implemented algorithm is a parallel version of adaptive search in a multiple independent-walk作者: CARK 時(shí)間: 2025-3-24 10:20 作者: Harrowing 時(shí)間: 2025-3-24 12:01 作者: 無(wú)瑕疵 時(shí)間: 2025-3-24 17:46 作者: 歸功于 時(shí)間: 2025-3-24 22:16
Daniel Le Métayer,Julien Le Clainche whose candidate solutions are very expensive to evaluate. Because of the inherent spatial intuition behind these models, they are naturally suited to continuous problems but they do not seem applicable to combinatorial problems except for the special case when solutions are naturally encoded as int作者: 豪華 時(shí)間: 2025-3-25 03:13
Tom Dyson,Theodore Konstadinidesificantly reduce the computational time of the solution search space exploration, this latter cost remains exorbitant when very large problem instances are to be solved. As a result, the use of graphics processing units (GPU) has been recently revealed as an efficient way to accelerate the search pr作者: 付出 時(shí)間: 2025-3-25 06:40
The NATO Background: 1957 to 1976,his methodology is illustrated through the local-search heuristic implemented for solving an energy management problem posed by the EDF company in the context of the ROADEF/EURO Challenge 2010, an international competition of applied optimization. Our local-search approach is pure and direct: the pr作者: 溫室 時(shí)間: 2025-3-25 08:04 作者: 剛毅 時(shí)間: 2025-3-25 12:06 作者: 生氣的邊緣 時(shí)間: 2025-3-25 17:15
Conclusions and some Suggestions for Reform,tion of the appropriate configuration may strongly impact on the performance of evolutionary algorithms. In this paper, we study the performance of three memetic algorithms for the quadratic assignment problem when their parameters are tuned either off-line or on-line. Off-line tuning selects . one 作者: 平庸的人或物 時(shí)間: 2025-3-25 20:54 作者: 善于 時(shí)間: 2025-3-26 02:04 作者: 借喻 時(shí)間: 2025-3-26 08:18
https://doi.org/10.1007/978-94-009-7371-8ective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with .(..) variables and .(.) constraints.作者: abreast 時(shí)間: 2025-3-26 10:22 作者: Myocyte 時(shí)間: 2025-3-26 15:19 作者: lobster 時(shí)間: 2025-3-26 17:05 作者: 業(yè)余愛(ài)好者 時(shí)間: 2025-3-26 21:07
Evolutionary Computation in Combinatorial Optimization978-3-642-20364-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: maroon 時(shí)間: 2025-3-27 01:40
https://doi.org/10.1057/9780333981733tions, and two local search schemes to enhance its performance for the MOUCTP. The experimental results based on a set of test problems show that the proposed algorithm is efficient for solving the MOUCTP.作者: guzzle 時(shí)間: 2025-3-27 07:15 作者: heartburn 時(shí)間: 2025-3-27 11:41 作者: GROUP 時(shí)間: 2025-3-27 16:21 作者: EXALT 時(shí)間: 2025-3-27 19:18
Tom Dyson,Theodore Konstadinidesocess. This paper presents a new methodology to design and implement efficiently GPU-based multiobjective local search algorithms. The experimental results show that the approach is promising especially for large problem instances.作者: 珊瑚 時(shí)間: 2025-3-27 22:20 作者: Sleep-Paralysis 時(shí)間: 2025-3-28 02:31 作者: 暫時(shí)別動(dòng) 時(shí)間: 2025-3-28 06:45 作者: trigger 時(shí)間: 2025-3-28 14:26
Experiments in Parallel Constraint-Based Local Search, manner, that is, each process is an independent search engine and there is no communication between the simultaneous computations. Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.作者: 吹牛者 時(shí)間: 2025-3-28 15:29
GPU-Based Approaches for Multiobjective Local Search Algorithms. A Case Study: The Flowshop Schedulocess. This paper presents a new methodology to design and implement efficiently GPU-based multiobjective local search algorithms. The experimental results show that the approach is promising especially for large problem instances.作者: landmark 時(shí)間: 2025-3-28 18:53
Connectedness and Local Search for Bicriteria Knapsack Problems, of running time and number of optimal solutions found. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact approaches.作者: 充氣女 時(shí)間: 2025-3-29 02:05 作者: Bother 時(shí)間: 2025-3-29 04:16
Evolutionary Multiobjective Route Planning in Dynamic Multi-hop Ridesharing,oblem in the dynamic multi-hop ridesharing. The experiments indicate that the evolutionary approach is able to provide a good quality set of route plans and outperforms the generalized label correcting algorithm in term of runtime.作者: FLAGR 時(shí)間: 2025-3-29 07:50 作者: 高貴領(lǐng)導(dǎo) 時(shí)間: 2025-3-29 13:35
https://doi.org/10.1007/978-94-017-7173-3tance between repeated random perturbations of parameters, forming a statistical indication of EA stability under parameter perturbation. We then analyse the model for the wider class of general EAs, meaning our model may serve as a framework for parameter optimisation and stability analysis.作者: 官僚統(tǒng)治 時(shí)間: 2025-3-29 17:27
European Cosmopolitanism in Question To illustrate the effectiveness of our approach, we apply it to four test problems: OneMax, Trap, OneMix and Subset Sum. We then contrast the predictions made by the . to the actual performance measured using the number of fitness evaluations. The results suggest that the new measure can reliably indicate problem hardness for EAs.作者: 中國(guó)紀(jì)念碑 時(shí)間: 2025-3-29 21:51 作者: 支柱 時(shí)間: 2025-3-30 00:58
Daniel Le Métayer,Julien Le Claincheheir geometric interpretation from continuous to general metric spaces. As an initial illustrative example, we show how Radial Basis Function Networks (RBFNs) can be used successfully as surrogate models to optimise combinatorial problems defined on the Hamming space associated with binary strings.作者: artless 時(shí)間: 2025-3-30 06:05
John Garrard,Vera Tolz,Ralph Whiten. Our experiments show that the proposed approach is able to find improving solutions compared with a classical iterated local search. Moreover, the tradeoff between the exploitation of neutrality and the exploration of new parts of the search space is deeply analyzed.作者: gain631 時(shí)間: 2025-3-30 11:16
Conclusions and some Suggestions for Reform,ocess, adapting parameter settings on an instance-per-instance basis, and possibly to each phase of the search. The results suggest that off-line tuning achieves a better performance than on-line tuning.作者: arsenal 時(shí)間: 2025-3-30 14:40 作者: Musculoskeletal 時(shí)間: 2025-3-30 17:05
Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms, To illustrate the effectiveness of our approach, we apply it to four test problems: OneMax, Trap, OneMix and Subset Sum. We then contrast the predictions made by the . to the actual performance measured using the number of fitness evaluations. The results suggest that the new measure can reliably indicate problem hardness for EAs.作者: 啞劇 時(shí)間: 2025-3-30 23:43
Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem,nerated to avoid getting trapped into the local optima. The experimental results on the bin-packing problems show that FDHH can obtain optimal solutions on more instances than the original hyper-heuristic.作者: 脆弱么 時(shí)間: 2025-3-31 02:03 作者: 你正派 時(shí)間: 2025-3-31 06:13 作者: 不規(guī)則 時(shí)間: 2025-3-31 12:42 作者: 束以馬具 時(shí)間: 2025-3-31 14:26 作者: 知道 時(shí)間: 2025-3-31 21:17
0302-9743 pean Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2011, held in Torino, Italy, in April 2011. The 22 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers present the latest research and discuss current developments and app作者: HAUNT 時(shí)間: 2025-3-31 22:36
E. Millich,J. P. Joulia,D. Van Asselt of running time and number of optimal solutions found. The experimental results indicate that this simple local search algorithm is able to find a representative set of optimal solutions in most of the cases, and in much less time than exact approaches.作者: 胡言亂語(yǔ) 時(shí)間: 2025-4-1 02:03 作者: 流出 時(shí)間: 2025-4-1 09:18 作者: Dissonance 時(shí)間: 2025-4-1 12:34 作者: 凹槽 時(shí)間: 2025-4-1 17:58 作者: 扔掉掐死你 時(shí)間: 2025-4-1 21:55
The NATO Background: 1957 to 1976,ing millions of feasible solutions within one hour of running time, the resulting local search allows us to obtain among the best results of the competition, in which 44 teams from 25 countries were engaged.
