標題: Titlebook: Handbook of Formal Optimization; Anand J. Kulkarni,Amir H. Gandomi Reference work 2024 Springer Nature Singapore Pte Ltd. 2024 Engineering [打印本頁] 作者: 使委屈 時間: 2025-3-21 19:15
書目名稱Handbook of Formal Optimization影響因子(影響力)
書目名稱Handbook of Formal Optimization影響因子(影響力)學(xué)科排名
書目名稱Handbook of Formal Optimization網(wǎng)絡(luò)公開度
書目名稱Handbook of Formal Optimization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Handbook of Formal Optimization被引頻次
書目名稱Handbook of Formal Optimization被引頻次學(xué)科排名
書目名稱Handbook of Formal Optimization年度引用
書目名稱Handbook of Formal Optimization年度引用學(xué)科排名
書目名稱Handbook of Formal Optimization讀者反饋
書目名稱Handbook of Formal Optimization讀者反饋學(xué)科排名
作者: vascular 時間: 2025-3-21 21:15 作者: 改變立場 時間: 2025-3-22 03:55 作者: Lignans 時間: 2025-3-22 08:25 作者: Reverie 時間: 2025-3-22 09:39 作者: Noctambulant 時間: 2025-3-22 15:24 作者: helper-T-cells 時間: 2025-3-22 20:01 作者: 松緊帶 時間: 2025-3-22 22:40
https://doi.org/10.1007/978-3-322-98510-1avior of a learning algorithm. However, the space of possible hyperparameters is usually vast, which is very common in practical application domains like prediction or classification in medical applications. Therefore, manually exploring all possible combinations is practically impossible. Then agai作者: 天真 時間: 2025-3-23 02:39
https://doi.org/10.1007/978-3-322-87670-6etect with the human eye. With the advent of digital media, it is imperative that robust ways to embed information are developed making it difficult for attackers to intercept. In this paper, a combination of Fuzzy Edge Detection and Cohort Intelligence (CI) is used to make the process of image hidi作者: faultfinder 時間: 2025-3-23 07:52
https://doi.org/10.1007/978-3-322-84794-2d on the density among objects in data. Given that DBSCAN is a proper tool for identifying outliers and clustering non-convex data, it can be used for automatic clustering of non-convex data and covered the weakness of most automatic clustering algorithms in not recognizing non-convex clusters. So, 作者: 運動吧 時間: 2025-3-23 11:10 作者: 蕁麻 時間: 2025-3-23 13:52
https://doi.org/10.1007/978-3-662-29448-2earch domain. Though many variations of classical VRP are being developed, there is still the need for developing algorithms to improve solutions for VRP. A hybrid gain-based ant colony optimization-firefly algorithm (GACO-FA) has been proposed to deal with VRP. A global search is initially performe作者: gangrene 時間: 2025-3-23 18:16 作者: 業(yè)余愛好者 時間: 2025-3-23 22:22
https://doi.org/10.1007/978-3-7091-7743-3rm Algorithm (SSA) and the Improved Salp Swarm Algorithm (ISSA). The efficiency of each algorithm for designing shallow foundations is examined through numerical examples of benchmark foundations subjected to uniaxial loads, axial and flexural loads, and axial and flexural loads with dynamic column 作者: 不能強迫我 時間: 2025-3-24 05:26 作者: FEAS 時間: 2025-3-24 08:38 作者: micronutrients 時間: 2025-3-24 14:16 作者: conference 時間: 2025-3-24 18:29 作者: 自然環(huán)境 時間: 2025-3-24 20:41 作者: 專心 時間: 2025-3-25 02:56
Optimal Allocation of Groundwater Resources in the Agricultural Sector Under Restrictive Policies onal expansion, and diminishing surface water availability due to recurring droughts and climate variations. This surge in groundwater usage has precipitated conflicts among various water user groups, notably between agricultural and environmental stakeholders. The primary goal of this chapter is to d作者: BATE 時間: 2025-3-25 03:25
Incorporating Nelder-Mead Simplex as an Accelerating Operator to Improve the Performance of Metaheurre commonly used for solving complex optimization problems. NMS is a search method that forms a simplex of points, iteratively transforming it to find the optimal solution. The incorporation of NMS in metaheuristic algorithms can significantly enhance the convergence speed and solution quality. The 作者: goodwill 時間: 2025-3-25 07:30
A Discrete Cuckoo Search Algorithm for the Cumulative Capacitated Vehicle Routing Probleme population properties of the cuckoo search algorithm, and its ability to progressively improve the solutions’ quality, with the strong effectiveness of greedy and heuristic algorithms. Unlike the original CS which was designed for solving continuous optimization problems, this implementation adapt作者: indenture 時間: 2025-3-25 14:52
Commonly Used Static and Dynamic Single-Objective Optimization Benchmark Problems to use a set of benchmark problems with different characteristics in order to evaluate the performance of algorithms designed for optimization problems. This allows researchers to examine how algorithms perform in different situations and what their strengths and weaknesses are. This chapter review作者: Comedienne 時間: 2025-3-25 18:52 作者: 騷動 時間: 2025-3-25 21:04
Steganography Based on Fuzzy Edge Detection, Cohort Intelligence, and Thresholdingetect with the human eye. With the advent of digital media, it is imperative that robust ways to embed information are developed making it difficult for attackers to intercept. In this paper, a combination of Fuzzy Edge Detection and Cohort Intelligence (CI) is used to make the process of image hidi作者: 休閑 時間: 2025-3-26 00:47 作者: 共同生活 時間: 2025-3-26 04:35
Multi-population Evolutionary and Swarm Intelligence Dynamic Optimization Algorithms: A Surveyptimization problems. In a dynamic optimization problem, the search space is affected by environmental changes over time. In multi-population evolutionary and swarm intelligence dynamic optimization algorithms, the number of sub-populations is a parameter determined either by the user or adaptively.作者: 不再流行 時間: 2025-3-26 08:55 作者: 梯田 時間: 2025-3-26 15:06 作者: 讓步 時間: 2025-3-26 16:52
Salp Swarm Algorithm for Optimization of Shallow Foundationsrm Algorithm (SSA) and the Improved Salp Swarm Algorithm (ISSA). The efficiency of each algorithm for designing shallow foundations is examined through numerical examples of benchmark foundations subjected to uniaxial loads, axial and flexural loads, and axial and flexural loads with dynamic column 作者: fiction 時間: 2025-3-26 23:51
Boosting the Efficiency of Metaheuristics Through Opposition-Based Learning in Optimum Locating of Cfor solving complex engineering problems. This chapter provides a comprehensive review of the literature on the use of opposition strategies in metaheuristic optimization algorithms, discussing the benefits and limitations of this approach. An overview of the opposition strategy concept, its various作者: 褲子 時間: 2025-3-27 04:22 作者: NOMAD 時間: 2025-3-27 05:27 作者: nurture 時間: 2025-3-27 12:11
https://doi.org/10.1007/978-3-322-84190-2armers. In this context, the formulation of a mathematical programming model aligned with the real world and considering its uncertainties is highly important. This chapter aims to present an appropriate mathematical programming model for decision-making in determining cropping patterns and optimal 作者: 脖子 時間: 2025-3-27 15:25
https://doi.org/10.1007/978-3-322-81609-2ing the strategies and policies employed for the effective management of groundwater resources. The findings from this review highlighted a predominant reliance on demand management policies compared to supply management policies in the management of groundwater resources across various basins. In t作者: 放氣 時間: 2025-3-27 18:14 作者: 膠水 時間: 2025-3-27 23:35
https://doi.org/10.1007/978-3-322-84794-2erated in the previous step. After each clustering, using correct data labels, and cluster centroids, the Calinski-Harabasz (CH) index is calculated. Finally, after passing some iterations of GFO algorithm, the best number of clusters is reported. In this study, three categories of data are used to 作者: 愛好 時間: 2025-3-28 02:57
https://doi.org/10.1007/978-3-476-99005-1putational resources, transmission of information from previous environments, and handling diversity loss. Based on this classification, researchers can have a better understanding of how these components make evolutionary and swarm intelligence algorithms capable of addressing the challenges of dyn作者: 神圣在玷污 時間: 2025-3-28 07:21 作者: 進步 時間: 2025-3-28 14:28
https://doi.org/10.1007/978-3-7091-7743-3ost was increased by only 62%. Comparing the best designs and convergence rates, the SSA was more efficient for designing a rectangular combined footing. However, the ISSA produced lower mean, median, and standard deviation values than the SSA. Results indicate the ISSA generated better designs for 作者: 粗糙 時間: 2025-3-28 14:38
Zur gegenw?rtigen Naturphilosophieorithms significantly enhances the quality and speed of the optimization process. This chapter aims to provide a clear understanding of the opposition strategy in metaheuristic optimization algorithms and its engineering applications, with the ultimate goal of facilitating its adoption in real-world作者: Arteriography 時間: 2025-3-28 20:36
https://doi.org/10.1007/978-3-642-88744-4y highlighting the importance of memory in metaheuristic performance and providing future research directions for improving memory mechanisms. The key takeaways are that memory mechanisms can significantly enhance the performance of metaheuristics by enabling them to explore and exploit the search s作者: JECT 時間: 2025-3-28 23:14
Solving Cropping Pattern Optimization Problems Using Robust Positive Mathematical?Programmingarmers. In this context, the formulation of a mathematical programming model aligned with the real world and considering its uncertainties is highly important. This chapter aims to present an appropriate mathematical programming model for decision-making in determining cropping patterns and optimal 作者: 遍及 時間: 2025-3-29 03:47 作者: BANAL 時間: 2025-3-29 07:52 作者: 護航艦 時間: 2025-3-29 15:25
Combination of Cooperative Grouper Fish?--?Octopus Algorithm and DBSCAN to Automatic Clusteringerated in the previous step. After each clustering, using correct data labels, and cluster centroids, the Calinski-Harabasz (CH) index is calculated. Finally, after passing some iterations of GFO algorithm, the best number of clusters is reported. In this study, three categories of data are used to 作者: 逢迎春日 時間: 2025-3-29 16:13
Multi-population Evolutionary and Swarm Intelligence Dynamic Optimization Algorithms: A Surveyputational resources, transmission of information from previous environments, and handling diversity loss. Based on this classification, researchers can have a better understanding of how these components make evolutionary and swarm intelligence algorithms capable of addressing the challenges of dyn作者: JAMB 時間: 2025-3-29 23:34 作者: 舔食 時間: 2025-3-30 02:46
Salp Swarm Algorithm for Optimization of Shallow Foundationsost was increased by only 62%. Comparing the best designs and convergence rates, the SSA was more efficient for designing a rectangular combined footing. However, the ISSA produced lower mean, median, and standard deviation values than the SSA. Results indicate the ISSA generated better designs for 作者: 為敵 時間: 2025-3-30 05:51 作者: calumniate 時間: 2025-3-30 11:53
Memory-Driven Metaheuristics: Improving?Optimization Performancey highlighting the importance of memory in metaheuristic performance and providing future research directions for improving memory mechanisms. The key takeaways are that memory mechanisms can significantly enhance the performance of metaheuristics by enabling them to explore and exploit the search s作者: 不愛防注射 時間: 2025-3-30 14:35
https://doi.org/10.1007/978-981-97-3820-5Engineering Optimization; Nature inspired Methods; Heuristics; Resource Optimization; Machine Learning; N作者: artifice 時間: 2025-3-30 16:50 作者: BABY 時間: 2025-3-30 22:17 作者: infringe 時間: 2025-3-31 03:28 作者: regale 時間: 2025-3-31 08:47
Reference work 2024-based optimization. This handbook is an excellent reference for experts and non-specialists alike, as it provides stimulating material. The book also covers research trends, challenges, and prospective topics, making it a valuable resource for those looking to expand their knowledge in this field..
