標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 18th European Confer Arnaud Liefooghe,Manuel López-Ibá?ez Conference proceedings 20 [打印本頁] 作者: 尖酸好 時間: 2025-3-21 19:15
書目名稱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é)科排名
作者: Communicate 時間: 2025-3-21 22:17
On the Fractal Nature of Local Optima Networks,ere have been recent observations made about inherent .. An object is said to be self-similar if it shows the same patterns when measured at different scales; another word used to convey self-similarity is .. The . of an object captures how the detail observed changes with the scale at which it is m作者: Resection 時間: 2025-3-22 01:33
How Perturbation Strength Shapes the Global Structure of TSP Fitness Landscapes,nce and distribution of multiple funnels in the landscape. We extract and analyse the networks induced by Chained-LK, a powerful iterated local search for the TSP, on a large set of randomly generated (Uniform and Clustered) instances. Results indicate that increasing the perturbation strength emplo作者: 走調(diào) 時間: 2025-3-22 08:13 作者: 體貼 時間: 2025-3-22 09:12 作者: auxiliary 時間: 2025-3-22 14:31
Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Totaln flow shop scheduling problem minimizing total completion time with a context-free grammar that defines how algorithmic components can be combined to form a full heuristic search method. We implement components from various works from the literature, including several local search procedures. The s作者: auxiliary 時間: 2025-3-22 19:21
Data Clustering Using Grouping Hyper-heuristics,ultiple criteria varying dependent on the domain. A recent work proposed a general-purpose selection hyper-heuristic search framework with reusable components, designed for rapid development of grouping hyper-heuristics to solve grouping problems. The framework was tested only on the graph colouring作者: Coeval 時間: 2025-3-22 23:12
Reference Point Adaption Method for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop he literature that JSS usually contains many (four or more) potentially conflicting objectives. One of the promising and successful approaches to solve the JSS problem is Genetic Programming Hyper-Heuristic (GP-HH). This approach automatically evolves dispatching rules for solving JSS problems. This作者: 幼稚 時間: 2025-3-23 02:15
MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutatio this paper we introduce a decomposition-based algebraic evolutionary algorithm, namely MOEA/DEP, in order to deal with multiobjective permutation-based optimization problems. As a case of study, MOEA/DEP has been experimentally validated on a multiobjective permutation flowshop scheduling problem (作者: CHIDE 時間: 2025-3-23 06:36
,An Evolutionary Algorithm with Practitioner’s-Knowledge-Based Operators for the Inventory Routing Pinventory levels at the same time. The IRP is notable for its difficulty - even finding feasible initial solutions poses a?significant problem..In this paper an evolutionary algorithm is proposed that uses approaches to solution construction and modification utilized by practitioners in the field. T作者: 托人看管 時間: 2025-3-23 13:07
A Multistart Alternating Tabu Search for Commercial Districting,tioning an area of distribution, which is modeled as an embedded planar graph, into connected components, called districts. Districts are required to be mutually balanced with respect to node attributes, such as number of customers, expected demand, and service cost, and as geometrically-compact as 作者: 同來核對 時間: 2025-3-23 15:56 作者: 精密 時間: 2025-3-23 21:19
978-3-319-77448-0Springer International Publishing AG, part of Springer Nature 2018作者: 能夠支付 時間: 2025-3-23 23:19
Evolutionary Computation in Combinatorial Optimization978-3-319-77449-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MIME 時間: 2025-3-24 03:08 作者: chuckle 時間: 2025-3-24 08:03 作者: 拾落穗 時間: 2025-3-24 12:44 作者: 北京人起源 時間: 2025-3-24 17:45 作者: 字形刻痕 時間: 2025-3-24 20:52 作者: BRAVE 時間: 2025-3-25 02:05
Harriet Bradley,Geraldine Healyrts in the trial-and-error search for promising heuristic strategies. We propose a grammar-based approach to the automatic design of heuristics and apply it to binary quadratic programming. The grammar represents the search space of algorithms and parameter values. A solution is represented as a seq作者: 退出可食用 時間: 2025-3-25 04:40
Mai Stafford,Laia Bécares,James Nazroon flow shop scheduling problem minimizing total completion time with a context-free grammar that defines how algorithmic components can be combined to form a full heuristic search method. We implement components from various works from the literature, including several local search procedures. The s作者: 悲痛 時間: 2025-3-25 08:54
Ethnicity and Nationalism in Africaultiple criteria varying dependent on the domain. A recent work proposed a general-purpose selection hyper-heuristic search framework with reusable components, designed for rapid development of grouping hyper-heuristics to solve grouping problems. The framework was tested only on the graph colouring作者: Incommensurate 時間: 2025-3-25 14:05 作者: 大雨 時間: 2025-3-25 18:18
https://doi.org/10.1007/978-1-349-62337-2 this paper we introduce a decomposition-based algebraic evolutionary algorithm, namely MOEA/DEP, in order to deal with multiobjective permutation-based optimization problems. As a case of study, MOEA/DEP has been experimentally validated on a multiobjective permutation flowshop scheduling problem (作者: novelty 時間: 2025-3-25 23:25
Ethnicity, Employment and Exclusion,inventory levels at the same time. The IRP is notable for its difficulty - even finding feasible initial solutions poses a?significant problem..In this paper an evolutionary algorithm is proposed that uses approaches to solution construction and modification utilized by practitioners in the field. T作者: evanescent 時間: 2025-3-26 01:48 作者: 使害怕 時間: 2025-3-26 06:19
Much More Than a Question of Borders,ermining the winners is an NP-complete problem. In this paper, we propose an ant colony technique for approximating solutions to hard instances of this problem. Hard instances are those that are unsolvable within reasonable time by CPLEX and have more than 1000 bids on 500 or more unique items. Such作者: 偽證 時間: 2025-3-26 11:49
https://doi.org/10.1007/978-3-319-77449-7artificial intelligence; automatic algorithm configuration; combinatorial optimization; evolutionary al作者: Nonporous 時間: 2025-3-26 14:40 作者: surrogate 時間: 2025-3-26 20:13
Reference Point Adaption Method for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop ds, these useless reference points adversely affect the performance of NSGA-III and genetic programming. To address the above issue, in this paper a new reference point adaptation mechanism is proposed based on the distribution of the candidate solutions. We evaluated the performance of the proposed作者: Clinch 時間: 2025-3-27 00:02
,An Evolutionary Algorithm with Practitioner’s-Knowledge-Based Operators for the Inventory Routing Pns in the presented EA are encoded as lists of routes with the quantities to be delivered determined by a?supplying policy..The presented work is a step towards utilizing domain knowledge in evolutionary computation. The EA presented in this paper employs mechanisms of solution initialization capabl作者: 知識 時間: 2025-3-27 03:00
An Ant Colony Approach for the Winner Determination Problem,ults lie within the third quartile of the values generated using our approach for 3 of 10 of the instances. In addition, CPLEX results are on average . worse than best values reported using our approach for 5 of 10 instances. Further, our approach performs statistically significantly better (.) than作者: 移植 時間: 2025-3-27 08:40
Ethnicity and Nationalism in Africased on a bi-objective formulation. An archive of high quality solutions, capturing the trade-off between the number of clusters and overall error of clustering, is maintained during the search process. The empirical results verify the effectiveness of a successful selection hyper-heuristic, winner o作者: 異端邪說2 時間: 2025-3-27 09:46 作者: Watemelon 時間: 2025-3-27 16:14 作者: Irksome 時間: 2025-3-27 20:57 作者: compose 時間: 2025-3-28 01:01
Conference proceedings 2018m configuration and hyper-heuristics. Applicationscover conventional academic domains such as NK landscapes, binary quadratic programming, traveling salesman, vehicle routing, or scheduling problems, and also include real-world domains in clustering, commercial districting and winner determination..作者: GROVE 時間: 2025-3-28 03:44
Erratum to: On the Fractal Nature of Local Optima Networks,作者: Condense 時間: 2025-3-28 09:55
Evolutionary Computation in Combinatorial Optimization18th European Confer作者: 混亂生活 時間: 2025-3-28 10:56
0302-9743 raveling salesman, vehicle routing, or scheduling problems, and also include real-world domains in clustering, commercial districting and winner determination..978-3-319-77448-0978-3-319-77449-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 口音在加重 時間: 2025-3-28 16:54 作者: Flavouring 時間: 2025-3-28 21:32 作者: 執(zhí)拗 時間: 2025-3-29 02:37
Gajendra K. Verma,Brandon Ashworthve analysis shows that several funnel metrics have stronger correlations with Chained-LK success rate than the number of local optima, indicating that global structure clearly impacts search performance.作者: 環(huán)形 時間: 2025-3-29 05:18
Harriet Bradley,Geraldine Healylutions and tune parameter values. Experiments show that our approach can find algorithms which perform better than or comparable to state-of-the-art methods, and can even find new best solutions for some instances of standard benchmark sets.作者: 火海 時間: 2025-3-29 08:01
https://doi.org/10.1007/978-1-349-62337-2, and the obtained results have been compared with respect to the state-of-the-art Pareto fronts for MoPFSP. The experimental results have been analyzed by means of two commonly used performance metrics for multiobjective optimization. The analysis clearly shows that MOEA/DEP reaches new state-of-the-art results for the considered benchmark.作者: 折磨 時間: 2025-3-29 15:12
On the Fractal Nature of Local Optima Networks,s of a benchmark combinatorial optimisation problem (NK Landscapes). The results draw connections between fractal characteristics and performance by three prominent metaheuristics: Iterated Local Search, Simulated Annealing, and Tabu Search.作者: 彎腰 時間: 2025-3-29 15:55
How Perturbation Strength Shapes the Global Structure of TSP Fitness Landscapes,ve analysis shows that several funnel metrics have stronger correlations with Chained-LK success rate than the number of local optima, indicating that global structure clearly impacts search performance.
