Search

Delivery apps are experiencing significant growth, requiring efficient algorithms to coordinate transportation and generate profits. One problem that considers the goals of delivery apps is the multi-vehicle profitable pickup and delivery problem (MVPPDP). In this paper, we propose eight new metaheuristics to improve the initial solutions for the MVPPDP based on the well-known swarm intelligence algorithm, Artificial Bee Colony (ABC): K-means-GRASP-ABC(C)S1, K-means-GRASP-ABC(C)S2, Modified K-means-GRASP-ABC(C)S1, Modified K-means-GRASP-ABC(C)S2, ACO-GRASP-ABC(C)S1, ACO-GRASP-ABC(C)S2, ABC(S1), and ABC(S2). All methods achieved superior performance in most instances in terms of processing time. For example, for 250 customers, the average times of the algorithms was 75.9, 72.86, 79.17, 73.85, 76.60, 66.29, 177.07, and 196.09, which were faster than those of the state-of-the-art methods that took 300 s. Moreover, all proposed algorithms performed well on small-size instances in terms of profit by achieving thirteen new best solutions and five equal solutions to the best-known solutions. However, the algorithms slightly lag behind in medium- and large-sized instances due to the greedy randomised strategy and GRASP that have been used in the scout bee phase. Moreover, our algorithms prioritise minimal solutions and iterations for rapid processing time in daily m-commerce apps, while reducing iteration counts and population sizes reduces the likelihood of obtaining good solution quality. [ABSTRACT FROM AUTHOR]

Optimization of scheduling problems that involve single or multiple machines with a multimodal objective function and linear or non-linear constraints are generally NP-Hard. The Artificial Bee Colony (ABC) algorithm is a metaheuristic proposed about eighteen years ago and has gained popularity in the swarm intelligence-based evolutionary computation approaches. Various scheduling requirements in diverse domains viz. Electric Vehicle charging, Operating Room, Nurse, Automatic Guided Vehicle (AGV), production, manufacturing, hydrothermal, Printed Circuit Board (PCB), and call centre scheduling are studied. The NP-Hard nature of these scheduling problems render exact methods incompetent for large problem instances thus requiring meta-heuristics such as ABC to produce feasible solutions in a reasonable computation time. The adaptation of ABC in these domains and the outcomes and performance of ABC are highlighted. Based on the case studies, it is found that the requirements of scheduling problems that would benefit from ABC are those that have a planning horizon requiring a near-optimal solution in a reasonably fast time when run on minimal computing capacity. Future works that would merit the application and enhancement of existing ABC techniques are proposed. The case studies presented in this paper motivate R&D Engineers and young researchers to apply ABC techniques of optimization and scheduling in different research topics for achieving energy and cost efficiency. [ABSTRACT FROM AUTHOR]

The integro-differential equation with the Cauchy kernel is used in many different technical problems, such as in circuit analysis or gas infrared radiation studies. Therefore, it is important to be able to solve this type of equation, even in an approximate way. This article compares two approaches for solving this type of equation. One of the considered methods is based on the application of the differential Taylor series, while the second approach uses selected heuristic algorithms inspired by the behavior of animals. Due to the problem domain, which is symmetric, and taking into account the form of the function appearing in this equation, we can use this symmetry in some cases. The paper also presents numerical examples illustrating how each method works and comparing the discussed approaches. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Reliable forecasting of short-term traffic flow is an essential component of modern intelligent transport systems. However, existing methods fail to deal with the non-linear nature of short-term traffic flow, often making the forecasting unreliable. Herein, we propose a reliable short-term traffic flow forecasting method, termed hybrid extreme learning, that effectively learns the non-linear representation of traffic flow, boosting forecasting reliability. This new algorithm probes the non-linear nature of short-term traffic data by exploiting the artificial bee colony that selects the best-implied layer deviation and input weight matrix to enhance the multi-structural information perception capability. It speeds up the forecasting time by calculating the output weight matrix, which guarantees the real usage of the forecasting method, boosting the time reliability. We extensively evaluate the proposed hybrid extreme learning method on well-known short-term traffic flow forecasting datasets. The experimental results show that our method outperforms existing methods by a large margin in both forecasting accuracy and time, effectively demonstrating the reliability improvement of the proposed method. This reliable method may open the avenue of deep learning techniques in short-term traffic flow forecasting in real scenarios. [ABSTRACT FROM AUTHOR]

Cyberattacks are increasingly becoming more complex, which makes intrusion detection extremely difficult. Several intrusion detection approaches have been developed in the literature and utilized to tackle computer security intrusions. Implementing machine learning and deep learning models for network intrusion detection has been a topic of active research in cybersecurity. In this study, artificial neural networks (ANNs), a type of machine learning algorithm, are employed to determine optimal network weight sets during the training phase. Conventional training algorithms, such as back-propagation, may encounter challenges in optimization due to being entrapped within local minima during the iterative optimization process; global search strategies can be slow at locating global minima, and they may suffer from a low detection rate. In the ANN training, the Artificial Bee Colony (ABC) algorithm enables the avoidance of local minimum solutions by conducting a high-performance search in the solution space but it needs some modifications. To address these challenges, this work suggests a Deep Autoencoder (DAE)-based, vectorized, and parallelized ABC algorithm for training feed-forward artificial neural networks, which is tested on the UNSW-NB15 and NF-UNSW-NB15-v2 datasets. Our experimental results demonstrate that the proposed DAE-based parallel ABC-ANN outperforms existing metaheuristics, showing notable improvements in network intrusion detection. The experimental results reveal a notable improvement in network intrusion detection through this proposed approach, exhibiting an increase in detection rate (DR) by 0.76 to 0.81 and a reduction in false alarm rate (FAR) by 0.016 to 0.005 compared to the ANN-BP algorithm on the UNSW-NB15 dataset. Furthermore, there is a reduction in FAR by 0.006 to 0.0003 compared to the ANN-BP algorithm on the NF-UNSW-NB15-v2 dataset. These findings underscore the effectiveness of our proposed approach in enhancing network security against network intrusions. [ABSTRACT FROM AUTHOR]

