標(biāo)題: Titlebook: Applied Simulated Annealing; René V. V. Vidal (Professor in Operations Research Book 1993 Springer-Verlag Berlin Heidelberg 1993 Addition. [打印本頁(yè)] 作者: Randomized 時(shí)間: 2025-3-21 18:04
書目名稱Applied Simulated Annealing影響因子(影響力)
作者: Allure 時(shí)間: 2025-3-21 20:20
https://doi.org/10.1007/978-3-642-46787-5Addition; Operations Research; Optimierung; Optimization; Sim; Simulated Annealing; Unternehmensforschung; 作者: Confess 時(shí)間: 2025-3-22 00:39 作者: Consensus 時(shí)間: 2025-3-22 06:06 作者: Anonymous 時(shí)間: 2025-3-22 09:02 作者: 無(wú)法破譯 時(shí)間: 2025-3-22 16:15 作者: 一小塊 時(shí)間: 2025-3-22 17:13
https://doi.org/10.1007/978-3-030-66384-1natorial problem seeks to assign “n” facilities to “n” locations so that the total flow will be minimized. This problem has many practical applications..The five algorithms are the combination of different known strategies to design simulated annealing algorithms. These strategies are mainly related作者: CREEK 時(shí)間: 2025-3-22 23:55 作者: progestin 時(shí)間: 2025-3-23 02:54 作者: 獸群 時(shí)間: 2025-3-23 08:03
János Mika,Erika Pénzesné Kónyae main objective is to minimise the number of classes needed in order to allocate each student to a class at a time which he or she can attend, subject to a capacity constraint on the computer laboratory. This problem is encountered each year in the European Business Management School at Swansea Uni作者: 剛毅 時(shí)間: 2025-3-23 10:31 作者: Rinne-Test 時(shí)間: 2025-3-23 14:51 作者: ODIUM 時(shí)間: 2025-3-23 21:08 作者: 無(wú)能力 時(shí)間: 2025-3-23 23:24 作者: 洞穴 時(shí)間: 2025-3-24 03:08
Wing Yin Mo,Yu Bon Man,Ming Hung Wongroblem was formulated in connection with discussions both in Denmark and in the EEC related to the optimal utilization of land. These discussions ended with a decision of increasing the amount of forest surface in Denmark. In addition, two Decision Support Systems to solve the above mentioned proble作者: perimenopause 時(shí)間: 2025-3-24 09:01 作者: 可用 時(shí)間: 2025-3-24 14:21 作者: 精密 時(shí)間: 2025-3-24 17:09
Shikui Dong,Nakul Chettri,Eklabya Sharma in N disjoint subintervals, so that a criterion function is maximized (or minimized)..In this paper, we are dealing with the discrete version of this problem. This optimization problem has many applications as for instance in: inventory control, statistics, standardization, lot sizing, production p作者: Expostulate 時(shí)間: 2025-3-24 22:13 作者: cajole 時(shí)間: 2025-3-25 02:42 作者: Gorilla 時(shí)間: 2025-3-25 05:29
Xiaohong Liu,Alan C. McKinnon,Ning Weial problem (the afforestation problem, see Paper 11 in this volume). I was very sceptical that such a simple algorithm would work. I argued for the design of a more traditional heuristic approach. This skepticism changed to enthusiasm as the first real problem was readily solved using S.A.. At prese作者: 營(yíng)養(yǎng) 時(shí)間: 2025-3-25 10:49 作者: 包庇 時(shí)間: 2025-3-25 14:51
Wing Yin Mo,Yu Bon Man,Ming Hung Wongs of nuclear fuel have to be grouped in subsets that are as homogeneous as possible with respect to several criteria. The two algorithms are compared on real data and the sensitivity to parameter choice is explored.作者: 巧辦法 時(shí)間: 2025-3-25 17:00
Lecture Notes in Economics and Mathematical Systemshttp://image.papertrans.cn/b/image/160134.jpg作者: endoscopy 時(shí)間: 2025-3-25 20:23 作者: justify 時(shí)間: 2025-3-26 04:03
0075-8442 - mark, 1992, p. 92). This dissertation presents retrospectively my central contributions to the theoretical and applied aspects of optimization. When I had finished my thesis I became interested in editing a volume related to a new expanding area of applied optimization. I considered several approa作者: 鉆孔 時(shí)間: 2025-3-26 06:43
M. N. V. Prasad,Woranan Nakbanpotematical programming (combinatorial optimization), statistics (neural networks), operations research (heuristic approaches), etc. Obviously, these are only some selected examples. In this volume we are focusing on the application of the S.A. approach to combinatorial optimization problems.作者: Magnificent 時(shí)間: 2025-3-26 08:30
https://doi.org/10.1007/978-3-030-66384-1e problem. We describe experiences with a preliminary version of the algorithm, and we describe aspects of the development of a commercially available package for use in the Danish primary schools for solution of the timetabling problem.作者: monogamy 時(shí)間: 2025-3-26 14:11 作者: Interlocking 時(shí)間: 2025-3-26 18:37
Xiaohong Liu,Alan C. McKinnon,Ning Weisign of a more traditional heuristic approach. This skepticism changed to enthusiasm as the first real problem was readily solved using S.A.. At present, I am convinced that the S.A. method is widely usable and it has become a must in any optimization tool-box as is the case of linear programming, dynamic programming, maximum principles, etc.作者: dominant 時(shí)間: 2025-3-26 22:53 作者: pacifist 時(shí)間: 2025-3-27 01:48
Timetabling by Simulated Annealing,e problem. We describe experiences with a preliminary version of the algorithm, and we describe aspects of the development of a commercially available package for use in the Danish primary schools for solution of the timetabling problem.作者: 廣大 時(shí)間: 2025-3-27 08:00
Design of a Teleprocessing Communication Network Using Simulated Annealing,our generation strategy. Several test examples are reported, and the approach yields better results than known algorithms based on graph theory and mathematical programming. Finally, a case study from Denmark is briefly presented.作者: CLASP 時(shí)間: 2025-3-27 13:22
Final Remarks,sign of a more traditional heuristic approach. This skepticism changed to enthusiasm as the first real problem was readily solved using S.A.. At present, I am convinced that the S.A. method is widely usable and it has become a must in any optimization tool-box as is the case of linear programming, dynamic programming, maximum principles, etc.作者: cipher 時(shí)間: 2025-3-27 16:09 作者: Anguish 時(shí)間: 2025-3-27 17:50 作者: Hectic 時(shí)間: 2025-3-28 01:40 作者: 浪蕩子 時(shí)間: 2025-3-28 04:02 作者: tinnitus 時(shí)間: 2025-3-28 08:23 作者: 乳白光 時(shí)間: 2025-3-28 13:28 作者: EWER 時(shí)間: 2025-3-28 15:40
,Optimal Partition of an Interval — The Discrete Version,lem. We have implemented two general approaches to solve this problem: simulated annealing and dynamic programming. Extensive tests and numerical experiences will be reported. A well-known problem of optimal choice of sizes has been used as a case-study.作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-28 21:51 作者: 非實(shí)體 時(shí)間: 2025-3-29 01:52 作者: 有特色 時(shí)間: 2025-3-29 05:28 作者: Crohns-disease 時(shí)間: 2025-3-29 08:09
https://doi.org/10.1007/978-94-007-7122-2technique. We compare its results with those obtained with a classical Lagrangian relaxation algorithm. Lastly, we briefly describe a practical operational study: the optimization of the “Fran?aise des Jeux” network having more than ten thousand terminals.作者: Chandelier 時(shí)間: 2025-3-29 14:33
Wing Yin Mo,Yu Bon Man,Ming Hung Wongm will be discussed. The first system has been implemented in a main frame while the second one has been implemented in a PC-environment. A central element in the problem solving process is the simulated annealing algorithm. The implemented heuristic am proaches will be described. Finally, our numerical experiences will be shortly reported.作者: 凝視 時(shí)間: 2025-3-29 15:43
Shikui Dong,Nakul Chettri,Eklabya Sharmae configurations. A (practical) way to solve the problem is to use the simulated annealing algorithm. Due to the lattice structure of an image it is possible to increase the speed of the annealing and some methods are discussed. Finally two examples are shown.作者: 實(shí)現(xiàn) 時(shí)間: 2025-3-29 21:12 作者: 急性 時(shí)間: 2025-3-30 00:09 作者: 冒號(hào) 時(shí)間: 2025-3-30 05:22
Using Simulated annealing to solve concentrator location problems in telecommunication networks,technique. We compare its results with those obtained with a classical Lagrangian relaxation algorithm. Lastly, we briefly describe a practical operational study: the optimization of the “Fran?aise des Jeux” network having more than ten thousand terminals.作者: 間諜活動(dòng) 時(shí)間: 2025-3-30 12:02
Solving the Afforestation Problem,m will be discussed. The first system has been implemented in a main frame while the second one has been implemented in a PC-environment. A central element in the problem solving process is the simulated annealing algorithm. The implemented heuristic am proaches will be described. Finally, our numerical experiences will be shortly reported.作者: Gourmet 時(shí)間: 2025-3-30 15:37 作者: Lumbar-Stenosis 時(shí)間: 2025-3-30 18:58
M. N. V. Prasad,Woranan Nakbanpotend Thermodynamics contexts, and derive a method for thermal equilibrium identification. With basis on this result, we propose an adaptive annealing schedule and present a report of its application to a different combinatorial optimization problem.作者: DRAFT 時(shí)間: 2025-3-30 23:36
János Mika,Erika Pénzesné Kónyalgorithm in which the cost function is updated as new information becomes available during the search is developed. Computational experience based on real data from the last two years shows that this algorithm is flexible enough to deal effectively with both primary and secondary objectives.作者: 賠償 時(shí)間: 2025-3-31 04:10 作者: 人類學(xué)家 時(shí)間: 2025-3-31 05:20 作者: 粉筆 時(shí)間: 2025-3-31 10:40 作者: Phenothiazines 時(shí)間: 2025-3-31 14:25
Problem Independent Distributed Simulated Annealing and its Applications,orithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known..In this paper, we present a problem independent general purpose parallel implementation of simulated annealing on large distributed memo作者: 妨礙 時(shí)間: 2025-3-31 19:30 作者: 開(kāi)花期女 時(shí)間: 2025-3-31 23:26 作者: indoctrinate 時(shí)間: 2025-4-1 02:13
A Computational Comparison of Simulated Annealing and Tabu Search Applied to the Quadratic Assignmeroblems, e.g scheduling problems, the traveling salesman problem and the quadratic assignment problem (QAP). In this paper, the applications of simulated annealing and tabu search to the QAP are introduced, investigated and compared..Several improvements of the two heuristics are proposed, and their作者: phlegm 時(shí)間: 2025-4-1 06:57
