標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 19th European Confer Arnaud Liefooghe,Luís Paquete Conference proceedings 2019 Spri [打印本頁(yè)] 作者: decoction 時(shí)間: 2025-3-21 17:40
書(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é)科排名
作者: FEMUR 時(shí)間: 2025-3-21 20:17
A Binary Algebraic Differential Evolution for the MultiDimensional Two-Way Number Partitioning Probnsional Two-Way Number Partitioning Problem (MDTWNPP) and its main components are the binary differential mutation operator and a variable neighborhood descent procedure. The binary differential mutation is a concrete application of the abstract algebraic framework for the binary search space. The v作者: 我不明白 時(shí)間: 2025-3-22 03:22 作者: collagenase 時(shí)間: 2025-3-22 06:07
An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant he two machines are equal. This case is interesting because it occurs in various applications, e.g., when one machine is a packing machine. For the buffers we consider two types of buffers that have been studied in the literature for flow shops. It is shown that all considered buffered flow shop pro作者: 體貼 時(shí)間: 2025-3-22 12:06 作者: 使人煩燥 時(shí)間: 2025-3-22 15:37
Multiple Periods Vehicle Routing Problems: A Case Study,over a 3-month horizon period where multiple frequencies of visits can be required simultaneously by each single customer. The objective is then threefold: (1) balancing workload between vehicles (agents) (2) minimizing number of visits to the same customer (3) minimizing total routing costs. In thi作者: 使人煩燥 時(shí)間: 2025-3-22 19:27 作者: Ganglion-Cyst 時(shí)間: 2025-3-22 22:27
Runtime Analysis of Discrete Particle Swarm Optimization Applied to Shortest Paths Computation,are an improved and extended study on Markov chains expanding the adaptability of this technique and its application on the well-known SSSP problem. The results are upper and lower bounds on the expected optimization time. For upper bounds, we combine return times within a Markov model with the well作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-23 02:04
Quasi-Optimal Recombination Operator,ll the solutions fulfilling the gene transmission property: the value of any variable in the offspring must be inherited from one of the parents. This set of solutions coincides with the largest dynastic potential for the two parent solutions of any recombination operator with the gene transmission 作者: 緩和 時(shí)間: 2025-3-23 06:15 作者: Virtues 時(shí)間: 2025-3-23 09:48 作者: cipher 時(shí)間: 2025-3-23 17:03
A Unifying View on Recombination Spaces and Abstract Convex Evolutionary Search,goals behind this unification is to develop an analytical method that verifies if a problem’s landscape belongs to certain abstract convex landscape classes, where certain recombination-based EAs (without mutation) have polynomial runtime performance. This paper advances such unification by showing 作者: Immobilize 時(shí)間: 2025-3-23 21:28
Program Trace Optimization with Constructive Heuristics for Combinatorial Problems,ctively combines “smart” problem-specific constructive heuristics and problem-agnostic metaheuristic search, automatically and implicitly designing problem-appropriate search operators. A weakness is identified in PTO’s operators when applied in conjunction with smart heuristics on COP problems, and作者: Anthology 時(shí)間: 2025-3-23 22:22
Framing the Impact of Enlargementertain geographical area. The application scenario is generic in principle, but we have the setup of charging stations for electric vehicles or rental stations for bicycles or cars in mind. When planning such systems, estimating under which conditions which customer demand can be fulfilled is fundam作者: licence 時(shí)間: 2025-3-24 02:24
Feminismus und Frauenpolitik in Finnlandnsional Two-Way Number Partitioning Problem (MDTWNPP) and its main components are the binary differential mutation operator and a variable neighborhood descent procedure. The binary differential mutation is a concrete application of the abstract algebraic framework for the binary search space. The v作者: 作嘔 時(shí)間: 2025-3-24 09:52
Hara Kouki,Joseba Fernández Gonzálezfacturing. In DFJSS, it is critical to make two kinds of real-time decisions (i.e. the routing decision that assigns machine to each job and the sequencing decision that prioritises the jobs in a machine’s queue) effectively in the dynamic environment with unpredicted events such as new job arrivals作者: Opponent 時(shí)間: 2025-3-24 12:12 作者: reptile 時(shí)間: 2025-3-24 14:53 作者: palliative-care 時(shí)間: 2025-3-24 19:53 作者: multiply 時(shí)間: 2025-3-25 00:36
Der Europawahlkampf in 140 Zeichen,son Problem (TSP) is no exception. We apply three state-of-the-art heuristic solvers to a large set of TSP instances of varying structure and size, identifying which heuristics solve specific instances to optimality faster than others. The first two solvers considered are variants of the multi-trial作者: 格子架 時(shí)間: 2025-3-25 03:26
Melanie Leidecker-Sandmann,Jürgen Wilkeare an improved and extended study on Markov chains expanding the adaptability of this technique and its application on the well-known SSSP problem. The results are upper and lower bounds on the expected optimization time. For upper bounds, we combine return times within a Markov model with the well作者: 食道 時(shí)間: 2025-3-25 08:51 作者: 強(qiáng)所 時(shí)間: 2025-3-25 13:56 作者: 胰島素 時(shí)間: 2025-3-25 18:35
Imagining Europe as Open Spaceshe local optima space of a fitness landscape. One sampling algorithm is based on a random-walk . procedure, while the other is centred around multiple traced runs of an Iterated Local Search. Both of these are proposed for the Quadratic Assignment Problem (QAP), making this the focus of our study. I作者: Pudendal-Nerve 時(shí)間: 2025-3-25 22:41 作者: 有發(fā)明天才 時(shí)間: 2025-3-26 00:49
Karin Hippel (Senior Research Fellow)ctively combines “smart” problem-specific constructive heuristics and problem-agnostic metaheuristic search, automatically and implicitly designing problem-appropriate search operators. A weakness is identified in PTO’s operators when applied in conjunction with smart heuristics on COP problems, and作者: N防腐劑 時(shí)間: 2025-3-26 04:54 作者: 滋養(yǎng) 時(shí)間: 2025-3-26 11:06
https://doi.org/10.1007/978-3-030-16711-0artificial intelligence; automatic algorithm configuration; combinatorial mathematics; combinatorial op作者: tenuous 時(shí)間: 2025-3-26 13:02
978-3-030-16710-3Springer Nature Switzerland AG 2019作者: 服從 時(shí)間: 2025-3-26 19:52 作者: 自愛(ài) 時(shí)間: 2025-3-27 00:09
Correction to: Evolutionary Computation in Combinatorial Optimization,作者: nauseate 時(shí)間: 2025-3-27 02:54
Evolutionary Computation in Combinatorial Optimization19th European Confer作者: 偽造 時(shí)間: 2025-3-27 06:39 作者: Accomplish 時(shí)間: 2025-3-27 10:45 作者: vitrectomy 時(shí)間: 2025-3-27 15:46
Framing the Impact of Enlargementfrom the feedback of potential users given to candidate solutions. For the actual optimization we consider a population based iterated greedy algorithm. Experiments on artificial benchmark scenarios with idealized simulated user behavior show the learning capabilities of the surrogate objective func作者: 手段 時(shí)間: 2025-3-27 18:37
Hara Kouki,Joseba Fernández González in the terminal set have different contributions to the decision making. However, the current GP approaches cannot perfectly find proper combinations between the features in accordance with their contributions. In this paper, we propose a new representation for GP that better considers the differen作者: 事物的方面 時(shí)間: 2025-3-28 00:06
https://doi.org/10.1007/978-3-531-90434-4ains better results than two state-of-the-art algorithms for buffered flow shop problems from the literature and an Ant Colony Optimization algorithm. In addition, it is shown experimentally that 2BF-ILS can obtain the same solution quality as the standard NEH heuristic with a smaller number of func作者: 表否定 時(shí)間: 2025-3-28 03:07 作者: Injunction 時(shí)間: 2025-3-28 07:27
https://doi.org/10.1007/978-3-322-84355-5 than 6000 customers and 69951 requests of visits. The results show an excellent performance of the solving approach in terms of solution quality compared with the existing plan used by the hygiene services company.作者: forebear 時(shí)間: 2025-3-28 11:00
Der Europawahlkampf in 140 Zeichen,cision trees are used to identify main features which could best inform algorithm selection. The most prominent features identified a high proportion of instances where the GA with Edge Assembly Crossover performed significantly better when solving to optimality.作者: integrated 時(shí)間: 2025-3-28 16:18 作者: Eructation 時(shí)間: 2025-3-28 22:02 作者: 他去就結(jié)束 時(shí)間: 2025-3-28 23:05
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications,from the feedback of potential users given to candidate solutions. For the actual optimization we consider a population based iterated greedy algorithm. Experiments on artificial benchmark scenarios with idealized simulated user behavior show the learning capabilities of the surrogate objective func作者: Synthesize 時(shí)間: 2025-3-29 06:24
A New Representation in Genetic Programming for Evolving Dispatching Rules for Dynamic Flexible Job in the terminal set have different contributions to the decision making. However, the current GP approaches cannot perfectly find proper combinations between the features in accordance with their contributions. In this paper, we propose a new representation for GP that better considers the differen作者: Impugn 時(shí)間: 2025-3-29 10:53
An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant ains better results than two state-of-the-art algorithms for buffered flow shop problems from the literature and an Ant Colony Optimization algorithm. In addition, it is shown experimentally that 2BF-ILS can obtain the same solution quality as the standard NEH heuristic with a smaller number of func作者: demote 時(shí)間: 2025-3-29 14:16 作者: Serenity 時(shí)間: 2025-3-29 16:18
Multiple Periods Vehicle Routing Problems: A Case Study, than 6000 customers and 69951 requests of visits. The results show an excellent performance of the solving approach in terms of solution quality compared with the existing plan used by the hygiene services company.作者: Substance-Abuse 時(shí)間: 2025-3-29 22:49
Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers,cision trees are used to identify main features which could best inform algorithm selection. The most prominent features identified a high proportion of instances where the GA with Edge Assembly Crossover performed significantly better when solving to optimality.作者: Ferritin 時(shí)間: 2025-3-30 02:59 作者: accessory 時(shí)間: 2025-3-30 05:42 作者: Receive 時(shí)間: 2025-3-30 10:19
Conference proceedings 2019, held as part of Evo* 2019, in Leipzig, Germany, in April 2019,?co-located with the Evo* 2019 events EuroGP, EvoMUSART and?EvoApplications..The 14 revised full papers presented were carefully reviewed and?selected from 37 submissions. The papers cover?a wide spectrum of topics, ranging from the fou作者: Locale 時(shí)間: 2025-3-30 13:25
Karin Hippel (Senior Research Fellow)parameter) in the heuristics. Experiments across problems show that the novel operators consistently outperform the original without any loss of generality or cost in CPU time; hill-climbing is a sufficient metaheuristic; and intermediate levels of greediness are usually best.
