Search

In supply chain network (SCN) management, multi-objective Pareto optimization means the network can meet the demand for both minimal cost and minimal lead-time in SCN. Due to the compromise between cost and lead-time, it is a non-trivial issue to search for multi-objective Pareto optimal solutions (POS) in SCN. Furthermore, with the wide application of the internet, an increasing number of SCN applications have been based on the internet. As a result, the complexity of SCN increases exponentially with the number of suppliers increasing. It is really a big challenge to find the global multi-objective POS within a limited time in SCN management. In order to solve this problem, first, this paper proposes an artificial bee colony (ABC) optimization algorithm with two improvements: (1) a novel solution framework designed to extend the application field of the SCN based on complex network; (2) the acceleration of search speed by adopting naive Bayes classifier. Second, the paper provides a case example of optimizing a three-echelon SCN with the objective of minimizing both cost and lead-time. After the simulation with this example, it turns out that the enhanced ABC algorithm can satisfy the requirements of: (1) finding the global multi-objective POS; (2) improving the speed of finding optimal solutions in SCN management. [ABSTRACT FROM AUTHOR]

As a relatively new model, the artificial bee colony algorithm (ABC) has shown impressive success in solving optimization problems. Nevertheless, its efficiency is still not satisfactory for some complex optimization problems. This paper has modified ABC and its other recent variants to improve its performance by modifying the scout phase. This modification enhances its exploitation ability by intensifying the regions in the search space, which probably includes reasonable solutions. The experiments were performed on CEC2014, and CEC2015 benchmark suites, real-life problems. And the proposed modification was applied to basic ABC, Gbest-Guided ABC, Depth First Search ABC, and Teaching–Learning Based ABC, and they were compared with their modified counterparts. The results have shown that our modification can successfully increase the performance of the original versions. Moreover, the proposed modified algorithm was compared with the state-of-the-art optimization algorithms, and it produced competitive results. [ABSTRACT FROM AUTHOR]

In this paper, a Joint set-up procedure for tuning metaheuristic algorithms' parameters is proposed. The approach is applied to a genetic algorithm (GA) and tested further on the artificial bee colony (ABC) algorithm. The joint influence of parameters (the crossover and mutation probabilities for GA and the number of population and limit for ABC) on the performance of the algorithms is investigated. As a case study, a model parameter identification of an E. coli fed-batch cultivation process is considered. E. coli is one of the most commonly used bacteria for producing medical substances in the pharmaceutical industry. The development of an effective model of a fed-batch cultivation process is very important. The processes in a bioreactor are usually described by a system of parametric nonlinear differential equations. The model parameter identification is a difficult optimization problem, which cannot be solved by applying traditional numerical methods. Feasibilities of GA and ABC for a model parameter identification of a nonlinear fed-batch cultivation process based on real experimental data are presented. The application of the proposed Joint set-up approach leads to a significant improvement in the performance of GA and ABC. As a result, a reasonable enhancement of the E. coli cultivation model accuracy is achieved. The main advantage of the tuning procedure, which searches an optimal set of values of GA and ABC control parameters, focusing on promising intervals of variation of the parameter values and refining their ranges, is that the computational efforts are reduced by more than 60% for the ABC algorithm and more than 90% for GA. [ABSTRACT FROM AUTHOR]

