The Combined Economic Emission Dispatch (CEED) problem is crucial for optimizing power system operation by minimizing costs and emissions while ensuring grid stability and meeting demand. This paper addresses the complex, nonlinear, and nonconvex nature of CEED, arising from factors like valve-point effects and transmission losses, which necessitates efficient metaheuristic algorithms. We introduce an Improved Zebra Optimization Algorithm (IMZOA), an enhanced bio-inspired technique integrating advanced adaptive foraging and dynamic defense mechanisms, along with a cubic function for CEED modeling, to improve search efficiency and convergence. IMZOA demonstrates significant numerical improvements, achieving up to a 0.80 % cost reduction for

Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s

The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

Carbon nanotubes were prepared by an arc-discharge method,
under different values of pressure of oxygen gas. The structure of
multi-walled carbon nanotubes powders has been characterized by
low-angle X-ray diffraction .The morphology of carbon nanotube
powder was examined by transmission electron microscope. The
capacitance-voltage and current- voltage (dark and illumination
current) characterization were measured under different values of
pressure (10-3, 10-4, 10-5) mbar of oxygen gas

This paper presents the matrix completion problem for image denoising. Three problems based on matrix norm are performing: Spectral norm minimization problem (SNP), Nuclear norm minimization problem (NNP), and Weighted nuclear norm minimization problem (WNNP). In general, images representing by a matrix this matrix contains the information of the image, some information is irrelevant or unfavorable, so to overcome this unwanted information in the image matrix, information completion is used to comperes the matrix and remove this unwanted information. The unwanted information is handled by defining {0,1}-operator under some threshold. Applying this operator on a given ma

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

DBN Rashid, IMPAT: International Journal of Research in Humanities, Arts, and Literature, 2016 - Cited by 5