Demodulation methods play a critical role in achieving high-performance interferometric fiber-optic temperature sensors. However, the conventional passive 3 × 3 coupler demodulation method overlooks certain issues, such as the non-1:1:1 splitting ratio of the coupler, resulting in a non-ideal phase difference in the three output interference signals. These problems significantly impact the measurement results of interferometric temperature sensors. In this paper, we propose a novel arc-tangent method based on a 3 × 3 coupler and a demodulation algorithm combining long short-term memory (LSTM) with an artificial bee colony (ABC). The arc-tangent method is employed to enhance the input phase signal of the ABC-LSTM network model and establish a nonlinear mapping between the phase signal and temperature, effectively preventing the influence of the spectral ratio and phase difference of the 3 × 3 coupler on temperature demodulation. The proposed ABC-LSTM method achieves high-resolution measurements with an interval of 0.10 °C, and the absolute error is below 0.0040 °C within the temperature range of 25.00–25.50 °C. To demonstrate the stability and adaptability of the proposed method under long-term constant temperature conditions, we conducted measurements for approximately three hours in a controlled temperature environment set at 25.00 °C. Experimental results indicate that the maximum error of LSTM-ABC method remains around 0.0040 °C, outperforming the conventional algorithm (0.0095 °C). Furthermore, when comparing the average error values of the conventional passive 3 × 3 coupler method (0.0023 °C), LSTM model (0.0019 °C), and ABC-LSTM model (0.0014 °C), it is evident that the demodulation results of the ABC-LSTM method exhibit the highest level of stability. Therefore, the ABC-LSTM method enhances the accuracy and reliability of interferometric fiber-optic temperature-sensing systems. [ABSTRACT FROM AUTHOR]

The extraction of the optimal mode of the bearing signal in the drive system of a corn harvester is a challenging task. In addition, the accuracy and robustness of the fault diagnosis model are low. Therefore, this paper proposes a fault diagnosis method that uses the optimal mode component as the input feature. The vibration signal is first decomposed by variational mode decomposition (VMD) based on the optimal parameters searched by the artificial bee colony (ABC). Moreover, the key components are screened using an evaluation function that is a fusion of the arrangement entropy, the signal-to-noise ratio, and the power spectral density weighting. The Stockwell transform is then used to convert the filtered modal components into time–frequency images. Finally, the MBConv quantity and activation function of the EfficientNet network are optimized, and the time–frequency pictures are imported into the optimized network model for fault diagnosis. The comparative experiments show that the proposed method accurately extracts the optimal modal component and has a fault classification accuracy greater than 98%. [ABSTRACT FROM AUTHOR]

In the Internet of Things (IoT), the users have complex needs, and the Web Service Composition (WSC) was introduced to address these needs. The WSC's main objective is to search for the optimal combination of web services in response to the user needs and the level of Quality of Services (QoS) constraints. The challenge of this problem is the huge number of web services that achieve similar functionality with different levels of QoS constraints. In this paper, we introduce an extension of our previous works on the Artificial Bee Colony (ABC) and Bat Algorithm (BA). A new hybrid algorithm was proposed between the ABC and BA to achieve a better tradeoff between local exploitation and global search. The bat agent is used to improve the solution of exhausted bees after a threshold (limits), and also an Elitist Strategy (ES) is added to BA to increase the convergence rate. The performance and convergence behavior of the proposed hybrid algorithm was tested using extensive comparative experiments with current state-of-the-art nature-inspired algorithms on 12 benchmark datasets using three evaluation criteria (average fitness values, best fitness values, and execution time) that were measured for 30 different runs. These datasets are created from real-world datasets and artificially to form different scale sizes of WSC datasets. The results show that the proposed algorithm enhances the search performance and convergence rate on finding the near-optimal web services combination compared to competitors. TheWilcoxon signed-rank significant test is usedwhere the proposed algorithm results significantly differ fromother algorithms on 100% of datasets. [ABSTRACT FROM AUTHOR]

In order to solve the design problem of electric vehicle charging station distribution, based on the consideration of user and investor costs, this paper establishes a mixed integer model for charging station site selection based on game theory ideas. Among them, the user cost is determined by two indicators, namely, the cost of time for users to reach the charging station and the cost of time for users to wait in line, while the cost of the charging station is determined by the construction cost and the daily operation and maintenance cost. In the established model, the hierarchical analysis is used to minimize the combined cost of users and charging stations as the objective. In addition, an improved artificial bee colony algorithm is designed to solve the model. The improved algorithm adds a neighborhood search method and a feasible decoding scheme to the honey bee harvesting and tracking process, thus solving the problems of low search accuracy, poor convergence, and inability to directly calculate the mixed integer model of the original algorithm. Simulation results show that the improved artificial bee colony algorithm can effectively solve the mixed integer model and has higher search accuracy and convergence speed compared with the traditional method. By applying the algorithm to solve the siting model, the location and number of charging stations can be clearly planned, thus improving charging efficiency and reliability. [ABSTRACT FROM AUTHOR]

As the amount of data input increases, fog devices on IoT edge networks become increasingly inefficient. However, a well-designed fog computing resource-scheduling strategy can help to reduce excessive time delays and energy consumption. Therefore, in this paper, we propose an efficient fog computing resource-scheduling strategy. First, we used particle swarm optimization (PSO) to determine the optimal load balance among fog nodes and to obtain the optimal computation time and energy consumption in a single fog cluster. Second, we designed a particle swarm genetic joint optimization artificial bee colony algorithm (PGABC) to optimize the task scheduling among fog clusters based on the time and energy consumption obtained from load balancing. In addition, PGABC was used to optimize the task-scheduling model, which further reduced the delay and energy consumption of fog computing. The experimental results show that the time delay that was calculated using the proposed PGABC algorithm in the given model was reduced by 1.04%, 15.9%, and 28.5%, compared to GABC, ABC, and PSO, respectively, and the energy consumption was reduced by 3.9%, 6.6%, and 12.6%, respectively. The proposed resource-scheduling strategy reduced the delay by approximately 31.25%, 27.8%, 27.8%, and 25.4%, and the energy consumption by approximately 9.7%, 33.3%, 32%, and 29.6%, compared to SJF–PSO, PGABC-R, HSF.ABC&PSO, and MFO, respectively. [ABSTRACT FROM AUTHOR]