Cloud computing delivers practical solutions for long-term image archiving systems. Cloud data centers consume enormous amounts of electrical energy that increases their operational costs. This shows the importance of investing on energy consumption techniques. Dynamic placement of virtual machines to appropriate physical nodes using metaheuristic algorithms is among the methods of reducing energy consumption. In metaheuristic algorithms, there should be a balance between both exploration and exploitation aspects so that they can find better solutions in a search space. Exploration means looking for a solution in a wider area, while exploitation is producing new solutions from existence ones. Artificial bee colony optimization, which is a biological metaheuristic algorithm, is a sign-oriented approach. It has a strong exploration ability, but a relatively weaker exploitation power. On the other hand, tabu search is a popular algorithm that shows better exploitation in comparison with ABC. In this study, cloud computing environments are detailed with an allocation protocol for efficient energy and resource management. The technique of energy-aware allocation splits data centers (DCs) resources among client applications end routes to enhance energy efficacy of DCs and also achieves anticipated quality of service (QoS) for everyone. Heuristic protocols are exercised for optimizing the distribution of resources to upgrade the efficiency of DC. In the current paper, energy-aware resources allotment technique is employed and optimized in clouds via a new approach called Tabu Job Master (JM). Tabu JM claims the benefits of some variables and also rapid convergence speeds. Results are duly achieved for energy consumption—the count of virtual machines (VMs) migration and also makespan. The results shown by Tabu JM are benchmarked by using genetic algorithm (GA), artificial bee colony (ABC), ABC with crossover and technique of mutation, the basic tabu search techniques, and Tabu Job Master. [ABSTRACT FROM AUTHOR]

This paper proposes an efficient version of artificial bee colony (ABC) algorithm based on the island model concepts. The new version is called the island artificial bee colony (iABC) algorithm. It uses the structured population concept by applying the island model to improve the diversification capabilities of ABC. In the island model, the population is divided into a set of sub-populations called islands, each of which is manipulated separately by an independent variant of the ABC. After a predefined number of iterations, the islands exchange their solutions by migration. This process can help ABC in controlling the diversity of the population during the search process and thus improve the performance. The proposed iABC is evaluated using global optimization functions established by the IEEE-CEC 2015 which include 15 test functions with various dimensions and complexities (i.e., 10, 30, and 50). In order to evaluate the performance of iABC, various parameter settings are utilized to test the effectiveness of their convergence properties. Furthermore, the performance of iABC is compared against 19 comparative methods that used the same IEEE-CEC 2015 test functions. The results show that iABC produced better results when compared with ABC in all IEEE-CEC 2015 test functions, while the results of iABC better than those of the other island-based algorithm on almost all test functions. Furthermore, iABC is able to obtain three new results for three test functions better than all the comparative methods. Using Friedman test and Holm's procedure, iABC is ranked third, seventh, and ninth out of 19 comparative methods for the test functions with 10, 30, 50 dimensionality, respectively. [ABSTRACT FROM AUTHOR]

Image processing-based fire/flame detection has become popular in recent years. In this paper, a novel fire/flame detection system based on a new conversion matrix and artificial bee colony algorithm was presented. Flame and non-flame image pixel values were combined to have a new feature matrix. A conversion matrix was generated randomly. The conversion matrix was multiplied by the feature matrix. The error of this multiplication result was calculated using the K-means clustering algorithm. The conversion matrix was updated until getting desired performance using artificial bee colony algorithm. At the end of the updating process, updated conversion matrix was multiplied with all images in the dataset to move all images to new color space. The final images were converted into binary images. Otsu method was used to get binary images. These binary images were compared with the corresponding ground truth images in the dataset. The aim of this comparison is to calculate the similarity ratio of the two images. This ratio shows the extent to which the original image features are preserved. A forest fire dataset was used which has 500 forest fire images. It is publicly available and called as Corsican Fire Database. Jaccard and Dice similarity measure parameters were used to evaluate the proposed system performance and compared with other similar study such as particle swarm optimization. Evaluated mean Jaccard index value was 0.76, and mean Dice index value was 0.85. This evaluation was made for 500 images. These results provide that this system can be used in fire/flame detection systems. [ABSTRACT FROM AUTHOR]

