Binary Algorithm Research Articles

An efficient decision support system for leukemia identification utilizing nature-inspired deep feature optimization.

In the field of medicine, decision support systems play a crucial role by harnessing cutting-edge technology and data analysis to assist doctors in disease diagnosis and treatment. Leukemia is a malignancy that emerges from the uncontrolled growth of immature white blood cells within the human body. An accurate and prompt diagnosis of leukemia is desired due to its swift progression to distant parts of the body. Acute lymphoblastic leukemia (ALL) is an aggressive type of leukemia that affects both children and adults. Computer vision-based identification of leukemia is challenging due to structural irregularities and morphological similarities of blood entities. Deep neural networks have shown promise in extracting valuable information from image datasets, but they have high computational costs due to their extensive feature sets. This work presents an efficient pipeline for binary and subtype classification of acute lymphoblastic leukemia. The proposed method first unveils a novel neighborhood pixel transformation method using differential evolution to improve the clarity and discriminability of blood cell images for better analysis. Next, a hybrid feature extraction approach is presented leveraging transfer learning from selected deep neural network models, InceptionV3 and DenseNet201, to extract comprehensive feature sets. To optimize feature selection, a customized binary Grey Wolf Algorithm is utilized, achieving an impressive 80% reduction in feature size while preserving key discriminative information. These optimized features subsequently empower multiple classifiers, potentially capturing diverse perspectives and amplifying classification accuracy. The proposed pipeline is validated on publicly available standard datasets of ALL images. For binary classification, the best average accuracy of 98.1% is achieved with 98.1% sensitivity and 98% precision. For ALL subtype classifications, the best accuracy of 98.14% was attained with 78.5% sensitivity and 98% precision. The proposed feature selection method shows a better convergence behavior as compared to classical population-based meta-heuristics. The suggested solution also demonstrates comparable or better performance in comparison to several existing techniques.

Efficient traffic-based IoT device identification using a feature selection approach with Lévy flight-based sine chaotic sub-swarm binary honey badger algorithm

Internet of Things (IoT) refers to the various devices connected to the Internet, enabling them to communicate and transmit data with each other. The rapid development of the IoT also brings security and other problems in cyberspace. In this case, device identification is a crucial tool for IoT security issues, which can detect and prevent cyber-attacks. However, device identification has some challenges on IoT traffic datasets, such as large-scale and high-dimensional sparse datasets, features prone to security vulnerabilities, and identification of IP and non-IP devices, which affects the performance of classifiers. Feature selection can be seen as an effective data preprocessing technique in IoT device identification, which may improve the performance of classification and reduce the computational complexity of IoT device identification. In this paper, we propose a traffic-based IoT device identification model using a novel wrapper feature selection approach based on an improved and efficient method, which we call Lévy flight-based sine chaotic sub-swarm binary honey badger algorithm (LS2-BHBA). Specifically, four improved factors are employed in LS2-BHBA to expand the search scope, balance the exploration and exploitation phases, and enhance the search capability. In addition, a binary mechanism is implemented to enhance the suitability of the proposed LS2-BHBA for feature selection in IoT device identification. The experimental results on several real IoT traffic datasets denote that LS2-BHBA can reduce the number of features to 10%, and the classification accuracy can reach 98%, which outperforms some classical and latest comparison algorithms in the feature selection of IoT device identification.

Time-band network model and binary tree algorithm for multimodal irregular flight recovery

Recovery of irregular flights caused by various reasons such as aircraft failures and airport closures is studied in this research and a multimodal time-band network model for solving the issue is proposed. It transforms the flight routing problem into a time-based network, which is used to obtain the delay and cancellation costs of each flight. With delay and cancellation costs as variables, the proposed model aims to minimize recovery costs under constraints. This research also suggests a developed binary tree algorithm, which improves the efficiency of model solving. The results show that the rescheduled flights and re-selected flight routes are at the lowest cost and helpful to achieve a balance of flight flow without affecting flight safety. This method used in this work shows its certain value in helping airlines restore flight operations in the shortest possible time and at the lowest cost, improving operational efficiency and service quality.