Introduction. Network expansion, substation planning, generating expansion planning, and load forecasting are all aspects of modern power system planning. The aim of this work is to solve network planning considering both future demand and all equality and inequality constraints. The transmission network design problem for the 6-bus system is considered and addressed using the Global Best Artificial Bee Colony (GABC) method in this research. The program is written in the Matrix Laboratory in MATLAB environment using the proposed methodology. Novelty of the work consist in considering the behavior of bees to find food source in most optimized way in nature with feature of user based accuracy selection and speed of execution selection on any scale of the system to solve Transmission Lines Expansion Problem (TLEP). The proposed method is implemented on nonlinear mathematical function and TLEP function. When demand grows, the program output optimally distributes new links between new generation buses and old buses, determines the overall minimum cost of those links, and determines if those linkages should meet power system limits. Originality of the proposed method is that it eliminated the need of load shedding while planning the future demand with GABC method. Results are validated using load flow analysis in electrical transient analyzer program, demonstrating that artificial intelligence approaches are accurate and particularly effective in non-linear transmission network planning challenges. Practical value of the program is that it can use to execute cost oriented complex transmission planning decision. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle edge networks (UENs) can reduce the cache load of the core network and improve system performance to provide users with efficient content services. However, the time-varying characteristics of content popularity in UENs lead to a low accuracy of popularity prediction, and the capacity limitations of wireless channel conditions lead to a lower cache hit rate than the rates of traditional fiber-optic-based cache strategies. Therefore, this paper proposes the discrete artificial bee colony cache strategy of UENs (DABCCSU). First, the information–dynamics–dissemination model of UENs (IDDMU) is established to deduce the coupling relationship between the channel capacity and the service probability in IDDMU. The influence of the service probability change on the content dissemination process is discussed, and the content popularity in UENs is predicted by the state iteration matrix. Then, the discrete artificial bee colony cache (DABCC) optimization algorithm is proposed. The action function of the artificial bee colony is designed as a random action based on the historical cache strategy. The discrete cache strategy is used as an optimization variable, and the popularity prediction result obtained by IDDMU is used to maximize the cache hit rate. DABCC provides the optimal cache strategy for the UENs, and effectively improves the cache hit rate. The simulation result shows that the accuracy of DABCCSU in content popularity prediction is more than 90%, which achieves a good prediction effect. In terms of cache performance, the average cache hit rate of DABCCSU is 91.62%, which is better than the 51.09% of the Least Recently Used (LRU) strategy, 89.27% of the Greedy Algorithm (GA) and 54.26% of Binary Particle Swarm Optimization (BPSO). In addition, the cache hit rate of DABCCSU under different cache capacities is better than that of LRU, GA, and BPSO, showing a relatively stable performance. It shows that DABCCSU can achieve excellent content popularity prediction, and it can also maximize the cache hit rate under limited communication resources and cache resources to provide UENs with the optimal content cache strategy, and provides users with high-quality content services. [ABSTRACT FROM AUTHOR]

This research work addresses the integrated scheduling of jobs and flexible (non-systematic) maintenance interventions in permutation flowshop production systems. We propose a coordinated model in which the time intervals between successive maintenance tasks as well as their number are assumed to be non-fixed for each machine on the shopfloor. With such a flexible nature of maintenance activities, the resulting joint schedule is more practical and representative of real-world scenarios. Our goal is to determine the best job permutation in which flexible maintenance activities are properly incorporated. To tackle the NP-hard nature of this problem, an artificial bee colony (ABC) algorithm is developed to minimize the total production time (Makespan). Experiments are conducted utilizing well-known Taillard's benchmarks, enriched with maintenance data, to compare the proposed algorithm performance against the variable neighbourhood search (VNS) method from the literature. Computational results demonstrate the effectiveness of the proposed algorithm in terms of both solution quality and computational times. [ABSTRACT FROM AUTHOR]

Selective disassembly is a systematic method to remove target components or high-valuable components from an EOL product for reuse, recycling and remanufacturing as quick and feasible as possible, which plays a key role for the effective application of circular economy. However, in practice, the process of selective disassembly is usually characterized by various unpredictable factors of EOL products. It is very difficult to identify a feasible disassembly sequence for getting the target components before taking actions due to the uncertainty. In this paper, a data-driven method of selective disassembly planning for EOL products under uncertainty is proposed, in which disassemblability is regarded as the degree of difficulty in removing components under uncertainty. Taxonomy of uncertainty metrics that represents uncertain characteristics of components and disassembly transitions of selective disassembly is established. Random and fuzzy assessment data of uncertainty is converted into qualitative values and aggregated to fit a prediction model based on the trapezium cloud model. The turning time of disassemblability is predicted for a given set of certainty degree. Further, the disassemblability values are applied to determine the best selective disassembly sequence in order to get target component with tradeoff between minimum number of disassembly operations and maximum feasibility. The effectiveness of the proposed method is illustrated by a numerical example. Moreover, by comparing to selective disassembly planning without considering uncertainty, the proposed method turns selective disassembly of EOL products more realistic than 11% and provide insights on how to design product to facilitate disassembly operations. [ABSTRACT FROM AUTHOR]

The recycling and remanufacturing of end-of-life products are significant for environmental protection and resource conservation. Disassembly is an essential process of remanufacturing end-of-life products. Effective disassembly plans help improve disassembly efficiency and reduce disassembly costs. This paper studies a disassembly planning problem with operation attributes, in which an integrated decision of the disassembly sequence, disassembly directions, and disassembly tools are made. Besides, a mathematical model is formulated with the objective of minimizing the penalty cost caused by the changing of operation attributes. Then, a neighborhood modularization-based artificial bee colony algorithm is developed, which contains a modular optimized design. Finally, two case studies with different scales and complexities are used to verify the performance of the proposed approach, and experimental results show that the proposed algorithm outperforms the two existing methods within an acceptable computational time. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) algorithm was proposed by mimicking the cooperative foraging behaviors of bees. As a member of swarm intelligence algorithms, ABC has some advantages in handling optimization problems. However, it has the exploration capacity over the exploitation capacity, which may lead to slow convergence speed and lower solution accuracy. Hence, to enhance the performance of the algorithm, a novel ABC based on Bayesian estimation (BEABC) is presented in this paper. First, instead of using the fitness ratio, the selection probability in ABC is replaced with a new probability calculated by Bayesian estimation. Second, to help the bees adopt more useful information during updating new food sources, a directional guidance mechanism is designed for onlooker bees and scout bees. Finally, the comprehensive performance of BEABC is evaluated by 24 single-objective test functions. The numerical experiment results indicate that BEABC dominates its peers over most test functions, and the significant statistics show that the significant excellence rate of BEABC is 76 % in the overall comparison. In addition, to further test the performance of BEABC, seven multi-objective problems and two real-word optimization problems are solved. The comparison results show that BEABC can achieve better results than other EA competitors. [ABSTRACT FROM AUTHOR]

Clustering using fuzzy C-means (FCM) is a soft segmentation method that has been extensively investigated and successfully implemented in image segmentation. FCM is useful in various aspects, such as the segmentation of grayscale images. However, FCM has some limitations in terms of its selection of the initial cluster center. It can be easily trapped into local optima and is sensitive to noise, which is considered the most challenging issue in the FCM clustering algorithm. This paper proposes an approach to solve FCM problems in two phases. Firstly, to improve the balance between the exploration and exploitation of improved global best-guided artificial bee colony algorithm (IABC). This is achieved using a new search probability model called PIABC that improves the exploration process by choosing the best source of food which directly affects the exploitation process in IABC. Secondly, the fuzzy clustering algorithm based on PIABC, abbreviated as PIABC-FCM, uses the balancing of PIABC to avoid getting stuck into local optima while searching for the best solution having a set of cluster center locations of FCM. The proposed method was evaluated using grayscale images. The performance of the proposed approach shows promising outcomes when compared with other related works. [ABSTRACT FROM AUTHOR]