The aim of the present paper is to introduce an innovative algorithmic approach, the Distance Related Artificial Bee Colony Algorithm (DRABC), as a variant of the original Artificial Bee Colony (ABC) algorithm. The aforementioned approach has been employed in the solution of the team orienteering problem (TOP). TOP fits into the category of vehicle routing problems with Profits, and such, each node is associated with a score value. The objective of the TOP is the formation of feasible routes with respect to a total travel time limit that corresponds to the total score value maximization. Summarizing the proposed approach, the algorithm applies the original equations of the ABC, on accordingly encoded solution vectors, namely on vectors that present the Euclidean distance between consecutive nodes in a route. This process is combined with a decoding method, to express the solution vector as an ordered sequence of nodes. This encoding/decoding method is referred to as "Distance Related" procedure. The proposed approach achieves most of the best known solutions of the benchmark instances found in the literature, and the performance of the DRABC algorithm is compared to others regarding the solution of the TOP. [ABSTRACT FROM AUTHOR]

For effective diagnosis of health conditions, there is a need to process medical images to obtain meaningful information. The diagnosis of brain tumors begins with magnetic resonance imaging (or MRI) scan. This is followed by segmentation of the medical images so obtained which can prove cumbersome if it were to be performed manually. Determining the best approach to do segmentation remains challenge among multiple computerized approaches. This paper combines both the identification and classification of tumors from the MRI results and is backed by a cloud-based framework to provision the same. The phase of extraction of features includes the utilization of a Hadoop framework and Gabor filter along with variations in terms of orientation and scale. Artificial bee colony algorithm and support vector machine classifier have been used to designate the degree of optimal features and categorize the same. The grading of brain tumors from MRI images can be fulfilled by the aforementioned approach. The said approach is believed to deliver promising results in terms of accuracy, which has also been verified experimentally. [ABSTRACT FROM AUTHOR]

Very often, voltage instability causes millions of money to cater with the negative effects it gave to the people; therefore, it is very important that prior to this worst situation, some manual or automatic recovery system had to be turn on to minimize or totally avoid the entire situation. But these recovery systems will not be turn on if there is no good indication or alarm that controls or informs. In this paper, evolved intelligent clustered artificial bee colony (EICBC) is introduced to predict the voltage stability condition of the IEEE 30-bus test system. Fast Voltage Stability Index is utilized as an indicator to measure the distance of the power system network to the voltage collapse point when the reactive load is varied slowly as reactive load gives the most impact on the stability of the system. EICBC is able to converge faster to its best solution while maintaining the stability of the prediction system by avoiding local minima convergence. The results also show that the proposed algorithm is superior in the prediction accuracy and can be used to categorize the conditions of the network for the ease of identification. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) algorithm is one of the most recent swarm intelligence-based algorithms simulate the foraging behavior of honey bees in their hive. ABC starts with a colony of artificial bees with sole aim of discovering the place of food sources with high nectar amount using the solution search equation in the employed bee and onlooker bee operators. However, the solution search equation is good in exploration and poor in exploitation. In this paper, the solution search equation of the onlooker bee is modified by using a value of the fittest food sources selected by a set of selection schemes inspired from the evolutionary algorithms. This is to guide the search process of onlooker bee toward the fittest food sources from the population in order to empower the exploitation capability and convergence. Four selection schemes are incorporated with the ABC algorithm to choose the fittest food sources in four versions as follows: global-best, tournament, linear rank, and exponential rank. For evaluation purposes, 10 classical benchmark optimization functions are used to study the sensitivity analysis of each ABC algorithm to its parameters. The performance of the proposed ABC versions is compared with the original ABC version in order to study the effectiveness of the modifications. In addition, a comparative evaluation of ABC algorithms is carried out against the state-of-the-art methods that worked on CEC2005 benchmark functions, CEC2015 benchmark functions, and two real-world cases of economic load dispatch problem. The experimental results show that the selection schemes incorporated within the search equation of the onlooker bee directly affects the performance of ABC algorithm. [ABSTRACT FROM AUTHOR]