PREDICTING FIRE ALARMS USING MULTI SENSOR DATA: A BINARY CLASSIFICATION APPROACH

Fires pose significant threats to human life, property, and the environment. Early detection of fire incidents is crucial to prevent extensive damage and to ensure the safety of occupants. Traditional fire alarm systems typically rely on a single type of sensor, such as smoke detectors or heat sensors, to detect specific fire indicators. These systems operate based on predefined thresholds and triggers. However, they can be prone to false alarms triggered by non-fire-related events (e.g., cooking fumes or dust) and may not provide early warning signs in certain scenarios. To address these limitations, researchers and engineers have turned to advanced technologies, such as multi-sensor data analysis and machine learning algorithms, to develop more reliable and efficient fire alarm prediction systems. On the other hand, the need for a more robust and accurate fire alarm prediction system stems from the shortcomings of traditional methods. False alarms not only lead to wasted resources but also desensitize occupants, potentially leading them to ignore genuine alarms. Additionally, a delayed response to a fire incident can result in severe consequences, making it essential to develop an intelligent system that can effectively and timely predict fire events. Therefore, this work presents the utilization of multi-sensor data and binary classification to develop a more reliable fire alarm prediction system. The experiments are conducted using a dataset collected from various sensor inputs, including air temperature, humidity, CO2 concentration, molecular hydrogen, ethanol gas, and air pressure etc. Then applied binary classification algorithm to learn patterns from the data and classify fire-related events accurately. The results showed promising improvements in prediction accuracy, reduced false alarm rates, and early detection of fire incidents.

The International Association for the Study of Lung Cancer Mesothelioma Staging Project: Proposals for Revisions of the “T” Descriptors in the Forthcoming Ninth Edition of the TNM Classification for Pleural Mesothelioma

IntroductionThe primary tumor (T) component in the eighth edition of pleural mesothelioma (PM) staging system is based on pleural involvement and extent of invasion. Quantitative assessment of pleural tumor has been found to be prognostic. We explored quantitative and qualitative metrics to develop recommendations for T descriptors in the upcoming ninth edition of the PM staging system. MethodsThe International Association for the Study of Lung Cancer prospectively collected data on patients with PM. Sum of maximum pleural thickness (Psum) was recorded. Optimal combinations of Psum and eighth edition cT descriptors were assessed using recursive binary splitting algorithm, with bootstrap resampling to correct for the adaptive nature of the splitting algorithm, and validated in the eighth edition data. Overall survival (OS) was calculated by the Kaplan-Meier method and differences in OS assessed by the log-rank test. ResultsOf 7338 patients submitted, 3598 were eligible for cT analysis and 1790 had Psum measurements. Recursive partitioning identified optimal cutpoints of Psum at 12 and 30 mm, which, in combination with extent of invasion, yielded four prognostic groups for OS. Fmax greater than 5 mm indicated poor prognosis. cT4 category (based on invasion) revealed similar performance to eighth edition. Three eighth edition descriptors were eliminated based on low predictive accuracy. Eighth edition pT descriptors remained valid in ninth edition analyses. ConclusionGiven reproducible prognostication by Psum, size criteria will be incorporated into cT1 to T3 categories in the ninth edition. Current cT4 category and all pT descriptors will be maintained, with reclassification of fissural invasion as pT2.

Learnable binary MIMO detection with negative penalty based on inexact ADMM

AbstractIn this letter, a new learnable binary MIMO detection algorithm in massive MIMO systems with one‐bit analog‐to‐digital converters is proposed. A negative penalty is introduced to transform a non‐convex constraint to a convex box constraint and a learnable iterative algorithm is presented based on inexact alternating direction methods of multipliers. The proposed MIMO detection method performs better than the existing binary MIMO detection methods even with lower computational complexity.