Aspect terms are opinion targets for people to express and understand opinions in reviews. Aspect terms extraction is an essential subtask in aspect-level sentiment analysis. To extract aspect terms from a sentence, existing methods mainly focus on context features generated by pre-trained models. However, these models either neglect the crucial implicit linguistic features, e.g., post-of-tag, head, and head dependency, or fail to explore sufficient valuable features for aspect term extraction, which lead to the deficiency in aspect term extraction task. To address the challenges, in this paper, we propose a novel and effective framework for aspect term extraction by integrating both contextual and linguistic features with the artificial bee colony-based feature selection method. Firstly, a novel variant of artificial bee colony is designed to identify the most valuable linguistic features to reduce the high sparsity and dimensionality of the raw dataset. Next, the selected features and context embeddings are integrated to improve the performance of aspect extraction. Finally, extensive experiments are conducted on real-world datasets, and the results exhibit that our proposed framework can outperform the competitive baselines. Compared with the latest baselines, the proposed framework achieves the comparatively higher F1 scores of 80.7%, 84.7%, 72.2%, and 74.8% on the four groups of datasets. Furthermore, the ablation study shows that the proposed method with the designed feature selection module significantly outperforms the method with the original artificial bee colony, having 4.15%, 4.4%, 4.4%, and 3.2% improvements in F1 score on all the four datasets, respectively. [ABSTRACT FROM AUTHOR]

This paper presents compared performances of three metaheuristic algorithms in determining the cost of hybrid renewable energy system. Using genetic algorithm (GA), particle swarm optimization (PSO), and artificial bee colony (ABC), the best affordable sizes of solar photovoltaic array, battery bank, and a minimum-rated diesel generator that could be hybridized to meet the demand of a community in Southwest Nigeria were determined. Load profile, solar radiation, and temperature data were employed as required inputs, and the parameters of the algorithms were properly set to ensure the best result. Bonferroni– Holm method was deployed to ascertain the statistical significance among the algorithms. It was found that ABC produced the best configuration comprising 427 numbers of solar photovoltaic panels, 19 battery units, and 163.2 kW-rated diesel generator. With this, a total annualized cost of $167 284 and 0.2443 estimated cost of energy were obtained. These were the lowest when compared with PSO and GA. The t-test between PSO and ABC are both 5.83 × 10−10 < 0.01666667, between ABC and GA are 6.09 × 10−6 <0.01666667 and 6.09 × 10−6 <0.025, while between GA and PSO are 9.13 × 10−1 > 0.01666667 and 9.13 × 10−1 > 0.05. PSO/ABC and ABC/GA groups are clarified significant, while GA/PSO group is insignificant; post hoc test reveals that ABC produced the best result. Hence, a reliable and sustainable power supply at a reduced cost is guaranteed for the community. [ABSTRACT FROM AUTHOR]

This paper proposes a cloud computing-based approach to efficiently process the massive data produced in intelligent machine tool diagnosis flow. By collecting and extracting the vibration, power and other useful system signals during the machining operation of machine tools, the cutting process samples and cutting gap samples of machine tools can be accurately segmented, in order to construct a set of signal samples that can effectively and completely characterize the level of tool wear. We propose a visual detection method that relies on local threshold segmentation to predict tool wear status. The machine tool image is divided into several small blocks, and each image block is segmented to obtain the segmentation threshold, which is defined as the local threshold of each block. Then, the detection method scans the whole image based on the maximum local threshold among all blocks. Considering the complicated flow of visual detection and the high volume of machine tool diagnosis data, we further propose a big data processing approach which is implemented on a cloud computing architecture. By modeling the workflow of the proposed visual detection method as a directed acyclic graph, we develop a scheduling model that aims at minimizing the execution time of massive tool diagnosis data processing with available cloud computing resources. A effective metaheuristic based on search strategy of artificial bee colony is developed to solve the formulation scheduling problem. Experimental results on a cloud-based system demonstrate that, the visual detection method enhances the accuracy of tool wear detection, and the cloud-based approach significantly reduces the execution time of tool diagnosis flow by means of distributed computing. [ABSTRACT FROM AUTHOR]

Copyright of China Rural Water & Hydropower is the property of China Rural Water & Hydropower Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: Dento-maxillofacial deformities are common problems. Orthodontic–orthognathic surgery is the primary treatment but accurate diagnosis and careful surgical planning are essential for optimum outcomes. This study aimed to establish and verify a machine learning–based decision support system for treatment of dento-maxillofacial malformations. Methods: Patients (n = 574) with dento-maxillofacial deformities undergoing spiral CT during January 2015 to August 2020 were enrolled to train diagnostic models based on five different machine learning algorithms; the diagnostic performances were compared with expert diagnoses. Accuracy, sensitivity, specificity, and area under the curve (AUC) were calculated. The adaptive artificial bee colony algorithm was employed to formulate the orthognathic surgical plan, and subsequently evaluated by maxillofacial surgeons in a cohort of 50 patients. The objective evaluation included the difference in bone position between the artificial intelligence (AI) generated and actual surgical plans for the patient, along with discrepancies in postoperative cephalometric analysis outcomes. Results: The binary relevance extreme gradient boosting model performed best, with diagnostic success rates > 90% for six different kinds of dento-maxillofacial deformities; the exception was maxillary overdevelopment (89.27%). AUC was > 0.88 for all diagnostic types. Median score for the surgical plans was 9, and was improved after human–computer interaction. There was no statistically significant difference between the actual and AI- groups. Conclusions: Machine learning algorithms are effective for diagnosis and surgical planning of dento-maxillofacial deformities and help improve diagnostic efficiency, especially in lower medical centers. [ABSTRACT FROM AUTHOR]

Optimum path planning is a fundamental necessity for the successful functioning of a mobile robot in industrial applications. This research work investigates the application of the artificial bee colony (ABC) approach, probabilistic roadmap (PRM) method, and evolutionary programming (EP) algorithm to tackle the issue of single and multi-robot path planning in partially known or unknown industrial complex environments. Conventional techniques depend on external factors such as delay of information from one bee's stage to another for selecting neighbour food points. Due to this, its efficiency is comparatively low and might result in longer runtimes. To address these challenges, a novel hybrid framework based on ABC-PRM-EP has been introduced. Firstly, a suboptimal initial feasible path is attained by a new framework (ABC-PRM) within the mobile robot sensor detection range. Then, EP performs refinement of that attained suboptimal path to provide a short and optimum path. Also, a multi-robot collaboration strategy has been introduced based on the concept of hold-up. A number of comparative studies have been conducted in three different test scenarios with different complexity to validate the proposed framework efficiency and performance. Different performance indices such as path length (m), smoothness (rad), collision safety value, success rate, processing time (s), and convergence speed have been measured to validate the effectiveness of the proposed framework. The comparative analysis obtained from these test scenarios indicates that the proposed framework outperforms conventional ABC, ABC-EP and HPSO-GWO-EA, while performing path planning. [ABSTRACT FROM AUTHOR]