Clustering Search ( *CS) has been proposed as a generic way of combining search metaheuristics with clustering to detect promising search areas before applying local search procedures. The clustering process may keep representative solutions associated with different search subspaces. In this paper, new approaches are proposed, based on *CS, as an Artificial Bee Colony-based one, which detects promising food sources alike *CS approaches. The other new *CS approach is based on Differential Evolution (DE) algorithm. The DE is just a CS component (the evolutionary algorithm), different from ABC-based approach, called Artificial Bee Clustering Search (ABCS). ABCS tries to find promising solutions using some concepts from CS. The proposed hybrid algorithms, performing a Hooke and Jeeves-based local, are compared to another hybrid approaches, exploring an elitist criteria to apply local search. The experiments show that the proposed ABCS and Differential Evolutionary Clustering Search (DECS) are competitive for the majority continuous optimization functions benckmarks selected in this paper. [ABSTRACT FROM AUTHOR]

In this paper, we present an efficient adaptive artificial bee colony (EA-ABC) algorithm that includes an adaptive mutation mechanism, guaranteed convergence mechanism and optimal tracking mechanism. The EA-ABC algorithm is applied to cooperative spectrum sensing for a cognitive radio field. An efficient sensing scheme can reduce the false alarm probability and enhance the detection probability, which can improve spectrum utilization. Simulations are conducted to compare the performance of the proposed cooperative spectrum sensing method based on the EA-ABC algorithm with that of the cooperative spectrum sensing method using the ABC, particle swarm optimization (PSO), and modified PSO algorithms. The simulation results validate the effectiveness and reliability of the proposed method and demonstrate that EA-ABC-based can achieve higher detection probability than other methods under the same false alarm probability. [ABSTRACT FROM AUTHOR]

The meta-heuristic search algorithms have been widely applied to solve the various science and engineering optimization problems. However, the performance of these algorithms is highly sensitive toward the number of objective functions and number of decision variables. Recently, it has been explored by the researchers that the performance of such algorithm degrades when the number of objective functions and decision variables increases by some limit. Hence, these algorithms can be hardly acceptable to the real-world optimization problems such as software module clustering problem (SMCP), which contains a large number of objective functions and decision variables. Previous researchers have proposed several approaches to address the many-objective optimization problems by revising existing meta-heuristic algorithms. Recently, an artificial bee colony algorithm (ABC), a meta-heuristic algorithm, effectively used to address the several multi-objective optimization problems. Even though in most of the cases ABC algorithm performs better compared to other meta-heuristic algorithms, it faces the same problems as other meta-heuristic algorithms for a large number of objective functions and decision variables. This paper proposes a many-objective artificial bee colony (MaABC) algorithm to solve many-objective SMCPs. In this contribution, we revised the original ABC by using, quality indicator, Lp-norm-based (p < 1) distances, and two external archives concepts. To validate the proposed approach, an extensive comparative study is performed with the existing many-objective optimization algorithms (i.e., Two-Arch2, NSGA-III, MOEA/D, and IBEA) over seven SMCPs. The statistical analysis of the results show that the proposed MaABC outperforms existing many-objective approaches in terms of modularization quality (MQ), cohesion, coupling, and inverted generational distance (IGD). [ABSTRACT FROM AUTHOR]

Swarm intelligence (SI)-based metaheuristics are well applied to solve real-time optimization problems of efficient node clustering and energy-aware data routing in wireless sensor networks. This paper presents another superior approach for these optimization problems based on an artificial bee colony metaheuristic. The proposed clustering algorithm presents an efficient cluster formation mechanism with improved cluster head selection criteria based on a multi-objective fitness function, whereas the routing algorithm is devised to consume minimum energy with least hop-count for data transmission. Extensive evaluation and comparison of the proposed approach with existing well-known SI-based algorithms demonstrate its superiority over others in terms of packet delivery ratio, average energy consumed, average throughput and network life. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid discrete artificial bee colony (HDABC) algorithm for solving the location allocation problem in reverse logistics network system. In the proposed algorithm, each solution is represented by two vectors, i.e., a collection point vector and a repair center vector. Eight well-designed neighborhood structures are proposed to utilize the problem structure and can thus enhance the exploitation capability of the algorithm. A simple but efficient selection and update approach is applied to the onlooker bee to enhance the exploitation process. A scout bee applies different local search methods to the abandoned solution and the best solution found so far, which can increase the convergence and the exploration capabilities of the proposed algorithm. In addition, an enhanced local search procedure is developed to further improve the search capability. Finally, the proposed algorithm is tested on sets of large-scale randomly generated benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed HDBAC algorithm is shown against several efficient algorithms from the literature. [ABSTRACT FROM AUTHOR]