Circulating miRNA’s biomarkers for early detection of hepatocellular carcinoma in Egyptian patients based on machine learning algorithms

Liver cancer, which ranks sixth globally and third in cancer-related deaths, is caused by chronic liver disorders and a variety of risk factors. Despite therapeutic improvements, the prognosis for Hepatocellular Carcinoma (HCC) remains poor, with a 5-year survival rate for advanced cases of less than 12%. Although there is a noticeable decrease in the frequency of cases, liver cancer remains a significant worldwide health concern, with estimates surpassing one million cases by 2025. The prevalence of HCC has increased in Egypt, and it includes several neoplasms with distinctive messenger RNA (mRNA) and microRNA (miRNA) expression profiles. In HCC patients, certain miRNAs, such as miRNA-483-5P and miRNA-21, are upregulated, whereas miRNA-155 is elevated in HCV-infected people, encouraging hepatocyte proliferation. Short noncoding RNAs called miRNAs in circulation have the potential as HCC diagnostic and prognostic markers. This paper proposed a model for examining circulating miRNAs as diagnostic and predictive markers for HCC in Egyptian patients and their clinical and pathological characteristics. The proposed HCC detection model consists of three main phases: data preprocessing phase, feature selection based on the proposed Binary African Vulture Optimization Algorithm (BAVO) phase, and finally, classification as well as cross-validation phase. The first phase namely the data preprocessing phase tackle the main problems associated with the adopted datasets. In the feature selection based on the proposed BAVO algorithm phase, a new binary version of the BAVO swarm-based algorithm is introduced to select the relevant markers for HCC. Finally, in the last phase, namely the classification and cross-validation phase, the support vector machine and k-folds cross-validation method are utilized. The proposed model is evaluated on three studies on Egyptians who had HCC. A comparison between the proposed model and traditional statistical studies is reported to demonstrate the superiority of using the machine learning model for evaluating circulating miRNAs as diagnostic markers of HCC. The specificity and sensitivity for differentiation of HCC cases in comparison with the statistical-based method for the first study were 98% against 88% and 99% versus 92%, respectively. The second study revealed the sensitivity and specificity were 97.78% against 90% and 98.89% versus 92.5%, respectively. The third study reported 83.2% against 88.8% and 95.80% versus 92.4%, respectively. Additionally, the results show that circulating miRNA-483-5p, 21, and 155 may be potential new prognostic and early diagnostic biomarkers for HCC.

BinDMO: a new Binary Dwarf Mongoose Optimization algorithm on based Z-shaped, U-shaped, and taper-shaped transfer functions for CEC-2017 benchmarks

Intelligent swarm optimization algorithms have become increasingly common due to their success in solving real-world problems. Dwarf Mongoose Optimization (DMO) algorithm is a newly proposed intelligent swarm optimization algorithm in recent years. It was developed for continuous optimization problem solutions in its original paper. But real-world problems are not always problems that take continuously variable values. Real-world problems are often problems with discrete variables. Therefore, heuristic algorithms proposed for continuous optimization problems need to be updated to solve discrete optimization problems. In this study, DMO has been updated for binary optimization problems and the Binary DMO (BinDMO) algorithm has been proposed. In binary optimization, the search space consists of binary variable values. Transfer functions are often used in the conversion of continuous variable values to binary variable values. In this study, twelve different transfer functions were used (four Z-shaped, four U-shaped, and four Taper-shaped). Thus, twelve different BinDMO variations were obtained (BinDMO1, BinDMO2, …, BinDMO12). The achievements of BinDMO variations were tested on thirteen different unimodal and multimodal classical benchmark functions. The effectiveness of population sizes on the effectiveness of BinDMO was also investigated. When the results were examined, it was determined that the most successful BinDMO variation was BinDMO1 (with Z1-shaped transfer function). The most successful BinDMO variation was compared with three different binary heuristic algorithms selected from the literature (SO, PDO, and AFT) on CEC-2017 benchmark functions. According to the average results, BinDMO was the most successful binary heuristic algorithm. This has proven that BinDMO can be chosen as an alternative algorithm for binary optimization problems.