Frequency-domain electromagnetic induction (FDEMI) methods are frequently used in non-invasive, area-wise mapping of the subsurface electromagnetic soil properties. A crucial part of data analysis is the geophysical inversion of the data, resulting in either conductivity and/or magnetic susceptibility subsurface distributions. We present a novel 1D stochastic optimization approach that combines dimension-adapting reversible jump Markov chain Monte Carlo (MCMC) with artificial bee colony (ABC) optimization for geophysical inversion, with specific application to frequency-domain electromagnetic induction (FDEMI) data. Several solution models of simplified model geometry and a variable number of model knots, which are found by the inversion method, are used to create re-sampled resulting average models. We present synthetic test inversions using conductivity models based on 14 direct-push (DP) EC logs from Greece, Italy, and Germany, as well as field data applications using multi-coil FDEMI devices from three sites in Azerbaijan and Germany. These examples show that the method can effectively lead to solutions that resemble the known DP input models or image reasonable stratigraphic and archaeological features in the field data. Neighboring 1D solutions on field data examples show high coherence along profiles even though each 1D inversion is independently handled. The computational effort for one 1D inversion is less than 120,000 forward calculations, which is much less than usually needed in MCMC inversions, whereas the resulting models show more plausible solutions due to the dimension-adapting properties of the inversion method. [ABSTRACT FROM AUTHOR]

The determination is presented of seven parameters of a DC motor's drive. The determination was based on a comparison between the measured and simulated current and speed responses. For the parameters' determination, different evolutionary methods were used and compared to each other. The mathematical model presenting the DC drives model was written using two coupled differential equations, which were solved using the Runge–Kutta first-, second-, third- and fourth-order methods. The approach allows determining the parameters of controlled drives in such a way that the controller is taken into account with the measured voltage. Between the tested evolutionary methods, which were Differential Evolution with three strategies, Teaching-Learning Based Optimization and Artificial Bee Colony, the Differential Evolution (DE/rand/1/exp) can be suggested as the most appropriate for the presented problem. Measurements with different sampling times were used, and it was found out that at least some measuring points should be at the speed-up interval. Different lengths of the measured signal were tested, and it is sufficient to use a signal consisting of the drive's acceleration and a short part of the stationary operation. The analysis showed that the procedure has good repeatability. The biggest deviation of calculated parameters considering 10 repeated measurements was 6% in case of the La calculation. The deviations of all the other parameters' calculations were less than 2%. [ABSTRACT FROM AUTHOR]

The artificial bee colony algorithm (ABC) struggles in handling complex optimization problems with high dimensions in light of its search operators' strong exploration and weak exploitation properties. To tackle this situation, in this study, we propose a bi-preference linkage-driven ABC algorithm with multi-operator fusion, named BPLABC. BPLABC couples a preference-free stochastic search operator with a global best-guided search operator in the employed bee phase to maintain the population diversity while enhancing the population quality. During the onlooker bee phase, a tailored bi-type elite-guided exploitation mechanism is employed to regulate the exploitation intensity of the promising elite nectar sources selected via a new roulette selection probability calculation paradigm. To discourage the onlooker bees from slipping into local traps, after the scout bee phase, an auxiliary adversarial search operator is assembled to tug certain promising elite solutions away from the present pseudo-global best solution. To illustrate the effectiveness and efficiency of BPLABC, two sets of test suits consisting of 23 benchmark problems, 30 complex CEC2014 functions, and two real-world problems are picked for testing. Experimental results showed that BPLABC can achieve superior or equivalent performance to several representative ABC variants on the majority of the tested problems. [ABSTRACT FROM AUTHOR]

In the present paper, a tool is proposed to optimally schedule the charging requests of a fleet of carsharing Electric Vehicles (EVs) in an urban area, to enable their participation in the Ancillary Service Market. The centralized scheduler minimizes the imbalance of an EV fleet with respect to the power commitment declared in the Day-Ahead Market, providing also tertiary reserve and power balance control to the grid. The regulation is carried out by optimizing the initial charging time of each vehicle, according to a deadline set by the carsharing operator. To this purpose, a nature-inspired optimization is adopted, implementing innovative hybridizations of the Artificial Bee Colony algorithm. The e-mobility usage is simulated through a topology-aware stochastic model based on carsharing usage in Milan (Italy) and the Ancillary Services requests are modeled by real data from the Italian electricity market. The numerical simulations performed confirmed the effectiveness of the approach in identifying a suitable schedule for the charging requests of a large EV fleet (up to 3200 units), with acceptable computational effort. The benefits on the economic sustainability of the E-carsharing fleet given by the participation in the electricity market are also confirmed by an extensive sensitivity analysis. [ABSTRACT FROM AUTHOR]

Optic disc localization offers an important clue in detecting other retinal components such as the macula, fovea, and retinal vessels. With the correct detection of this area, sudden vision loss caused by diseases such as age-related macular degeneration and diabetic retinopathy can be prevented. Therefore, there is an increase in computer-aided diagnosis systems in this field. In this paper, an automated method for detecting optic disc localization is proposed. In the proposed method, the fundus images are moved from RGB color space to a new color space by using an artificial bee colony algorithm. In the new color space, the localization of the optical disc is clearer than in the RGB color space. In this method, a matrix called the feature matrix is created. This matrix is obtained from the color pixel values of the image patches containing the optical disc and the image patches not containing the optical disc. Then, the conversion matrix is created. The initial values of this matrix are randomly determined. These two matrices are processed in the artificial bee colony algorithm. Ultimately, the conversion matrix becomes optimal and is applied over the original fundus images. Thus, the images are moved to the new color space. Thresholding is applied to these images, and the optic disc localization is obtained. The success rate of the proposed method has been tested on three general datasets. The accuracy success rate for the DRIVE, DRIONS, and MESSIDOR datasets, respectively, is 100%, 96.37%, and 94.42% for the proposed method. [ABSTRACT FROM AUTHOR]

