Journal of Optimization最新文献_第2页

Optimization for the Redundancy Allocation Problem of Reliability Using an Improved Particle Swarm Optimization Algorithm 基于改进粒子群算法的可靠性冗余分配优化

IF 4

Journal of Optimization Pub Date : 2021-11-23 DOI: 10.1155/2021/6385713

H. Marouani

引用次数: 8

Optimum Design and Performance Analyses of Convective-Radiative Cooling Fin under the Influence of Magnetic Field Using Finite Element Method 磁场影响下对流辐射散热片优化设计及性能有限元分析

IF 4

Journal of Optimization Pub Date : 2019-02-17 DOI: 10.1155/2019/9705792

M. Sobamowo

{"title":"Optimum Design and Performance Analyses of Convective-Radiative Cooling Fin under the Influence of Magnetic Field Using Finite Element Method","authors":"M. Sobamowo","doi":"10.1155/2019/9705792","DOIUrl":"https://doi.org/10.1155/2019/9705792","url":null,"abstract":"In this study, the optimum design dimensions and performance analyses of convective-radiative cooling fin subjected to magnetic field are presented using finite element method. The numerical solutions are verified by the exact analytical solution for the linearized models using Laplace transform. The optimum dimensions for the optimum performance of the convection-radiative fin with variable thermal conductivity are investigated and presented graphically. Also, the effects of convective, radiative, and magnetic parameters as well as Biot number on the thermal performance of the cooling fin are analyzed using the numerical solutions. From the results, it is established that the optimum length of the fin and the thermogeometric parameter increases as the nonlinear thermal conductivity term increases. Further analyses also reveal that as the Biot number, convective, radiative, and magnetic parameters, increases, the rate of heat transfer from the fin increases and consequently improves the efficiency of the fin. Additionally, effects of the thermal stability values for the various multiboiling heat transfer modes are established. It is established that, in order to ensure stability and avoid numerical diffusion of the solution by the Galerkin finite element method, the thermogeometric parameter must not exceed some certain values for the different multiboiling heat transfer modes. It is hope that the present study will enhance the understanding of thermal response of solid fin under various factors and fin design considerations.","PeriodicalId":42964,"journal":{"name":"Journal of Optimization","volume":null,"pages":null},"PeriodicalIF":4.0,"publicationDate":"2019-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83330932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Theoretical Analysis of an Imprecise Prey-Predator Model with Harvesting and Optimal Control 具有收获和最优控制的不精确捕食-捕食模型的理论分析

IF 4

Journal of Optimization Pub Date : 2019-01-21 DOI: 10.1155/2019/9512879

Anjana P. Das, M. Pal

引用次数: 15

Extended GRASP-Capacitated K-Means Clustering Algorithm to Establish Humanitarian Support Centers in Large Regions at Risk in Mexico 扩展grip - capacitated K-Means聚类算法在墨西哥大风险地区建立人道主义支持中心

IF 4

Journal of Optimization Pub Date : 2018-12-20 DOI: 10.1155/2018/3605298

S. Caballero-Morales, Erika Barojas-Payán, Diana Sánchez-Partida, J. Martínez-Flores

{"title":"Extended GRASP-Capacitated K-Means Clustering Algorithm to Establish Humanitarian Support Centers in Large Regions at Risk in Mexico","authors":"S. Caballero-Morales, Erika Barojas-Payán, Diana Sánchez-Partida, J. Martínez-Flores","doi":"10.1155/2018/3605298","DOIUrl":"https://doi.org/10.1155/2018/3605298","url":null,"abstract":"Mexico is located within the so-called Fire Belt which makes it susceptible to earthquakes. In fact, two-thirds of the Mexican territory have a significant seismic risk. On the other hand, the country’s location in the tropical zone makes it susceptible to hurricanes which are generated in both the Pacific and Atlantic Oceans. Due to these situations, each year many communities are affected by diverse natural disasters in Mexico and efficient logistic systems are required to provide prompt support. This work is aimed at providing an efficient metaheuristic to determine the most appropriate location for support centers in the State of Veracruz, which is one of the most affected regions in Mexico. The metaheuristic is based on the K-Means Clustering (KMC) algorithm which is extended to integrate (a) the associated capacity restrictions of the support centers, (b) a micro Genetic Algorithm μGA to estimate a search interval for the most suitable number of support centers, (c) variable number of assigned elements to centers in order to add flexibility to the assignation task, and (d) random-based decision model to further improve the final assignments. These extensions on the KMC algorithm led to the GRASP-Capacitated K-Means Clustering (GRASP-CKMC) algorithm which was able to provide very suitable solutions for the establishment of 260 support centers for 3837 communities at risk in Veracruz, Mexico. Validation of the GRASP-CKMC algorithm was performed with well-known test instances and metaheuristics. The validation supported its suitability as alternative to standard metaheuristics such as Capacitated K-Means (CKM), Genetic Algorithms (GA), and Variable Neighborhood Search (VNS).","PeriodicalId":42964,"journal":{"name":"Journal of Optimization","volume":null,"pages":null},"PeriodicalIF":4.0,"publicationDate":"2018-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84316975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 13

Topology-Aware Strategy for MPI-IO Operations in Clusters 集群中MPI-IO操作的拓扑感知策略

IF 4

Journal of Optimization Pub Date : 2018-11-19 DOI: 10.1155/2018/2068490

Weifeng Liu, Jie Zhou, Meng Guo

引用次数: 4

Jaya Algorithm Guided Procedure to Segment Tumor from Brain MRI Jaya算法指导脑MRI肿瘤分割

IF 4

Journal of Optimization Pub Date : 2018-11-14 DOI: 10.1155/2018/3738049

S. Satapathy, V. Rajinikanth

引用次数: 45

HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle HybridHAM:一种寻找哈密顿循环的新型混合启发式算法

IF 4

Journal of Optimization Pub Date : 2018-10-16 DOI: 10.1155/2018/9328103

K. R. Seeja

{"title":"HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle","authors":"K. R. Seeja","doi":"10.1155/2018/9328103","DOIUrl":"https://doi.org/10.1155/2018/9328103","url":null,"abstract":"Hamiltonian Cycle Problem is one of the most explored combinatorial problems. Being an NP-complete problem, heuristic approaches are found to be more powerful than exponential time exact algorithms. This paper presents an efficient hybrid heuristic that sits in between the complex reliable approaches and simple faster approaches. The proposed algorithm is a combination of greedy, rotational transformation and unreachable vertex heuristics that works in three phases. In the first phase, an initial path is created by using greedy depth first search. This initial path is then extended to a Hamiltonian path in second phase by using rotational transformation and greedy depth first search. Third phase converts the Hamiltonian path into a Hamiltonian cycle by using rotational transformation. The proposed approach could find Hamiltonian cycles from a set of hard graphs collected from the literature, all the Hamiltonian instances (1000 to 5000 vertices) given in TSPLIB, and some instances of FHCP Challenge Set. Moreover, the algorithm has O(n3) worst case time complexity. The performance of the algorithm has been compared with the state-of-the-art algorithms and it was found that HybridHAM outperforms others in terms of running time.","PeriodicalId":42964,"journal":{"name":"Journal of Optimization","volume":null,"pages":null},"PeriodicalIF":4.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87716686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Asymptotics for Optimal Design Problems for the Schrödinger Equation with a Potential 带势Schrödinger方程最优设计问题的渐近性

IF 4

Journal of Optimization Pub Date : 2018-10-08 DOI: 10.1155/2018/8162845

Alden Waters, Ekaterina Merkurjev

引用次数: 0

Optimizing Testing-Resource Allocation Using Architecture-Based Software Reliability Model 基于体系结构的软件可靠性模型优化测试资源分配

IF 4

Journal of Optimization Pub Date : 2018-09-27 DOI: 10.1155/2018/6948656

H. Okamura, T. Dohi

引用次数: 3

A New Modified Three-Term Hestenes–Stiefel Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence 一种新的改进的具有充分下降性质的三项Hestenes-Stiefel共轭梯度法及其全局收敛性

IF 4

Journal of Optimization Pub Date : 2018-09-27 DOI: 10.1155/2018/5057096

B. Baluch, Z. Salleh, Ahmad Alhawarat

{"title":"A New Modified Three-Term Hestenes–Stiefel Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence","authors":"B. Baluch, Z. Salleh, Ahmad Alhawarat","doi":"10.1155/2018/5057096","DOIUrl":"https://doi.org/10.1155/2018/5057096","url":null,"abstract":"This paper describes a modified three-term Hestenes–Stiefel (HS) method. The original HS method is the earliest conjugate gradient method. Although the HS method achieves global convergence using an exact line search, this is not guaranteed in the case of an inexact line search. In addition, the HS method does not usually satisfy the descent property. Our modified three-term conjugate gradient method possesses a sufficient descent property regardless of the type of line search and guarantees global convergence using the inexact Wolfe–Powell line search. The numerical efficiency of the modified three-term HS method is checked using 75 standard test functions. It is known that three-term conjugate gradient methods are numerically more efficient than two-term conjugate gradient methods. Importantly, this paper quantifies how much better the three-term performance is compared with two-term methods. Thus, in the numerical results, we compare our new modification with an efficient two-term conjugate gradient method. We also compare our modification with a state-of-the-art three-term HS method. Finally, we conclude that our proposed modification is globally convergent and numerically efficient.","PeriodicalId":42964,"journal":{"name":"Journal of Optimization","volume":null,"pages":null},"PeriodicalIF":4.0,"publicationDate":"2018-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89274856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11