標題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 8th European Confere Jano Hemert,Carlos Cotta Conference proceedings 2008 Springer- [打印本頁] 作者: Buren 時間: 2025-3-21 16:26
書目名稱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é)科排名
作者: rheumatism 時間: 2025-3-21 23:31 作者: conformity 時間: 2025-3-22 02:24 作者: inflate 時間: 2025-3-22 04:45
Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem,on heuristics has been devised for representing the paths as particles. The comparative simulation results on several networks with random topologies illustrate the efficiency of the proposed hybrid algorithm for constrained shortest path computation.作者: inundate 時間: 2025-3-22 11:54 作者: 討好女人 時間: 2025-3-22 14:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/317872.jpg作者: 討好女人 時間: 2025-3-22 18:41
978-3-540-78603-0Springer-Verlag Berlin Heidelberg 2008作者: vitreous-humor 時間: 2025-3-23 00:21
Evolutionary Computation in Combinatorial Optimization978-3-540-78604-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Melanocytes 時間: 2025-3-23 03:25 作者: apropos 時間: 2025-3-23 07:48 作者: 嬰兒 時間: 2025-3-23 21:26 作者: incision 時間: 2025-3-23 23:55
https://doi.org/10.1007/978-3-319-48293-4um cost round trip visiting exactly one node from each cluster. For solving difficult instances of this problem heuristically, we present a new Variable Neighborhood Search (VNS) approach that utilizes two complementary, large neighborhood structures. One of them is the already known generalized 2-o作者: Inexorable 時間: 2025-3-24 02:47 作者: 闡釋 時間: 2025-3-24 09:07
https://doi.org/10.1057/9780230107533gorithm to solve this problem by combining evolutionary approaches with local search. The algorithm is benchmarked by solving instances with 20 and 50 nodes where results are compared to either optimum or best results found by an IP solver. For these instances, the proposed algorithm was able to fin作者: chlorosis 時間: 2025-3-24 12:41
International Politics and State Power,edure with path-relinking (GRASP-PR), and Multiple Objective Particle Swarm (MOPS). The rules are selected at the creation rule process following Pareto dominance concepts and forming unordered classifiers. We compare our results with other well known rule induction algorithms using the area under t作者: 頂點 時間: 2025-3-24 15:49
https://doi.org/10.1057/9781137481696f work stations on an assembly line. The specific problem considered here is known as the time and space constrained simple assembly line balancing problem. Among several possible objectives we consider the one of minimizing the number of necessary work stations. This problem is denoted by TSALBP-1 作者: 無關(guān)緊要 時間: 2025-3-24 20:39
The Mental Health of Black Americans,presentations for the graph colouring problem all based on the approach where vertices are merged into groups. In this paper, we show this provides a uniform and compact way to define algorithms, both of a complete or a heuristic nature. Moreover, the representation provides information useful to gu作者: 無脊椎 時間: 2025-3-25 01:13
Ethnic Relations at School in Malaysiag problem and a recently proposed evolutionary hybrid method denominated PTA/LP is used to solve it. The PTA/LP combines the Population Training Algorithm with Linear Programming to generate improving incoming columns in a column generation process. The computational results are obtained for a set o作者: 昆蟲 時間: 2025-3-25 03:38
https://doi.org/10.1007/978-981-19-1633-5for each city not visited, with travel costs among the cities. The objective is to minimize the sum of travel costs and penalties, while including in the tour enough cities to collect a minimum prize. This paper presents one solution procedure for the PCTSP, using a hybrid metaheuristic known as Clu作者: 細頸瓶 時間: 2025-3-25 11:11 作者: 傻 時間: 2025-3-25 14:22
Callie R. Mitchell,Porcia B. Lovenimized. Bottleneck jobs have significant impact on final scheduling performance and therefore need to be considered with higher priority. In order to describe the characteristic information concerning bottleneck jobs, a fuzzy inference system is employed to transform human knowledge into the bottle作者: STIT 時間: 2025-3-25 18:09 作者: 自傳 時間: 2025-3-25 20:35
Peter Meusburger,Tim Freytag,Laura Suarsanaristics and enhance these methods by using a variable fitness function. The variable fitness function (VFF) uses an evolutionary approach to evolve weights for each of the (multiple) objectives. The variable fitness function can potentially enhance any search based optimisation heuristic where multi作者: Root494 時間: 2025-3-26 03:38
Ethnic minorities in urban areas can be formulated in a way that hinder the recovery of the requested information. The objective of automatic query transformation is to improve the quality of the recovered information. This paper describes a new genetic algorithm used to change the set of terms that compose a user query without us作者: Paradox 時間: 2025-3-26 07:31
Social Injustices of Religion or Belief,lly improve the overall performance of the heuristic. Genetic programming is used to discover new strategies for the Inc* algorithm. We experimentally compare performance of local heuristics for SAT with and without the Inc* algorithm. Results show that Inc* consistently improves performance.作者: frivolous 時間: 2025-3-26 09:37
Ethnicisation and Domesticisation is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non-visited nodes to visited ones. In spite of its natural multi-objective formulation, this problem has never been investigated in such a way. In this paper, three metaheu作者: Compass 時間: 2025-3-26 13:38 作者: 放棄 時間: 2025-3-26 20:26
Social Injustices of Religion or Belief,lly improve the overall performance of the heuristic. Genetic programming is used to discover new strategies for the Inc* algorithm. We experimentally compare performance of local heuristics for SAT with and without the Inc* algorithm. Results show that Inc* consistently improves performance.作者: 財主 時間: 2025-3-26 21:27 作者: 誘惑 時間: 2025-3-27 04:15
Minorities in West Asia and North Africau tenure managing in the literature and presents a new and original Tabu tenure adaptation mechanism. The generic method is tested on the k-coloring problem and compared with some best methods published in the literature. Obtained results show the competitiveness of the method.作者: 補助 時間: 2025-3-27 06:13 作者: guardianship 時間: 2025-3-27 13:31
Callie R. Mitchell,Porcia B. Loveesigned based on these characteristic values and a genetic algorithm combined with the immune mechanism is devised to solve the job shop scheduling problem. Numerical computations for problems of different scales show that the proposed algorithm achieves effective results by accelerating the convergence of the optimization process.作者: 機密 時間: 2025-3-27 13:36 作者: Lipoprotein 時間: 2025-3-27 19:21 作者: 欲望 時間: 2025-3-28 01:20 作者: 啜泣 時間: 2025-3-28 05:44
An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem,esigned based on these characteristic values and a genetic algorithm combined with the immune mechanism is devised to solve the job shop scheduling problem. Numerical computations for problems of different scales show that the proposed algorithm achieves effective results by accelerating the convergence of the optimization process.作者: aristocracy 時間: 2025-3-28 07:30
Multiobjective Prototype Optimization with Evolved Improvement Steps,ctive version of the POEMS algorithm (mPOEMS), which was experimentally evaluated on the multiobjective 0/1 knapsack problem with alternative multiobjective evolutionary algorithms. Major result of the experiments was that the proposed algorithm performed comparable to or better than the alternative algorithms.作者: 原來 時間: 2025-3-28 13:18
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems,experimental fine-tuning of parameters was performed to optimise the performance of the algorithm on a commonly used test-set. Compared to the performance of the earlier STLEA, and benchmark algorithms, the CTLEA outperforms the former, and approaches the later.作者: 解開 時間: 2025-3-28 18:03 作者: 無底 時間: 2025-3-28 22:00
A Hybrid Column Generation Approach for the Berth Allocation Problem,ithm with Linear Programming to generate improving incoming columns in a column generation process. The computational results are obtained for a set of instances proposed in literature and new best known solutions are presented.作者: 尊重 時間: 2025-3-28 23:41 作者: FORGO 時間: 2025-3-29 06:35
Ethnic Minorities in the Modern Nation Stateexperimental fine-tuning of parameters was performed to optimise the performance of the algorithm on a commonly used test-set. Compared to the performance of the earlier STLEA, and benchmark algorithms, the CTLEA outperforms the former, and approaches the later.作者: 漫不經(jīng)心 時間: 2025-3-29 09:26
https://doi.org/10.1057/9780230107533 nodes where results are compared to either optimum or best results found by an IP solver. For these instances, the proposed algorithm was able to find optimal and near-optimal solutions and outperform previous heuristics.作者: 謙卑 時間: 2025-3-29 13:46
Ethnic Relations at School in Malaysiaithm with Linear Programming to generate improving incoming columns in a column generation process. The computational results are obtained for a set of instances proposed in literature and new best known solutions are presented.作者: Infantry 時間: 2025-3-29 16:56
Steven M. Hoefflin M.D., F.A.C.Sd Local Search (ILS) procedure that uses a Variable Neighborhood Descent (VND) method to perform the local search is proposed. The algorithm was applied to test problems and, in most cases, was found to produce better results than those reported in the literature.作者: conquer 時間: 2025-3-29 20:04
Introduction: Untimely Ancestors,etic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.作者: Respond 時間: 2025-3-30 00:54 作者: 舉止粗野的人 時間: 2025-3-30 06:24 作者: 強制令 時間: 2025-3-30 11:13 作者: 玉米 時間: 2025-3-30 16:24 作者: 典型 時間: 2025-3-30 19:17
Sustaining and Utilizing a Relationship, random instances. We analyze the properties of several instances in detail and propose an improved construction heuristic to handle ‘problematic’ instances. Our iterated local search finds the optimum for most instances.作者: 逃避現(xiàn)實 時間: 2025-3-31 00:41 作者: anthesis 時間: 2025-3-31 01:19 作者: endocardium 時間: 2025-3-31 08:24
Efficient Local Search Limitation Strategies for Vehicle Routing Problems,etic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.作者: 惰性女人 時間: 2025-3-31 09:25 作者: NUL 時間: 2025-3-31 14:48 作者: 切割 時間: 2025-3-31 19:17
Graph Colouring Heuristics Guided by Higher Order Graph Properties,ide algorithms during their search. In this paper we focus on the quality of solutions obtained by graph colouring heuristics that make use of higher order properties derived during the search. An evolutionary algorithm is used to search permutations of possible merge orderings.作者: cruise 時間: 2025-3-31 22:57 作者: 殺蟲劑 時間: 2025-4-1 03:40
,Improved Construction Heuristics and Iterated?Local Search for the Routing and Wavelength Assignmen random instances. We analyze the properties of several instances in detail and propose an improved construction heuristic to handle ‘problematic’ instances. Our iterated local search finds the optimum for most instances.作者: 銼屑 時間: 2025-4-1 08:09
Improving Metaheuristic Performance by Evolving a Variable Fitness Function,ple objectives can be defined through evolutionary changes in the search direction. We show that the VFF significantly improves performance of constructive and VNS approaches on training problems, and “l(fā)earn” problem features which enhance the performance on unseen test problem instances.作者: 生存環(huán)境 時間: 2025-4-1 11:57 作者: climax 時間: 2025-4-1 15:36 作者: conifer 時間: 2025-4-1 21:32 作者: nominal 時間: 2025-4-1 23:49 作者: Immunization 時間: 2025-4-2 05:51 作者: contradict 時間: 2025-4-2 08:45
Efficient Local Search Limitation Strategies for Vehicle Routing Problems, routing problem deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful mem