Feature selection is an essential step of preprocessing in Machine Learning (ML) algorithms that can significantly impact the performance of ML models. It is considered one of the most crucial phases of automated ML (AutoML). Feature selection aims to find the optimal subset of features and remove the noninformative features from the dataset. Feature selection also reduces the computational time and makes the data more understandable to the learning model. There are various heuristic search strategies to address combinatorial optimization challenges. This paper develops an Automated Artificial Bee Colony-based algorithm for Feature Selection (A2BCF) to solve a classification problem. The application domain evaluating our proposed algorithm is education science, which solves a binary classification problem, namely, undergraduate student success. The modifications made to the original Artificial Bee Colony algorithm make the algorithm a well-performed approach. [ABSTRACT FROM AUTHOR]

With the massive application of unmanned aerial vehicles (UAVs) in disaster relief, fire protection, security and other fields, jamming countermeasures to UAVs in airports and competition venues have become the core link of security in high‐level matches and important places. The existing jamming sources are mainly single point jamming. Due to the shielding of buildings, it is impossible to fully cover the venue, and the existing suppressed jamming will affect the communication broadcasting. Here, a distributed optimal jamming method for massive UAVs is proposed. Through the identification and positioning of massive UAVs, using the location information of distributed jamming sources, the UAV jamming architecture based on satellite navigation is constructed. Combined with tabu search artificial bee colony theory, the distributed optimal jamming of UAVs is realized, which solves the problems of few jamming targets, slow speed and low success rate of the existing optimal jamming methods. The proposed method is compared with the existing methods in three aspects: communication frequency, jamming trajectory deviation and optimization speed. The simulation results show that the proposed method effectively improves the jamming success rate and jamming speed and can meet the application requirements of massive UAV jamming in the region. [ABSTRACT FROM AUTHOR]

Copyright of China Rural Water & Hydropower is the property of China Rural Water & Hydropower Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper presents a novel parameter identification and uncertainty quantification method for flutter derivatives estimation of bridge decks. The proposed approach is based on free-decay vibration records of a sectional model in wind tunnel tests, which consists of parameter identification by a heuristic optimization algorithm in the sense of weighted least squares and uncertainty quantification by a bootstrap technique. The novel contributions of the method are on three fronts. Firstly, weighting factors associated with vertical and torsional motion in the objective function are determined more reasonably using an iterative procedure rather than preassigned. Secondly, flutter derivatives are identified using a hybrid heuristic and classical optimization method, which integrates a modified artificial bee colony algorithm with the Powell's algorithm. Thirdly, a statistical bootstrap technique is used to quantify the uncertainties of flutter derivatives. The advantages of the proposed method with respect to other methods are faster and more accurate achievement of the global optimum, and refined uncertainty quantification in the identified flutter derivatives. The effectiveness and reliability of the proposed method are validated through noisy data of a numerically simulated thin plate and experimental data of a bridge deck sectional model. [ABSTRACT FROM AUTHOR]

The successful use of fly ash (FA) and silica fume (SF) materials has been reported in the design of concrete samples in the literature. Due to the benefits of using these materials, they can be utilized in many industrial applications. However, the proper use of them in the right mixes is one of the important factors with respect to the strength and weight of concrete. Therefore, this paper develops relationships based on meta-heuristic (MH) algorithms (artificial bee colony technique) to evaluate the compressive strength of concrete specimens using laboratory experiments. A database comprising silica fume replacement ratio, fly ash replacement ratio, total cementitious material, water content coarse aggregate, high-rate water-reducing agent, fine aggregate, and age of samples, as model inputs, was used to evaluate and predict the compressive strength of concrete samples. Developed models of the MH technique created relationships between the mentioned parameters. In the new models, the influence of each parameter on the compressive strength was determined. Finally, using the developed model, optimum conditions for compressive strength of concrete samples were presented. This paper demonstrated that the MH algorithms are able to develop relationships that can serve as good substitutes for empirical models. [ABSTRACT FROM AUTHOR]

Assembly shop scheduling and energy-efficient scheduling have attracted much attention in the past decades; however, energy consumption is often ignored in assembly hybrid flow shop scheduling. Neglecting energy consumption will greatly diminish the progress of sustainable manufacturing. In this study, an assembly hybrid flow shop scheduling problem considering energy consumption (EAHFSP) is investigated, and a population diversity-based artificial bee colony algorithm (DABC) is proposed to minimize the makespan and total energy consumption (TEC) simultaneously. Diversified search strategies based on rank value are introduced to the employed bee phase; a novel probability selection method in the onlooker bee phase is designed to control the selection pressure; moreover, a diversity control strategy is applied to improve the diversity of food sources and avoid falling into stagnation. A number of experiments based on 44 extended benchmark instances from the literature and a real case are conducted to test the performance of the DABC algorithm. The statistical results show that the DABC algorithm is superior to the other four state-of-the-art algorithms on over 70% of the instances corresponding to metrics I G D and c , which means that the DABC algorithm is effective and competitive in solving the considered EAHFSP. [ABSTRACT FROM AUTHOR]

As a newly developed metaheuristic algorithm, the artificial bee colony (ABC) has garnered a lot of interest because of its strong exploration ability and easy implementation. However, its exploitation ability is poor and dramatically deteriorates for high-dimension and/or non-separable functions. To fix this defect, a self-adaptive ABC with a candidate strategy pool (SAABC-CS) is proposed. First, several search strategies with different features are assembled in the strategy pool. The top 10% of the bees make up the elite bee group. Then, we choose an appropriate strategy and implement this strategy for the present population according to the success rate learning information. Finally, we simultaneously implement some improved neighborhood search strategies in the scout bee phase. A total of 22 basic benchmark functions and the CEC2013 set of tests were employed to prove the usefulness of SAABC-CS. The impact of combining the five methods and the self-adaptive mechanism inside the SAABC-CS framework was examined in an experiment with 22 fundamental benchmark problems. In the CEC2013 set of tests, the comparison of SAABC-CS with a number of state-of-the-art algorithms showed that SAABC-CS outperformed these widely-used algorithms. Moreover, despite the increasing dimensions of CEC2013, SAABC-CS was robust and offered a higher solution quality. [ABSTRACT FROM AUTHOR]

To obtain more building surface information with fewer images, an unmanned aerial vehicle (UAV) path planning method utilizing an opposition-based learning artificial bee colony (OABC) algorithm is proposed. To evaluate the obtained information, a target information entropy ratio model based on observation angles is proposed, considering the observation angle constraints under two conditions: whether there is an obstacle around the target or not. To efficiently find the optimal observation angles, half of the population that is lower-quality generates bit points through opposition-based learning. The algorithm searches for better individuals near the bit points when generating new solutions. Furthermore, to prevent individuals from observing targets repeatedly from similar angles, the concept of individual abandonment probability is proposed. The algorithm can adaptively abandon similar solutions based on the relative position between the individual and the population. To verify the effectiveness of the proposed method, information acquisition experiments were conducted on real residential buildings, and the results of 3D reconstruction were analyzed. The experiment results show that while model accuracy is comparable to that of the comparison method, the number of images obtained is reduced to one-fourth of the comparison method. The operation time is significantly reduced, and 3D reconstruction efficiency is remarkably improved. [ABSTRACT FROM AUTHOR]