As a relatively new optimization technique, in recent years, artificial bee colony (ABC) algorithm has attracted much attention for its good performance. However, its performance has also been challenged in solving complex optimization problems. This insufficiency is mainly caused by its solution search equation, which does well in exploration but badly in exploitation. Inspired by the concept of neighborhood search, in this paper, we introduce a global neighborhood search operator into ABC for balancing its explorative and exploitative capabilities. Extensive experiments are conducted on 22 benchmark functions, and six different algorithms are included in the comparison studies, including four ABC variants and two related evolutionary algorithms. The compared results demonstrate that in most cases our approach is able to provide better performance in terms of solution accuracy and convergence speed. [ABSTRACT FROM AUTHOR]

This paper presents a new hybridized algorithm known as Firefly algorithm-based least square (FA-LS) method for power system harmonic estimation. It uses a Firefly algorithm-based approach to estimate the phases and a least-square method for estimating the amplitudes of the harmonic signals. The simulation results are presented to demonstrate the estimation accuracy of FA-LS with the recently proposed particle swarm optimization with passive congregation and artificial bee colony with LS algorithms. The obtained results of FA-LS reveal that this algorithm is best in terms of accuracy and computational time. Practical validation is also made with the experimentation of the algorithm with real-time data obtained from a switch mode power supply with the power quality analyzer and estimation is performed under simulating environment. [ABSTRACT FROM AUTHOR]

The paper incorporates new extensional strategies into the traditional multi-objective optimization algorithms to proficiently obtain the Pareto-optimal solutions in the presence of noise in the fitness landscapes. The first strategy, referred to as adaptive selection of sample size, is employed to assess the trade-off between accuracy in fitness estimation and the associated run-time complexity. The second strategy is concerned with determining statistical expectation of fitness samples, instead of their conventional averaging, as the fitness measure of the trial solutions. The third strategy aims at improving Goldberg's approach to examine possible accommodation of a seemingly inferior solution in the optimal Pareto front using a more statistically viable comparator. The traditional Non-dominated Sorting Bee Colony algorithm has been ameliorated by extending its selection step with the proposed strategies. Experiments undertaken to study the performance of the proposed algorithm reveal that the extended algorithm outperforms its contenders with respect to four performance metrics, when examined on a test suite of 23 standard benchmarks with additive noise of three statistical distributions. [ABSTRACT FROM AUTHOR]

In this work, a new adaptive extreme learning machine (ELM) neural network-based fuzzy controller is designed and simulated for implementing speed regulation in a permanent magnet synchronous motor. ELM is a neural model wherein the number of hidden neurons to be placed in the hidden layer is tuned during the process of neural network training itself. A new adaptive ELM model is developed for placing the number of hidden neurons in the hidden layer, and this new adaptive ELM is tuned with artificial bee colony (ABC) algorithm for optimizing its weight parameters and also the number of hidden neurons. Fuzzy proportional–integral (PI) controller is developed in this work in order to eliminate the steady-state error. The new adaptive ELM neural model optimized with ABC algorithm is applied to tune the input parameters of the fuzzy PI controller and also on optimizing the rules and fuzzy membership functions. The optimized adaptive ELM neural network-based fuzzy PI controller is utilized to investigate the speed regulation of permanent magnet synchronous motor (PMSM) in this work. The developed new PI controller with the PMSM is tested for its performance characteristics and to prove its validity is compared with the traditional controller and other heuristic controllers proposed in earlier literature works. [ABSTRACT FROM AUTHOR]

