標(biāo)題: Titlebook: Evolutionary Computation in Combinatorial Optimization; 12th European Confer Jin-Kao Hao,Martin Middendorf Conference proceedings 2012 Spri [打印本頁] 作者: deferential 時(shí)間: 2025-3-21 20:05
書目名稱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é)科排名
作者: epicondylitis 時(shí)間: 2025-3-21 20:29
Conference proceedings 2012 held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. . The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers present the latest research and discuss current developments and appl作者: 輕率的你 時(shí)間: 2025-3-22 01:24
Henryk Kierzkowski (Professor of Economics)ent processors. In this paper, we present a proposal for such a methodology, as well as an example of its use applied to two well-known algorithms (Genetic Algorithms and Simulated Annealing) and solving the MAXSAT problem.作者: 異教徒 時(shí)間: 2025-3-22 04:33 作者: 緩解 時(shí)間: 2025-3-22 10:08
https://doi.org/10.1007/978-3-030-54541-3arch space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method.作者: Radiculopathy 時(shí)間: 2025-3-22 13:30
The Future of Europe in Prisons,tuned using the design of experiments. The influence of the number of Pareto fronts is studied experimentally. Finally GAME’s performance is assessed and compared with three other algorithms according to the conditions of the CEC?2009 competition.作者: Radiculopathy 時(shí)間: 2025-3-22 18:07 作者: Diskectomy 時(shí)間: 2025-3-22 22:53
A Methodology for Comparing the Execution Time of Metaheuristics Running on Different Hardware,ent processors. In this paper, we present a proposal for such a methodology, as well as an example of its use applied to two well-known algorithms (Genetic Algorithms and Simulated Annealing) and solving the MAXSAT problem.作者: FLOAT 時(shí)間: 2025-3-23 04:47
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveriesis proposed. A new method based on branch and bound optimisation attempts to optimise the final ordering of requests in routes to further improve the solutions. Results are analysed for a standard set of benchmark instances and are shown to be competitive with the state of the art.作者: 熱情的我 時(shí)間: 2025-3-23 05:56 作者: 制度 時(shí)間: 2025-3-23 11:51
Multi-Pareto-Ranking Evolutionary Algorithm,tuned using the design of experiments. The influence of the number of Pareto fronts is studied experimentally. Finally GAME’s performance is assessed and compared with three other algorithms according to the conditions of the CEC?2009 competition.作者: Accessible 時(shí)間: 2025-3-23 15:15 作者: 態(tài)度暖昧 時(shí)間: 2025-3-23 18:20
Conference proceedings 2012and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.作者: 朦朧 時(shí)間: 2025-3-24 01:06 作者: 怒目而視 時(shí)間: 2025-3-24 03:37 作者: 合法 時(shí)間: 2025-3-24 09:29
Iterated Greedy Algorithms for the Maximal Covering Location Problem,ovement procedure that explores a large neighbourhood by means of an exact solver. The benefits of the proposal in comparison to a recently proposed decomposition heuristic and a standalone exact solver are experimentally shown.作者: Peak-Bone-Mass 時(shí)間: 2025-3-24 11:03
Multiobjectivizing the HP Model for Protein Structure Prediction,proposed formulation increased the search performance of the implemented algorithms in most of the cases. Both two- and three-dimensional lattices are considered. To the best of authors’ knowledge, this is the first study where multiobjective optimization methods are used for solving the HP model.作者: predict 時(shí)間: 2025-3-24 18:45 作者: Anal-Canal 時(shí)間: 2025-3-24 20:02 作者: Concrete 時(shí)間: 2025-3-25 02:55 作者: 污點(diǎn) 時(shí)間: 2025-3-25 05:03 作者: expository 時(shí)間: 2025-3-25 08:13 作者: ELATE 時(shí)間: 2025-3-25 14:08
https://doi.org/10.1007/978-3-322-83823-0ior, that is, they aim to maximize the quality of the Pareto front at each time step. Experimental results on the bi-objective traveling salesman problem show a large improvement of the proposed anytime PLS algorithm over the classical one.作者: Immunization 時(shí)間: 2025-3-25 17:20
An NSGA-II Algorithm for the Green Vehicle Routing Problem,lutionary algorithm to solve GVRP benchmarks and perform statistical analysis to evaluate and validate the obtained results. The results show that the algorithm obtain good results and prove the explicit interest grant to emission minimization objective.作者: 上腭 時(shí)間: 2025-3-25 22:04 作者: 信條 時(shí)間: 2025-3-26 01:03
Electrical Load Management in Smart Homes Using Evolutionary Algorithms,d power plants and electrical storages in an optimized way with respect to the given external signals. The nonlinearities present in the integer programming problem makes it difficult for exact solvers. The results of this paper show the efficacy of evolutionary algorithms for solving such combinatorial problems.作者: 饒舌的人 時(shí)間: 2025-3-26 05:36
Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Oosition of the problems defined over binary strings in which the objective function has one global optimum. We present some theoretical results that raise some doubts on using FDC as a measure of problem difficulty.作者: 使顯得不重要 時(shí)間: 2025-3-26 12:23 作者: 浸軟 時(shí)間: 2025-3-26 15:04
Pareto Local Search Algorithms for Anytime Bi-objective Optimization,ior, that is, they aim to maximize the quality of the Pareto front at each time step. Experimental results on the bi-objective traveling salesman problem show a large improvement of the proposed anytime PLS algorithm over the classical one.作者: 廚師 時(shí)間: 2025-3-26 20:38
978-3-642-29123-4Springer-Verlag Berlin Heidelberg 2012作者: dragon 時(shí)間: 2025-3-26 22:07 作者: Ischemic-Stroke 時(shí)間: 2025-3-27 03:04
Henryk Kierzkowski (Professor of Economics)is not easy to reproduce the results or to obtain an exact implementation of the original work, or we do not have access to the same processor where the original algorithm was tested for running our own algorithm. With the present work we try to provide the basis for a methodology to characterize th作者: 葡萄糖 時(shí)間: 2025-3-27 06:38 作者: dermatomyositis 時(shí)間: 2025-3-27 12:08 作者: institute 時(shí)間: 2025-3-27 15:41
Europe and the Atlantic Relationshipes for the problem of finding routes for vehicles to serve a set of customers while minimizing the total traveled distance and the .. emissions. We review emission factors and techniques employed to estimate .. emissions and integrate them into the GVRP definition and model. We apply the NSGA-II evo作者: Antarctic 時(shí)間: 2025-3-27 18:34
Europe and the End of the Age of Innocencerine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the litera作者: gimmick 時(shí)間: 2025-3-27 22:10 作者: GET 時(shí)間: 2025-3-28 06:00
Patrizio Bianchi,Sandrine Laboryfies the multi-objective problem (MOP) by rewriting it as a set of aggregation problems, solving these problems simultaneously, within the PSO framework, might lead to premature convergence because of the leader selection process which uses the aggregation value as a criterion. Dominance plays a maj作者: glowing 時(shí)間: 2025-3-28 09:56 作者: candle 時(shí)間: 2025-3-28 11:04 作者: Lipoprotein 時(shí)間: 2025-3-28 16:03 作者: GRE 時(shí)間: 2025-3-28 20:47
Strategy, Implementation and Means,ent, that is, optimizing the scheduling of a set of tasks so that the consumed volume of contaminated water is minimized. Each task consists of manually activating a given device, located on the hydraulic network of the water distribution system. In practice, once contamination has been detected, a 作者: 新娘 時(shí)間: 2025-3-29 00:52
The Border of Expansion: Europe and Americace for dealing with different combinatorial optimisation problems and provides the algorithm components that are problem specific. In this way, the algorithm designer does not require a detailed knowledge of the problem domains and thus can concentrate his/her efforts on designing adaptive general-p作者: 平躺 時(shí)間: 2025-3-29 06:22 作者: 檢查 時(shí)間: 2025-3-29 08:34 作者: hardheaded 時(shí)間: 2025-3-29 15:00
Vassilis K. Fouskas,Constantine Dimoulas folding process. This model represents a hard combinatorial optimization problem, which has been widely addressed using evolutionary algorithms and other metaheuristics. In this paper, the multiobjectivization of the HP model is proposed. This originally single-objective problem is restated as a mu作者: 自由職業(yè)者 時(shí)間: 2025-3-29 18:51
The Future of Europe in Prisons,t it ranks the population in several Pareto fronts. Then, three types of fitness assignment methods are defined: the fitness of individuals depends on the front they belong to. The crowding distance is also used to preserve diversity. Selection is based on two steps: a Pareto front is first selected作者: Anticoagulants 時(shí)間: 2025-3-29 23:04
https://doi.org/10.1007/978-3-322-83823-0rt of several state-of-the-art multi-objective optimizers. PLS stops when all neighbors of the solutions in its solution archive are dominated. If terminated before completion, it may produce a poor approximation to the Pareto front. This paper proposes variants of PLS that improve its anytime behav作者: 大喘氣 時(shí)間: 2025-3-29 23:55 作者: absorbed 時(shí)間: 2025-3-30 07:22 作者: Facet-Joints 時(shí)間: 2025-3-30 12:01
Intensification/Diversification-Driven ILS for a Graph Coloring Problem,This paper presents an extension of the ILS algorithm, called ., by introducing new local search devices that enforce an efficient tradeoff of intensification and diversification. Experiments performed on the DIMACS benchmarks show that our method is competitive with the best coloring algorithms.作者: HEDGE 時(shí)間: 2025-3-30 16:07 作者: 諂媚于性 時(shí)間: 2025-3-30 19:37
Europe and the End of the Age of Innocencerine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the literature and its competitiveness is verified.作者: bioavailability 時(shí)間: 2025-3-31 00:26
An ILS-Based Metaheuristic for the Stacker Crane Problem,ractical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented.作者: 拍翅 時(shí)間: 2025-3-31 02:58
Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem,rine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the literature and its competitiveness is verified.作者: 煩擾 時(shí)間: 2025-3-31 07:13
https://doi.org/10.1007/978-3-642-29124-1evolutionary algorithm; genetic algorithm; hyper-heuristic; multi-objective optimization; stochastic opt作者: debouch 時(shí)間: 2025-3-31 12:16 作者: dialect 時(shí)間: 2025-3-31 13:28 作者: 明智的人 時(shí)間: 2025-3-31 20:23 作者: 鍍金 時(shí)間: 2025-4-1 01:18 作者: 牢騷 時(shí)間: 2025-4-1 02:40 作者: freight 時(shí)間: 2025-4-1 09:37 作者: 不可侵犯 時(shí)間: 2025-4-1 10:40 作者: Dignant 時(shí)間: 2025-4-1 18:10
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries paper a general heuristic to construct an initial feasible solution is proposed and compared with other construction methods. New route reconstruction heuristics are then shown to improve on this. These reconstruction heuristics look to reorder individual routes and recombine multiple routes to dec作者: 魯莽 時(shí)間: 2025-4-1 18:40