Feature selection based on dataset variance optimization using Hybrid Sine Cosine – Firehawk Algorithm (HSCFHA)

Feature selection plays a pivotal role in preprocessing data for machine learning (ML) models. It entails choosing a subset of pertinent features to enhance the model’s accuracy and minimize overfitting. Wrapper methods based on metaheuristics are one approach to feature selection, leveraging the predictive accuracy of a learning algorithm to form a condensed set of features. Traditionally, this method uses K-Nearest Neighbor (KNN) for maximizing accuracy as its cost function. However, this approach often yields less than optimal results in large sample spaces and demands considerable computational resources. To circumvent the shortcomings of this approach, this work proposes a novel metaheuristic algorithm, termed the Hybrid Sine Cosine Firehawk Algorithm. Furthermore, a novel feature selection technique is designed that uses this hybrid algorithm to eliminate insignificant and redundant features by incorporating the minimization of dataset variance in the cost function. Additionally, the hybridization of multiple metaheuristic algorithms produces the best features of each algorithm to improve the exploration ability. The proposed technique is tested on 22 University of California Irvine datasets containing low, medium and high dimensional datasets and compared to the traditional KNN-based approach. The technique is also compared with other state-of-the-art metaheuristic techniques, namely Particle Swarm Optimizer, Grey Wolf Optimizer, Whale Optimization Algorithm, Hybrid Ant Colony Optimizer and Improved Binary Bat Algorithm. The results show significant improvements over previous techniques in terms of minimal loss in essential data while reducing the size of the raw data in considerably less time, as well as a well-balanced confusion matrix.

Transformer-based time-to-event prediction for chronic kidney disease deterioration.

Deep-learning techniques, particularly the Transformer model, have shown great potential in enhancing the prediction performance of longitudinal health records. Previous methods focused on fixed-time risk prediction, however, time-to-event prediction is often more appropriate for clinical scenarios. Here, we present STRAFE, a generalizable survival analysis Transformer-based architecture for electronic health records. The input for STRAFE is a sequence of visits with SNOMED-CT codes in OMOP-CDM format. A Transformer-based architecture was developed to calculate probabilities of the occurrence of the event in each of 48 months. Performance was evaluated using a real-world claims dataset of over 130000 individuals with stage 3 chronic kidney disease (CKD). STRAFE showed improved mean absolute error (MAE) compared to other time-to-event algorithms in predicting the time to deterioration to stage 5 CKD. Additionally, STRAFE showed an improved area under the receiver operating curve compared to binary outcome algorithms. We show that STRAFE predictions can improve the positive predictive value of high-risk patients by 3-fold. Finally, we suggest a novel visualization approach to predictions on a per-patient basis. Time-to-event predictions are the most appropriate approach for clinical predictions. Our deep-learning algorithm outperformed not only other time-to-event prediction algorithms but also fixed-time algorithms, possibly due to its ability to train on censored data. We demonstrated possible clinical usage by identifying the highest-risk patients. The ability to accurately identify patients at high risk and prioritize their needs can result in improved health outcomes, reduced costs, and more efficient use of resources.

The Space Complexity of Consensus from Swap