ANFIS is an artificial intelligence technique which is composed of a combination of artificial neural networks and fuzzy inference system. Due to its structure, it is used in modeling and identifying numerous systems in various fields. The training process of ANFIS is important to obtain effective results with it. So, a successful training algorithm should be used. In this study, the ANFIS is trained by using ABC algorithm for the solution of the real-world problem. For this purpose, the number of foreign visitors coming to Turkey from the USA, Germany, Bulgaria, France, Georgia, the Netherlands, England, Iran and Russia is estimated. In addition, total number of visitors coming to Turkey is also predicted. In applications, 150 months of data between July 2002 and December 2014 are utilized and a time series is created using these data. The results obtained using ABC algorithm are compared with GA, DE, HS and PSO. As a conclusion, it is seen that the results obtained using ABC algorithm for estimation of number of foreign visitors are more successful than other optimization methods. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) algorithm inspired by the complex behaviors of honey bees in foraging is one of the most significant swarm intelligence-based meta-heuristics and has been successfully applied to a number of numerical and combinatorial optimization problems. In this study, for increasing the early convergence performance of the ABC algorithm while protecting the qualities of the final solutions, a new exploitation mechanism from the best food source that is managed by the number of evaluations is described and its efficiency on both employed and onlooker bee phases is analyzed. The results of the experimental studies obtained from a set of benchmark problems showed that the ABC algorithm with the proposed method performs significantly better than the standard implementation of ABC algorithm and its other variants in terms of convergence speed and solution quality especially for the difficult problems that should be solved before completion of the relatively small number of fitness evaluations. [ABSTRACT FROM AUTHOR]

In this study, we have introduced a hybrid version of artificial bee colony (ABC) and shuffled frog-leaping algorithm (SFLA). The hybrid version is a two-phase modification process. In the first phase to increase the global convergence, the initial population is produced using randomly generated and chaotic system, and then in the second phase to balance two antagonist factors, i.e., exploration and exploitation capabilities, population is portioned into two groups (superior and inferior) based on their fitness values. ABC is applied to the first group, whereas SFLA is applied to the second group of population. The proposed version is named as Shuffled-ABC. The proposal is implemented and tested on constrained benchmark consulted from CEC 2006 and five chemical engineering problems where constraints are handled using penalty function methods. The simulated results illustrate the efficacy of the proposal. [ABSTRACT FROM AUTHOR]

This study aims to build an artificial intelligence (AI)-based inference model to predict the coefficient of performance (COP) for refrigeration equipment under various R404A refrigerant conditions. The proposed model, the evolutionary multivariate adaptive regression splines (EMARS), is a hybrid of the multivariate adaptive regression splines (MARS) and the artificial bee colony (ABC). In the EMARS, the MARS primarily addresses the learning and curve fitting and the ABC carries out optimization to determine the fittest parameter settings with minimal prediction error. A tenfold cross-validation method was used to compare the performance of the EMARS against four other AI techniques, including the back-propagation neural network, classification and regression tree, genetic programming, and support vector machine. An analysis of comparison results supports EMARS as the best model for predicting the COP, with an MAPE value $$<$$ 1%. In addition to performing significantly better than the four benchmark models, EMARS is unique in being able to: operate automatically without human intervention or domain knowledge; explore the approximate function of the input-output relationship; and identify the relative importance of various factors of influence automatically. [ABSTRACT FROM AUTHOR]

As a relatively new global optimization technique, artificial bee colony (ABC) algorithm becomes popular in recent years for its simplicity and effectiveness. However, there is still an inefficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To overcome this drawback, a Gaussian bare-bones ABC is proposed, where a new search equation is designed based on utilizing the global best solution. Furthermore, we employ the generalized opposition-based learning strategy to generate new food sources for scout bees, which is beneficial to discover more useful information for guiding search. A comprehensive set of experiments is conducted on 23 benchmark functions and a real-world optimization problem to verify the effectiveness of the proposed approach. Some well-known ABC variants and state-of-the-art evolutionary algorithms are used for comparison. The experimental results show that the proposed approach offers higher solution quality and faster convergence speed. [ABSTRACT FROM AUTHOR]