It is very difficult and expensive to replace sensor node battery in wireless sensor network in many critical conditions such as bridge supervising, resource exploration in hostile locations, and wildlife safety, etc. The natural choice in such situations is to maximize network lifetime. One such approach is to divide the sensing area of wireless sensor network into clusters to achieve high energy efficiency and to prolong network lifetime. In this paper, an Artificial Bee Colony Inspired Clustering Solution (ABCICS) is introduced. The proposed protocol selects the head of the cluster with optimal fitness function. The fitness function comprises the residual energy of node, node degree, node centrality, and distance from base station to node. When cluster-head with high energy node transmits the data to the base station, it further minimizes the energy consumption of the sensor network. The presented protocol is compared with LEACH, HSA-PSO, and MHACO-UC. Simulation experiments show the effectiveness of our approach to enhance the network lifetime. [ABSTRACT FROM AUTHOR]

Wireless computing has revolutionized our life with the technological advancement from the traditional networking into a new epoch for communication in ad hoc decorum. An energy efficient network of sensors based on wireless communication and networking principles can enhance the effectiveness of computing during unpredictable circumstances. If a computable required resource is readily available within the reachable region and it is identified to be idle and it is ready to share the corresponding information from its end without affecting the normal behavior of the device or the node, then there exists an opportunity to utilize those resources for computing. Opportunistic computing has a great potential of growth in the field of wireless ad hoc network computing. In traditional network computing technology, mobile computing, grid computing, distributed computing, ubiquitous computing and cloud computing, formerly ensues the communication with minimal resources currently available at the terminal point. This paper proposes a novel framework for an effective utilization of sharable resources, which are available within the reachable region, by creating an opportunity to frame an opportunistic computing while preserving the user's privacy. The proposed framework adopts a bio-inspired technique for identifying and collecting resources information, and thereby recognizes which resource is ready to participate in the opportunistic computing. Experimental results of a system that implements the bio-inspired technique along with the natural behavior of the bee colony approach was analyzed and found that the proposed system shows comparatively high performance in terms of computation resource searching, identifying, emergency data transfer, and participative node privacy preserving. [ABSTRACT FROM AUTHOR]

The Evidential C-Means algorithm provides a global treatment of ambiguity and uncertainty in memberships when partitioning attribute data, but still requires the number of clusters to be fixed as a priori, like most existing clustering methods do. However, the users usually do not know the exact number of clusters in advance, particularly in practical engineering. To relax this requirement, this paper proposes an Evidential Evolving C-Means (E2CM) clustering method in the framework of evolutionary computation: cluster centers are encoded in a population of variable strings (or particles) to search the optimal number and locations of clusters simultaneously. To perform such joint optimization problem well, an artificial bee colony algorithm with variable strings and interactive evaluation mode is proposed. It will be shown that the E2CM can automatically create appropriate credal partitions by just requiring an upper bound of the cluster number rather than the exact one. More interestingly, there are no restrictions on this upper bound from the theoretic point of view. Some numerical experiments and a practical application in thermal power engineering validate our conclusions. [ABSTRACT FROM AUTHOR]

Rapid growth in the development of wireless sensor networks (WSN) in the field of distributed audio signal processing is one of the critical research areas. Intruders can easily track the unprotected audio signals through sinkhole in WSN. To identify the source of the unauthorized audio signals can be retrieve using wireless acoustic sensor networks (WASN). Detection of sinkhole attacks in WASN is a challenging task as there exists centralized level of control only for the collecting the data. Since it is distributed in computation detection of a compromised node and alerting the other nodes in the network can be considered as a challenging issue in this research domain. In this paper, the detection of sinkhole attacks using voting-based method is implemented along with the optimization perspective. The main contribution of this paper is to adapt Artificial Bee Colony algorithm for effective generation of minimized Boolean key for sharing the suspect list among the alerted nodes. The experimental results of our proposed work has been evaluated and compared with the recent algorithms. The metrics used for evaluation are energy value of bee, overall network lifetime and authentication overhead. The performance shows the impact of the proposed algorithm on WSN scenario when compared to other existing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we consider a strong global search algorithm which exhibits strong exploration ability in unmanned aerial vehicle (UAV)-aided networks. UAVs in wireless communication have aroused great interest recently due to its low cost and flexibility in providing wireless connectivity in areas without infrastructure coverage. Artificial bee colony algorithm is a powerful approach for such a scene. However, due to its one-dimensional and greedy search strategy, it still suffers slow convergence speed. In the traditional version, three types of bees, including employed bees, onlooker bees, and scouts, are employed and they cooperate with each other to find the best food source position. Though different roles, these three types of bees play, there is no difference of division within the internal of each type of bees. Considering this phenomenon, this paper proposes a modified artificial bee colony algorithm with intellective search and special division (ABCIS) to enhance its performance, where different employed bees and different onlooker bees use different search strategies to search for food sources. Besides, the greedy selection method is also abandoned and the food sources' positions are updated at each iteration. Under this circumstance, the whole population's experience is fully utilized to guide bee's search. Finally, to testify the proposed algorithms' competitiveness, a series of benchmarks are adopted, and the experimental results demonstrate its superior performance among other state-of-the-art algorithm in UAV-aided networks. [ABSTRACT FROM AUTHOR]

Accurately determining geomechanical parameters and rock mass deformation are key components of slope stability assessment as well as structural design and safe construction. Numerical models are therefore commonly applied to these issues as a component of back analysis, which provides a practical tool for determining geomechanical parameters in rock engineering. Although once quantified, rock mass deformation can also be calculated using an appropriate numerical model, the traditional approaches tend to be time-consuming and cannot be used to accurately determine deformation uncertainty in practical rock engineering. A relevance vector machine (RVM) was adopted in this study to build the complex mapping relationship between geomechanical parameters and slope deformation, while an artificial bee colony (ABC) was also utilized to search for optimal parameters based on the RVM model and displacement monitored in the field. On this basis, both deformation and associated uncertainty can be predicted using this model via the input of determined geomechanical parameters. The method advocated in this paper was then applied to a rock slope at the Longtan hydropower station, China; results demonstrate that the RVM model accurately describes the relationship between geomechanical parameters and displacement increments and can thus be used to predict both deformation and associated uncertainty. [ABSTRACT FROM AUTHOR]

Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness. [ABSTRACT FROM AUTHOR]