Nearly thirty years ago, it was shown that \(\Omega (\sqrt {n})\) read/write registers are needed to solve randomized wait-free consensus among n processes. This lower bound was improved to n registers in 2018, which exactly matches known algorithms. The \(\Omega (\sqrt {n})\) space complexity lower bound actually applies to a class of objects called historyless objects, which includes registers, test-and-set objects, and readable swap objects. However, every known n -process obstruction-free consensus algorithm from historyless objects uses Ω ( n ) objects. In this paper, we give the first Ω ( n ) space complexity lower bounds on consensus algorithms for two kinds of historyless objects. First, we show that any obstruction-free consensus algorithm from swap objects uses at least n -1 objects. More generally, we prove that any obstruction-free k -set agreement algorithm from swap objects uses at least \(\lceil \frac{n}{k}\rceil - 1\) objects. The k -set agreement problem is a generalization of consensus in which processes agree on no more than k different output values. This is the first non-constant lower bound on the space complexity of solving k -set agreement with swap objects when k > 1. We also present an obstruction-free k -set agreement algorithm from n-k swap objects, which exactly matches our lower bound when k =1. Second, we show that any obstruction-free binary consensus algorithm from readable swap objects with domain size b uses at least \(\frac{n-2}{3b+1}\) objects. When b is a constant, this asymptotically matches the best known obstruction-free consensus algorithms from readable swap objects with unbounded domains. Since any historyless object can be simulated by a readable swap object with the same domain, our results imply that any obstruction-free consensus algorithm from historyless objects with domain size b uses at least \(\frac{n-2}{3b+1}\) objects. For b = 2, we show a slightly better lower bound of n -2. There is an obstruction-free binary consensus algorithm using 2 n -1 readable swap objects with domain size 2, asymptotically matching our lower bound.

Thorax X-Ray Image Segmentation Technique Using Four Thresholding Algorithm Variants

Pneumonia is a respiratory infection caused by bacteria, viruses or fungi, and has been recognized as a fairly common and threatening disease. When diagnosing this disease, doctors usually also use thorax X-ray images. Nowadays, diagnosing pneumonia has been made possible with the help of machine learning technology. Doctors or medical personnel in locations where there are no pulmonary specialists or experts can be assisted by this technology. Machine learning algorithms are used to process digital images that have passed the pre-processing and segmentation stages. This paper offers a solution to segmentation technique of thorax X-ray digital image using a combination of four thresholding algorithms. This combination aims to find the best CNN model with segmentation techniques in the form of the most suitable thresholding algorithm. The result of this research is four different data sets. The thresholding algorithms used include binary, thresh binary inv, thresh to zero, thresh tozero inv with a threshold value of 150. The data used in this research is a thorax X-ray image dataset, as many as 5,856 images acquired from the Kaggle repository data. The program code in this research uses the Python programming language in the Anaconda environment. This research has resulted in a comparison of the accuracy values obtained using 4 variants between thres_binary thresholding algorithm and thres_binary_inv. The thres_tozero obtained 95% of accuracy while thres_tozero_inv obtained 94% of accuracy.

Binary firefly algorithm based reconfiguration for maximum power extraction under partial shading and machine learning approach for fault detection in solar PV arrays

The functioning of a photovoltaic (PV) array in the shadow presents significant issues owing to power loss, which affects the harvested power. One of the greatest promising methods for reducing the effect of shadow over the array is reconfiguration. Therefore, this work proposes a modern metaheuristic Binary Firefly Algorithm (BFA) technique for solving the reconfiguration mechanism of a partial shade PV array. The proposed BFA is tested on a 9 × 9 panel PV array with four established shadow arrangements: short wide (SW), long wide (LW), short narrow (SN), and long narrow (LN). The proposed BFA approach yields configurations superior when compared to existing reconfigurations. The best GMP boost obtained with the proposed BFA concerning TCT configuration is 36% in the SW shadow pattern, 30 in the LW arrangement, while the least is 7% in the SN and LN patterns. To evaluate the ability of the proposed system, it is compared with other reconfiguration methods tested across various performance metrics such as fill factor, mismatch power loss, percentage of power loss, and power enhancement. The energy estimates and revenue generation demonstrate that the proposed BFA approach generates 15% more power than the TCT setup and other methods. Furthermore, the Nave Bayes based Machine Learning (ML) approach is applied to detect physical degradation in PV panels. To validate the performance proposed ML method and other techniques are undergone with both faulty and non-faulty conditions. The output of the proposed ML technique-based identification of faults approach is compared to existing techniques. The acquired results supported the proposed BFA with ML's ability and superiority in optimally reconfiguring the shaded array.