An information sharing artificial bee colony (ABC) algorithm has been proposed for locating and tracking multiple peaks in non-stationary environments. The niching method has been adapted by hybridizing two techniques. A modified variant of the fitness sharing has been used for detecting multiple peaks simultaneously and a speciation based technique is employed to keep the better individuals of the previous generation. The base algorithm used here is a modified variant of ABC that helps to synchronize the employer and onlooker forager swarms by synergizing the local information. The main crux of our algorithm is its independency of the problem dependent control parameters, like niche radius, and the absence of any hard-partitioning technique that leads to high computational burden. Our framework aims at bringing about a simple, robust approach that can be applied to a variety of dynamic functional landscapes. Experimental investigations are undertaken on standard benchmarks focussing on the competitive performance of our algorithm in contrast to the existing state-of-the-art to highlight the significance of our work. [ABSTRACT FROM AUTHOR]

Artificial bee colony or ABC is one of the newest additions to the class of population based Nature Inspired Algorithms. In the present study we suggest some modifications in the structure of basic ABC to further improve its performance. The corresponding algorithms proposed in the present study are named Intermediate ABC (I-ABC) and I-ABC greedy. In I-ABC, the potential food sources are generated by using the intermediate positions between the uniformly generated random numbers and random numbers generated by opposition based learning (OBL). I-ABC greedy is a variation of I-ABC, where the search is always forced to move towards the solution vector having the best fitness value in the population. While the use of OBL provides a priori information about the search space, the component of greediness improves the convergence rate. The performance of proposed I-ABC and I-ABC greedy are investigated on a comprehensive set of 13 classical benchmark functions, 25 composite functions included in the special session of CEC 2005 and eleven shifted functions proposed in the special session of CEC 2008, ISDA 2009, CEC 2010 and SOCO 2010. Also, the efficiency of the proposed algorithms is validated on two real life problems; frequency modulation sound parameter estimation and to estimate the software cost model parameters. Numerical results and statistical analysis demonstrates that the proposed algorithms are quite competent in dealing with different types of problems. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) optimization algorithm is relatively a simple and recent population based probabilistic approach for global optimization. ABC has been outperformed over some Nature Inspired Algorithms (NIAs) when tested over benchmark as well as real world optimization problems. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the solution search equation of ABC, there is a enough chance to skip the true solution due to large step size. In order to balance between diversity and convergence capability of the ABC, a new local search phase is integrated with the basic ABC to exploit the search space identified by the best individual in the swarm. In the proposed phase, ABC works as a local search algorithm in which, the step size that is required to update the best solution, is controlled by Golden Section Search approach. The proposed strategy is named as Memetic ABC (MeABC). In MeABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. MeABC is established as a modified ABC algorithm through experiments over 20 test problems of different complexities and 4 well known engineering optimization problems. [ABSTRACT FROM AUTHOR]

Nowadays, the most promising technology for designing optical networks is the wavelength division multiplexing. This technique divides the huge bandwidth of an optical fiber link into different wavelengths, providing different available channels per link. However, a problem comes up when it is necessary to interconnect a set of traffic demands. This problem is known as routing and wavelength assignment problem, and due to its complexity (NP-hard problem) it is very suitable for being solved using evolutionary computation. The selected heuristics is the artificial bee colony algorithm, an heuristics based on the behavior of honeybee foraging for nectar. Therefore, we have applied multiobjective optimization to solve the static routing and wavelength assignment problem, and adapted this algorithm to the multiobjective context. New results have been obtained that significantly improve those published in previous researches. [ABSTRACT FROM AUTHOR]