This paper presents a hybrid metaheuristic algorithm which is Harmony-Scatter Search (HSS). The HSS provides Scatter Search (SS) with random exploration for search space of problem and more of diversity and intensification for promising solutions. The SS and HSS have been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the HSS algorithm produce better performance than original Scatter Search algorithm. The HSS in the value of average fitness is 27.6% comparing with original SS. In other hand the elapsed time of HSS is larger than the original SS by small value. The developed algorithm has been compared with other algorithms for the same problem, and the result was competitive with some algorithm and insufficient with another.
Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to
The continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vecto
In this paper, analyzing the non-dimensional Magnesium-hydrodynamics problem Using nanoparticles in Jeffrey-Hamel flow (JHF) has been studied. The fundamental equations for this issue are reduced to a three-order ordinary differential equation. The current project investigated the effect of the angles between the plates, Reynolds number, nanoparticles volume fraction parameter, and magnetic number on the velocity distribution by using analytical technique known as a perturbation iteration scheme (PIS). The effect of these parameters is similar in the converging and diverging channels except magnetic number that it is different in the divergent channel. Furthermore, the resulting solutions with good convergence and high accuracy for the d
... Show MoreIn this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.
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
... Show MoreThroughput accounting is concerned with a throughput measurement process to determine the efficiency of the company, to know the problems and obstacles it suffers from, to determine their causes and ways to address them.The research problem is represented by the following question: does the application of a throughput accounting lead to maximizing the company's profits? The aim of the research is to demonstrate the importance of throughput accounting, which is one of the tools of management accounting in providing an efficient information system that provides the company’s management with the information it needs to improve its production processes, increase a throughput, and thus maxi
... Show MoreThe irony pushes us to inquire about what is in the text of contradiction, irony, suspense, and other acts of paradox, as well as a departure from what is logical, or familiar, that attracts the attention of the addressee, and this is what drives us to introspect the text and interrogate it in order to get to know the intended product of the text or its real or metaphorical intent. On the other hand, the irony is more in the literary text than in the scientific texts. Therefore, critics add the word literature to it in their definition.
As it is represented by the paradox, we will seek to study the paradox of the title and the problematic that it may pose as the beginning of the text, and i
... Show More