A Framework for Valuation and Portfolio Optimization of Venture Capital Deals with Contractual Terms

Venture capitalists invest not only in the business aspect of a deal but also in its contractual terms. Therefore, the selection of deals and the combination of contractual terms pose challenging decisions for them. This paper consists of two main sections. The first section introduces a novel framework for the valuation of venture capital (VC) deals, including startups and their contractual terms. By taking into account risk situations, this section presents the valuation of combined contractual terms, including call options, liquidity preference, and participant rights. In the second section, a new multiobjective mathematical model for VC deals and contractual terms portfolio selection is developed using right-tail probability, strategy alignment, and a utility function. To solve the proposed model, three metaheuristic algorithms—Non-Dominated Sorting Genetic Algorithm (NSGA-II), Multi-Objective Binary Harmony Search Algorithm, and Dynamic Tuning Parameter Binary Harmony Search Algorithm (DTPBHS)—are applied. Based on numerical examples, DTPBHS outperforms other algorithms in the “Mean Ideal Distance” index, but NSGA-II demonstrates the best performance in the “Rate of Achievement of two objectives simultaneously” index. Furthermore, we demonstrate that the proposed utility function is more robust than the right-tail probability function under default deals conditions.

Optimizing Coverage in Wireless Sensor Networks: A Binary Ant Colony Algorithm with Hill Climbing

Wireless sensor networks (WSNs) play a vital role in various fields, but ensuring optimal coverage poses a significant challenge due to the limited energy resources that constrain sensor nodes. To address this issue, this paper presents a novel approach that combines the binary ant colony algorithm (BACA), a variant of ant colony optimization (ACO), with other search optimization algorithms, such as hill climbing (HC) and simulated annealing (SA). The BACA is employed to generate an initial solution by emulating the foraging behavior of ants and the pheromone trails they leave behind in their search for food. However, we acknowledge that the BACA alone may not guarantee the most optimal solution. Subsequently, HC and SA are optimization search algorithms that refine the initial solution obtained by the BACA to find a more enhanced solution. Through extensive simulations and experiments, we demonstrate that our proposed approach results in enhanced coverage and energy-efficient coverage in a two-dimensional (2D) field. Interestingly, our findings reveal that HC consistently outperforms SA, particularly in less complex search spaces, leveraging its robust exploitation approach. Our research contributes valuable insights into optimizing WSN coverage, highlighting the superiority of HC in this context. Finally, we outline promising future research directions that can advance the optimization of WSN coverage.

Ensemble learning based approach for traffic incident detection and multi-category classification

Traffic incident is one of the important causes of road congestion. Traffic incident detection plays a crucial role in the safety application of intelligent transportation systems, which provides timely information for traffic management departments and reducing losses. Despite many researches on incident detection approach, the identification of different incident categories is not enough. In addition, traffic incident detection is still a challenging task due to the problem of data imbalance and feature selection. In this study, we propose a two-stage traffic incident detection framework based on ensemble learning. In the first stage, a binary classification algorithm based on XGBoost (eXtreme Gradient Boosting) is established to detect whether there is a traffic incident, and 24 feature variables are determined by model feature selection. In the second stage, three resampling algorithms are utilized to reconstruct and balance the dataset. Through comparative analysis, SMOTE (Synthetic Minority Over-sampling Technique)-XGBoost is the best method for incident multi-category classification with precision of 87.27%, 78.52% and 92.54%, respectively. Moreover, the baseline comparison experiments are conducted to evaluate our model performance with real-word datasets. The proposed model achieves the highest average accuracy of 93.45% in the first stage and the macro-precision of 86.11% in the second stage. The results indicate that the proposed method outperforms baselines and the two-stage framework can accurately realize the incident detection and multi-category classification.