In this research, an Artificial Bee Colony (ABC) algorithm based Selective Harmonics Elimination (SHE) technique is used as a pulse generator in a reduced switch fifteen level inverter that receives input from a PV system. Pulse width modulation based on Selective Harmonics Elimination is mostly used to suppress lower-order harmonics. A high gain DC-DC-SEPIC converter keeps the photovoltaic (PV) panel's output voltage constant. The Grey Wolf Optimization (GWO) filter removes far more Photovoltaic panel energy from the sunlight frame. To eliminate voltage harmonics, this unique inverter architecture employs a multi-carrier duty cycle, a high-frequency modulation approach. The proposed ABC harmonics elimination approach is compared to SHE strategies based on Particle Swarm Optimization (PSO) and Flower Pollination Algorithm (FPA). The suggested system's performance is simulated and measured using the MATLAB simulation tool. The proposed ABC approach has a THD level of 4.86%, which is better than the PSO and FPA methods. [ABSTRACT FROM AUTHOR]

Colorectal cancer (CRC) is one of the most common and malignant types of cancer worldwide. Colonoscopy, considered the gold standard for CRC screening, allows immediate removal of polyps, which are precursors to CRC. Many computer-aided diagnosis systems (CADs) have been proposed for automatic polyp detection. Most of these systems are based on traditional machine learning algorithms and their generalization ability, sensitivity and specificity are limited. On the other hand, with the widespread use of deep learning algorithms in medical image analysis and the successful results in the analysis of colonoscopy images, especially in the early and accurate detection of polyps, these problems are eliminated in recent years. In short, deep learning algorithms and applications have gained a critical role in CAD systems for real-time autonomous polyp detection. Here, we make significant improvements to object detection algorithms to improve the performance of CAD-based real-time polyp detection systems. We integrate the artificial bee colony algorithm (ABC) into the YOLO algorithm to optimize the hyper-parameters of YOLO-based algorithms. The proposed method can be easily integrated into all YOLO algorithms such as YOLOv3, YOLOv4, Scaled-YOLOv4, YOLOv5, YOLOR and YOLOv7. The proposed method improves the performance of the Scaled-YOLOv4 algorithm with an average of more than 3% increase in mAP and a more than 2% improvement in F1 value. In addition, the most comprehensive study is conducted by evaluating the performance of all existing models in the Scaled-YOLOv4 algorithm (YOLOv4s, YOLOv4m, YOLOV4-CSP, YOLOv4-P5, YOLOV4-P6 and YOLOv4-P7) on the novel SUN and PICCOLO polyp datasets. The proposed method is the first study for the optimization of YOLO-based algorithms in the literature and makes a significant contribution to the detection accuracy. [ABSTRACT FROM AUTHOR]

For a robot to pick up an object viewed by a camera, the object's position in the image coordinate system must be converted to the robot coordinate system. Recently, a neural network-based method was proposed to achieve this task. This methodology can accurately convert the object's position despite errors and disturbances that arise in a real-world environment, such as the deflection of a robot arm triggered by changes in the robot's posture. However, this method has some drawbacks, such as the need for significant effort in model selection, hyperparameter tuning, and lack of stability and interpretability in the learning results. To address these issues, a method involving linear and nonlinear regressions is proposed. First, linear regression is employed to convert the object's position from the image coordinate system to the robot base coordinate system. Next, B-splines-based nonlinear regression is applied to address the errors and disturbances that occur in a real-world environment. Since this approach is more stable and has better calibration performance with interpretability as opposed to the recent method, it is more practical. In the experiment, calibration results were incorporated into a robot, and its performance was evaluated quantitatively. The proposed method achieved a mean position error of 0.5 mm, while the neural network-based method achieved an error of 1.1 mm. [ABSTRACT FROM AUTHOR]

The ongoing container shortage crisis has presented significant challenges for the freight forwarding industry, requiring companies to implement adaptive measures in order to maintain peak operational efficiency. This article presents a novel mathematical model and artificial bee colony algorithm (ABC) with a Pareto-based approach to solve single-container-loading problems. The goal is to fit a set of boxes with strongly heterogeneous boxes into a container with a specific dimension to minimize the broken space and maximize profits. Furthermore, the proposed algorithm incorporates the bottom-left fill method, which is a heuristic strategy for packing containers. We conducted numerical testing to identify optimal parameters using the C ~ metric method. Subsequently, we evaluated the performance of our proposed algorithm by comparing it to other heuristics and meta-heuristic approaches using the relative improvement (RI) value. Our analysis showed that our algorithm outperformed the other approaches and achieved the best results. These results demonstrate the effectiveness of the proposed algorithm in solving real-world single-container-loading problems for freight forwarding companies. [ABSTRACT FROM AUTHOR]

In this research, an Artificial Bee Colony (ABC) algorithm based Selective Harmonics Elimination (SHE) technique is used as a pulse generator in a reduced switch fifteen level inverter that receives input from a PV system. Pulse width modulation based on Selective Harmonics Elimination is mostly used to suppress lower-order harmonics. A high gain DC-DC-SEPIC converter keeps the photovoltaic (PV) panel's output voltage constant. The Grey Wolf Optimization (GWO) filter removes far more Photovoltaic panel energy from the sunlight frame. To eliminate voltage harmonics, this unique inverter architecture employs a multi-carrier duty cycle, a high-frequency modulation approach. The proposed ABC harmonics elimination approach is compared to SHE strategies based on Particle Swarm Optimization (PSO) and Flower Pollination Algorithm (FPA). The suggested system's performance is simulated and measured using the MATLAB simulation tool. The proposed ABC approach has a THD level of 4.86%, which is better than the PSO and FPA methods. [ABSTRACT FROM AUTHOR]

The artificial bee colony (ABC) algorithm is well known and widely used optimization method based on swarm intelligence, and it is inspired by the behavior of honeybees searching for a high amount of nectar from the flower. However, this algorithm has not been exploited sufficiently. This research paper proposes a novel method to analyze the exploration and exploitation of ABC. In ABC, the scout bee searches for a source of random food for exploitation. Along with random search, the scout bee is guided by a modified genetic algorithm approach to locate a food source with a high nectar value. The proposed algorithm is applied for the design of a nonlinear controller for a continuously stirred tank reactor (CSTR). The statistical analysis of the results confirms that the proposed modified hybrid artificial bee colony (HMABC) achieves consistently better performance than the traditional ABC algorithm. The results are compared with conventional ABC and nonlinear PID (NLPID) to show the superiority of the proposed algorithm. The performance of the HMABC algorithm-based controller is competitive with other state-of-the-art meta-heuristic algorithm-based controllers in the literature. [ABSTRACT FROM AUTHOR]