派博傳思國際中心

標(biāo)題: Titlebook: Hybrid Metaheuristics; 7th International Wo María J. Blesa,Christian Blum,Michael Sampels Conference proceedings 2010 The Editor(s) (if app [打印本頁]

作者: Detrusor-Muscle    時(shí)間: 2025-3-21 19:19
書目名稱Hybrid Metaheuristics影響因子(影響力)




書目名稱Hybrid Metaheuristics影響因子(影響力)學(xué)科排名




書目名稱Hybrid Metaheuristics網(wǎng)絡(luò)公開度




書目名稱Hybrid Metaheuristics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Hybrid Metaheuristics被引頻次




書目名稱Hybrid Metaheuristics被引頻次學(xué)科排名




書目名稱Hybrid Metaheuristics年度引用




書目名稱Hybrid Metaheuristics年度引用學(xué)科排名




書目名稱Hybrid Metaheuristics讀者反饋




書目名稱Hybrid Metaheuristics讀者反饋學(xué)科排名





作者: mosque    時(shí)間: 2025-3-21 22:39
Viet-Phuong Nguyen,Christian Prins,Caroline Prodhontive zum Themenbereich ?Bildung und Migration“ entwickelt, die in erster Linie in seinem Begriff der institutionellen Diskriminierung fundiert ist. Diese Perspektive ist im Rahmen der so genannten ?Interkulturellen P?dagogik“, die im deutschen Sprachraum meistens als für diesen Themenbereich ma?gebl
作者: 違抗    時(shí)間: 2025-3-22 02:29

作者: 金桌活畫面    時(shí)間: 2025-3-22 05:16

作者: placebo-effect    時(shí)間: 2025-3-22 12:34

作者: neutral-posture    時(shí)間: 2025-3-22 14:02
Serban Iordachempetenzen von Zehn- oder 15-J?hrigen (und die Unterschiede in den Leistungen) werden nicht alleine durch den Unterricht bedingt. Tats?chlich wirken zahlreiche weitere Faktoren auf die Kompetenzentwicklung ein (Elternhaus, Besonderheiten der jeweiligen Schule, curriculare Rahmenbedingungen, Lehrerbil
作者: 顯示    時(shí)間: 2025-3-22 18:46

作者: commune    時(shí)間: 2025-3-22 22:19

作者: Asparagus    時(shí)間: 2025-3-23 02:19

作者: fledged    時(shí)間: 2025-3-23 06:19
A Hybrid Metaheuristic for the Longest Common Subsequence Problem,s contribution proposes an integrative hybrid metaheuristic for this problem. More specifically, we propose a variable neighborhood search that applies an iterated greedy algorithm in the improvement phase and generates the starting solutions by invoking either beam search or a greedy randomized pro
作者: 記成螞蟻    時(shí)間: 2025-3-23 12:56
Hybrid Algorithms for the Variable Sized Bin Packing Problem,a set of items with given weights have to be packed into a minimum-cost set of bins of variable sizes and costs. First we propose a heuristic and a beam search approach. Both algorithms are strongly based on dynamic programming procedures and lower bounding techniques. Second, we propose a variable
作者: Cognizance    時(shí)間: 2025-3-23 14:55
A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model,titor. The firm aims at finding the location and attractiveness of each facility to be opened so as to maximize its profit. The competitor, on the other hand, can react by adjusting the attractiveness of its existing facilities, opening new facilities and/or closing existing ones with the objective
作者: 客觀    時(shí)間: 2025-3-23 21:56
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem,vice industries. The issue is to find a minimum number of shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requirements is minimized..We tackle this problem by means of a hybrid strategy in the spirit of Large Neighbor
作者: ATRIA    時(shí)間: 2025-3-24 00:24
A New Approach for Solving the Generalized Traveling Salesman Problem,as many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem. Based on this approach we describe a novel hybrid metaheuristic algorithm for solving the problem using genetic algorithms. Computational results are reported for Euclid
作者: Gourmet    時(shí)間: 2025-3-24 04:11
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem,sources. They increase and decrease in quantity according to the activated tasks and are not bounded like other project scheduling problems. This paper presents a new mathematical formulation for DRCPSP as well as two hybrid heuristics merging an evolutionary algorithm with an exact approach. Comput
作者: 厭惡    時(shí)間: 2025-3-24 06:42
A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem, (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation betwe
作者: aplomb    時(shí)間: 2025-3-24 13:49

作者: Anecdote    時(shí)間: 2025-3-24 17:25

作者: 辭職    時(shí)間: 2025-3-24 20:38
An Improved Memetic Algorithm for Break Scheduling, e.g. in air traffic control and other fields where supervision personnel is working. The objective is to assign breaks to employees such that various constraints reflecting legal demands or ergonomic criteria are satisfied and staffing requirement violations are minimised..In our previous work we p
作者: chemical-peel    時(shí)間: 2025-3-24 23:59
Consultant-Guided Search Algorithms for the Quadratic Assignment Problem,ake decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes
作者: 袋鼠    時(shí)間: 2025-3-25 05:53
On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An ity checks. We examine the case of the vehicle routing problem with two-dimensional loading constraints, which combines the loading of freight into the vehicles and the routing of the vehicles to satisfy the demands of the customers. The problem is solved by a variable neighborhood search for the ro
作者: PATHY    時(shí)間: 2025-3-25 10:53
Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periogeneral periodic LRP (PLRP). For this, previous successful VNS algorithms for related problems are considered and accordingly adapted as well as extended. The VNS is subsequently combined with three very large neighborhood searches (VLNS) based on integer linear programming: Two operate on whole rou
作者: Emg827    時(shí)間: 2025-3-25 12:53

作者: membrane    時(shí)間: 2025-3-25 18:02

作者: 巨碩    時(shí)間: 2025-3-25 23:43
978-3-642-16053-0The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer-Verlag GmbH, DE
作者: 毀壞    時(shí)間: 2025-3-26 02:28
Hybrid Metaheuristics978-3-642-16054-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
作者: 鉤針織物    時(shí)間: 2025-3-26 06:37
0302-9743 Overview: 978-3-642-16053-0978-3-642-16054-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
作者: 無動(dòng)于衷    時(shí)間: 2025-3-26 10:21
https://doi.org/10.1007/978-3-642-16054-7Scheduling; algorithms; bioinformatics; co-operative search; design; empirical comparison; expert systems;
作者: 拋射物    時(shí)間: 2025-3-26 16:15
Survey: Matheuristics for Rich Vehicle Routing Problems,This paper surveys recent developments of hybrid solution techniques for different vehicle routing problems. Only hybridizations of heuristic and exact solution techniques are considered. Most of the existing hybrid approaches are based on set-covering formulations, local branching or different decomposition techniques.
作者: CURT    時(shí)間: 2025-3-26 18:52

作者: Agility    時(shí)間: 2025-3-26 20:57

作者: Intercept    時(shí)間: 2025-3-27 01:10

作者: Overthrow    時(shí)間: 2025-3-27 08:34
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem,r presents a new mathematical formulation for DRCPSP as well as two hybrid heuristics merging an evolutionary algorithm with an exact approach. Computational results show that both hybrid heuristics present better results than the state-of-the-art algorithm for DRCPSP does. The proposed formulation also provides better bounds.
作者: 重力    時(shí)間: 2025-3-27 10:48

作者: disparage    時(shí)間: 2025-3-27 16:18
Hybrid Algorithms for the Variable Sized Bin Packing Problem,neighborhood search approach where some neighborhoods are also based on dynamic programming. The best results are obtained by using the solutions provided by the proposed heuristic as starting solutions for variable neighborhood search. The results show that this algorithm is very competitive with current state-of-the-art approaches.
作者: 無能性    時(shí)間: 2025-3-27 18:47
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem,hood Search, which exploits a set of Local Search operators that resort to a Constraint Programming model for assigning breaks. We test this strategy on a set of random and real life instances employed in the literature.
作者: oxidize    時(shí)間: 2025-3-27 23:33

作者: thalamus    時(shí)間: 2025-3-28 06:10
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem,he problem, so that integrality gap is reduced. The results obtained on two sets of the large scale multidimensional knapsack problem instances are comparable with the current state-of-the-art heuristics. Moreover, a few best known results are reported for some large, long-studied instances.
作者: Deduct    時(shí)間: 2025-3-28 08:41
Consultant-Guided Search Algorithms for the Quadratic Assignment Problem, of problems. In this paper, we propose an algorithm for the Quadratic Assignment Problem (QAP), which hybridizes CGS with a local search procedure. Our experimental results show that CGS is able to compete in terms of solution quality with one of the best Ant Colony Optimization algorithms, the MAX-MIN Ant System.
作者: 親密    時(shí)間: 2025-3-28 11:10
SearchCol: Metaheuristic Search by Column Generation,e optimal solution (primal and dual) to the MH which returns a (incumbent) solution used for defining the (perturbed) CG problem of the next iteration. We describe the SearchCol framework and a general SearchCol algorithm based on local search.
作者: Melodrama    時(shí)間: 2025-3-28 16:38

作者: 變態(tài)    時(shí)間: 2025-3-28 19:47

作者: Fecundity    時(shí)間: 2025-3-29 00:16
Christian Schauer,Matthias Prandtstetter,Günther R. Raidl, tun sie sich in der Regel ausgesprochen schwer mit der rekonstruktiv-normativen und gesellschaftskritischen Ausrichtung der sozialphilosophischen Anerkennungstheorie – und sie versuchen, diese Ausrichtung auf unterschiedlichen Wegen zu umgehen. Die Erziehungswissenschaft ist ja als ein dezidiert a
作者: 信任    時(shí)間: 2025-3-29 04:45
Sa?d Hanafi,Jasmina Lazi?,Nenad Mladenovi?,Christophe Wilbaut,Igor Crévits, tun sie sich in der Regel ausgesprochen schwer mit der rekonstruktiv-normativen und gesellschaftskritischen Ausrichtung der sozialphilosophischen Anerkennungstheorie – und sie versuchen, diese Ausrichtung auf unterschiedlichen Wegen zu umgehen. Die Erziehungswissenschaft ist ja als ein dezidiert a
作者: 分開如此和諧    時(shí)間: 2025-3-29 08:23
Magdalena Widl,Nysret Muslius dieser Ansatz für das Verst?ndnis der Bildungslage von Kindern und Jugendlichen aus Migrantenfamilien wissenschaftlich unzul?nglich ist, und dass er in politischer Hinsicht oft selbst – wenn auch unbeabsichtigt – zur Stigmatisierung dieser Kinder und Jugendlichen beitr?gt.
作者: Pseudoephedrine    時(shí)間: 2025-3-29 13:09

作者: Inordinate    時(shí)間: 2025-3-29 18:14

作者: 多嘴多舌    時(shí)間: 2025-3-29 22:48

作者: 祖?zhèn)髫?cái)產(chǎn)    時(shí)間: 2025-3-29 23:53

作者: cortex    時(shí)間: 2025-3-30 04:20

作者: gregarious    時(shí)間: 2025-3-30 08:55
An Improved Memetic Algorithm for Break Scheduling,essed. We compare our algorithm to state of the art results on a set of existing real life and randomly generated instances. Our new algorithm returns improved results on 28 out of the 30 benchmark instances. To the best of our knowledge, these results constitute current upper bounds for the respect
作者: perpetual    時(shí)間: 2025-3-30 16:11
On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An and exact solution of the loading subproblem is investigated; experiments show that solving exactly hard subproblems can lead to better solution quality over the whole solution process. iii) New best results are presented on existing benchmark instances.
作者: 使人煩燥    時(shí)間: 2025-3-30 17:51
Karl F. Doerner,Verena Schmidechtigkeit um eine Auseinandersetzung mit alternativen empirischen – insbesondere hermeneutischen – Zugriffen auf Prozesse der Reproduktion von Ungleichheit im Bildungssystem und deren normative Rechtfertigungen978-3-531-18424-1978-3-531-19043-3




歡迎光臨 派博傳思國際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
长沙市| 阜康市| 东海县| 威海市| 通渭县| 武冈市| 阳城县| 马公市| 泾阳县| 大足县| 叙永县| 酒泉市| 林甸县| 宣化县| 尚志市| 静海县| 乌苏市| 公主岭市| 云林县| 阿拉尔市| 东安县| 吉安市| 麻阳| 曲水县| 静乐县| 江口县| 江西省| 银川市| 浠水县| 建平县| 巧家县| 莱阳市| 千阳县| 望江县| 年辖:市辖区| 文昌市| 甘德县| 象山县| 宣恩县| 宿迁市| 闽清县|