A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem

A binary bat algorithm with improved crossover operators and Cauchy mutation for unit commitment problem

Distributed scheduling for multi-energy synergy system considering renewable energy generations and plug-in electric vehicles: A level-based coupled optimization method

Multi-energy synergy systems integrating high-penetration large-scale plug-in electric vehicles, distributed renewable energy generations, and battery energy storage systems have great potential to reduce the reliance of the grid on traditional fossil fuels. However, the random charging characteristics of plug-in electric vehicles and the uncertainty of photovoltaics may impose an additional burden on the grid and affect the supply–demand equilibrium. To address this issue, judicious scheduling optimization offers an effective solution. In this study, considering charge and discharge management of plug-in electric vehicles and intermittent photovoltaics, a novel Multi-energy synergy systems scheduling framework is developed for solving grid instability and unreliability issues. This formulates a large-scale mixed-integer problem, which calls for a powerful and effective optimizer. The new binary level-based learning optimization algorithm is proposed to address nonlinear large-scale high-coupling unit commitment problems. To investigate the feasibility of the proposed scheme, numerical experiments have been carried out considering multiple scales of unit numbers and various scenarios. Finally, the results confirm that the proposed scheduling framework is reasonable and effective in solving unit commitment problems, can achieve 3.3% cost reduction and demonstrates superior performance in handling large-scale energy optimization problems. The integration of plug-in electric vehicles, distributed renewable energy generations, and battery energy storage systems is verified to reduce the output power of 192.72 MW units during peak periods to improve grid stability. Therefore, optimizing energy utilization and distribution will become an indispensable part of future power systems.

A 12-Bit SAR ADC with Binary Search Calibration Algorithm for a Split Capacitor

This paper proposes a 12-bit SAR ADC capable of calibrating a split capacitor using a binary search technique for bio-signal processing applications. The proposed SAR ADC employs a calibration logic circuit to calibrate a split capacitor vulnerable to process variations and mismatches. The proposed foreground calibration process involves four iterations through the binary search algorithm. In this manner, the calibration speed can be increased by up to 3.75 times compared with that of the linear search calibration. The proposed SAR ADC was implemented with a CMOS 28 nm 1-poly 8-metal process. The effective layout, excluding bonding pads, occupied 939 × 450 μm. Measurement results illustrated a power consumption of 30.7 μW (analog power: 16.1 μW and digital power: 14.6 μW), INL/DNL of −1.8/1.7 LSB, and −0.7/0.7 LSB, respectively, ENoB of 10.3-bit, and a FoM of 53.7 fJ/step.

Optimal generation expansion planning model for solar PV generation on Run of River-based hydro-based power system using binary genetic algorithm

Abstract This paper presents a binary genetic algorithm approach developed to solve the optimal generation expansion planning problem for solar photo-voltaic (PV) based Run of River (ROR) hydro generation systems. The results show that the methodology effectively solves mixed-integer, constrained nonlinear generation expansion problems. The model is then used to optimize the generation expansion problem for the electricity grid in the eastern region of Nepal, considering the under construction and planned solar PV and ROR-based hydropower plants. The optimal problem is formulated to determine the optimal number, location and type of power plant to fulfill the demand for the electricity grid of the eastern zone grid of Nepal. Results show that the total generation from the optimal sites combining hydro and solar sites is found to be about 26% of that of total energy in the Nepalese grid. However, the total demand in the system under consideration for the year is about 1352 GWh. With eliminating line losses, a surplus generation of about 1377 GWh has been found. This surplus can be used as power pooling with neighboring countries. The system has a surplus during the wet season but needs to be improved during the dry season. Hence, appropriate policies can be formulated for power banking and pooling to balance the demand–supply in the system.