The main aim of this research is to introduce financing cost optimization and different financing alternatives. There are many studies about financing cost optimization. All previous studies considering the cost of financing have many shortcomings, some considered only one source of financing as a credit line without taking into account different financing alternatives. Having only one funding alternative powers, restricts contractors and leads to a very specific financing model. Although it is beneficial for the contractor to use a long-term loan to minimize interest charges and prevent a substantial withdrawal from his credit line, none of the existing financial-based planning models have considered long-term loans in

The maximization of the net present value of the investment in oil field improvements is greatly aided by the optimization of well location, which plays a significant role in the production of oil. However, using of optimization methods in well placement developments is exceedingly difficult since the well placement optimization scenario involves a large number of choice variables, objective functions, and restrictions. In addition, a wide variety of computational approaches, both traditional and unconventional, have been applied in order to maximize the efficiency of well installation operations. This research demonstrates how optimization approaches used in well placement have progressed since the last time they were examined. Fol

Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory char

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

Nuclear emission rates for nucleon-induced reactions are theoretically calculated based on the one-component exciton model that uses state density with non-Equidistance Spacing Model (non-ESM). Fair comparison is made from different state density values that assumed various degrees of approximation formulae, beside the zeroth-order formula corresponding to the ESM. Calculations were made for 96Mo nucleus subjected to (N,N) reaction at Emax=50 MeV. The results showed that the non-ESM treatment for the state density will significantly improve the emission rates calculated for various exciton configurations. Three terms might suffice a proper calculation, but the results kept changing even for ten terms. However, five terms is found to give

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

Researchers are increasingly using multimodal biometrics to strengthen the security of biometric applications. In this study, a strong multimodal human identification model was developed to address the growing problem of spoofing attacks in biometric security systems. Through the use of metaheuristic optimization methods, such as the Genetic Algorithm(GA), Ant Colony Optimization(ACO), and Particle Swarm Optimization (PSO) for feature selection, this unique model incorporates three biometric modalities: face, iris, and fingerprint. Image pre-processing, feature extraction, critical image feature selection, and multibiometric recognition are the four main steps in the workflow of the system. To determine its performance, the model wa