The paper proposes a hybrid COA-DEA method for solving multi-objective optimization problems. The Cuckoo Optimization Algorithm (COA) is combined with Data Envelopment Analysis (DEA) to generate Pareto efficient frontiers. In the proposed method, the profit function of COA is replaced by the efficiency value calculated from DEA. Test problems are used to compare the hybrid method to other multi-objective algorithms such as GA-DEA and Ranking methods. Results show the hybrid COA-DEA approach finds solutions faster and more accurately than other methods. The method is considered suitable for solving multi-objective problems as it logically combines efficiency evaluation and optimal solution identification.
Recent research in finding the optimal path by ant colony optimizationjournalBEEI
The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real world applications including image processing, file carving and classification problem. Numerous techniques have been proposed in finding optimal path solutions including using ant colony optimization (ACO). This is a nature-inspired metaheuristic algorithm, which is inspired by the foraging behavior of ants in nature. Thus, this paper study the improvement made by many researchers on ACO in finding optimal path solution. Finally, this paper also identifies the recent trends and explores potential future research directions in file carving.
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSijfcstjournal
In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The advantage of
this method is the high accuracy and the dispersion of its Pareto frontier. In order to testing the efficiency of the suggested method, a lot of test problems have been solved using this method. Comparing the results of this method with the results of other similar methods shows that the Cuckoo algorithm is more suitable for solving the multi-objective problems.
EVOLUTIONARY COMPUTING TECHNIQUES FOR SOFTWARE EFFORT ESTIMATIONijcsit
Reliable and accurate estimation of software has always been a matter of concern for industry and academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all types of datasets and environments. Since the motive of estimation model is to minimize the gap between actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune
the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization, Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of COCOMO Model. The performance of these techniques has been analysed by established performance measure. The results obtained have been validated by using data of Interactive voice response (IVR)
projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
Fuzzy clustering has been widely studied and applied in a variety of key areas of science and
engineering. In this paper the Improved Teaching Learning Based Optimization (ITLBO)
algorithm is used for data clustering, in which the objects in the same cluster are similar. This
algorithm has been tested on several datasets and compared with some other popular algorithm
in clustering. Results have been shown that the proposed method improves the output of
clustering and can be efficiently used for fuzzy clustering.
In this project, we investigated the use of association rules to extract useful knowledge from raw ontological data. To this end, we proposed an approach to pass from graph representation to transactional data. Then, we used different technological solutions to improve the performance of frequent item-sets extraction such as the FP-growth algorithm, and Hadoop. Check our code on Github: https://github.com/8-chems/OntologyMiner
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Recent research in finding the optimal path by ant colony optimizationjournalBEEI
The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real world applications including image processing, file carving and classification problem. Numerous techniques have been proposed in finding optimal path solutions including using ant colony optimization (ACO). This is a nature-inspired metaheuristic algorithm, which is inspired by the foraging behavior of ants in nature. Thus, this paper study the improvement made by many researchers on ACO in finding optimal path solution. Finally, this paper also identifies the recent trends and explores potential future research directions in file carving.
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSijfcstjournal
In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The advantage of
this method is the high accuracy and the dispersion of its Pareto frontier. In order to testing the efficiency of the suggested method, a lot of test problems have been solved using this method. Comparing the results of this method with the results of other similar methods shows that the Cuckoo algorithm is more suitable for solving the multi-objective problems.
EVOLUTIONARY COMPUTING TECHNIQUES FOR SOFTWARE EFFORT ESTIMATIONijcsit
Reliable and accurate estimation of software has always been a matter of concern for industry and academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all types of datasets and environments. Since the motive of estimation model is to minimize the gap between actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune
the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization, Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of COCOMO Model. The performance of these techniques has been analysed by established performance measure. The results obtained have been validated by using data of Interactive voice response (IVR)
projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
Fuzzy clustering has been widely studied and applied in a variety of key areas of science and
engineering. In this paper the Improved Teaching Learning Based Optimization (ITLBO)
algorithm is used for data clustering, in which the objects in the same cluster are similar. This
algorithm has been tested on several datasets and compared with some other popular algorithm
in clustering. Results have been shown that the proposed method improves the output of
clustering and can be efficiently used for fuzzy clustering.
In this project, we investigated the use of association rules to extract useful knowledge from raw ontological data. To this end, we proposed an approach to pass from graph representation to transactional data. Then, we used different technological solutions to improve the performance of frequent item-sets extraction such as the FP-growth algorithm, and Hadoop. Check our code on Github: https://github.com/8-chems/OntologyMiner
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A STUDY ON MULTI STAGE MULTIOBJECTIVE TRANSPORTATION PROBLEM UNDER UNCERTAINT...IAEME Publication
In present scenario due to high competition in market, there are lots of pressures on
organizations involbs with transportation industry, to provide the service in a better
and effective manner. The distribution of products among the customers in systematic
manner is not an easy task. Transportation models provide an effective framework to
meet these challenges. In an uncertainty environment, it is a too difficult to handle a
multi-objective transportation problem with fixed parameters, rather it is easy to
consider all related factors in terms of linguistic parameters. Different objectives of a
multi-objective transportation problem are affected by multiple numbers of criteria like
route of transportation, weather condition, vehicles used for transportation etc.
In this study a multi-stage multi-objective transportation model is developed with
fuzzy relations. Minimization of both cost and time of transportation are considered as
two different objectives of first stage which are associated with a number of different
criteria like detortion time, fixed charge and mode of transportation. In second stage,
another objective i.e quantity of transported amount is considered on the basis of
previous two objectives. All these factors considered for this model are imprecise in
nature and are represented in terms of linguistic variables. The fuzzy rule based multiobjective
transportation problem is formulated and Genetic Algorithm for multiobjective
problems (MOGA) is used to find optimal solution. The model is presented
with a numerical problem and optimum result is discussed.
A Genetic Algorithm on Optimization Test FunctionsIJMERJOURNAL
ABSTRACT: Genetic Algorithms (GAs) have become increasingly useful over the years for solving combinatorial problems. Though they are generally accepted to be good performers among metaheuristic algorithms, most works have concentrated on the application of the GAs rather than the theoretical justifications. In this paper, we examine and justify the suitability of Genetic Algorithms in solving complex, multi-variable and multi-modal optimization problems. To achieve this, a simple Genetic Algorithm was used to solve four standard complicated optimization test functions, namely Rosenbrock, Schwefel, Rastrigin and Shubert functions. These functions are benchmarks to test the quality of an optimization procedure towards a global optimum. We show that the method has a quicker convergence to the global optima and that the optimal values for the Rosenbrock, Rastrigin, Schwefel and Shubert functions are zero (0), zero (0), -418.9829 and -14.5080 respectively
Improvement of genetic algorithm using artificial bee colonyjournalBEEI
Genetic algorithm (GA) is a part of evolutionary computing that simulates the theory of evolution and natural selection, where this technique depends on a heuristic random search. This algorithm reflects the operation of natural selection, where the fittest individuals are chosen for reproduction so that they produce offspring of the next generation. This paper proposes a method to improve GA using artificial bee colony (GABC). This proposed algorithm was applied to random number generation (RNG), and travelling salesman problem (TSP). The proposed method used to generate initial populations for GA rather than the random generation that used in traditional GA. The results of testing on RNG show that the proposed GABC was better than traditional GA in the mean iteration and the execution time. The results of testing TSP show the superiority of GABC on the traditional GA. The superiority of the GABC is clear in terms of the percentage of error rate, the average length route, and obtaining the shortest route. The programming language Python3 was used in programming the proposed methods.
Study of relevancy, diversity, and novelty in recommender systemsChemseddine Berbague
In the next slides, we present our approach to tackling the conflicting recommendation quality in recommender systems using a genetic-based clustering algorithm. In our approach, we studied the users' tendencies toward diversity and proposed a pairwise similarity measure to amount it. Later, we used the new similarity within a fitness function to create overlapped clusters and to recommend balanced recommendations in terms of diversity and relevancy.
Optimal rule set generation using pso algorithmcsandit
Classification and Prediction is an important resea
rch area of data mining. Construction of
classifier model for any decision system is an impo
rtant job for many data mining applications.
The objective of developing such a classifier is to
classify unlabeled dataset into classes. Here
we have applied a discrete Particle Swarm Optimizat
ion (PSO) algorithm for selecting optimal
classification rule sets from huge number of rules
possibly exist in a dataset. In the proposed
DPSO algorithm, decision matrix approach was used f
or generation of initial possible
classification rules from a dataset. Then the propo
sed algorithm discovers important or
significant rules from all possible classification
rules without sacrificing predictive accuracy.
The proposed algorithm deals with discrete valued d
ata, and its initial population of candidate
solutions contains particles of different sizes. Th
e experiment has been done on the task of
optimal rule selection in the data sets collected f
rom UCI repository. Experimental results show
that the proposed algorithm can automatically evolv
e on average the small number of
conditions per rule and a few rules per rule set, a
nd achieved better classification performance
of predictive accuracy for few classes.
A MODIFIED VORTEX SEARCH ALGORITHM FOR NUMERICAL FUNCTION OPTIMIZATIONijaia
The Vortex Search (VS) algorithm is one of the recently proposed metaheuristic algorithms which was
inspired from the vortical flow of the stirred fluids. Although the VS algorithm is shown to be a good
candidate for the solution of certain optimization problems, it also has some drawbacks. In the VS
algorithm, candidate solutions are generated around the current best solution by using a Gaussian
distribution at each iteration pass. This provides simplicity to the algorithm but it also leads to some
problems along. Especially, for the functions those have a number of local minimum points, to select a
single point to generate candidate solutions leads the algorithm to being trapped into a local minimum
point. Due to the adaptive step-size adjustment scheme used in the VS algorithm, the locality of the created
candidate solutions is increased at each iteration pass. Therefore, if the algorithm cannot escape a local
point as quickly as possible, it becomes much more difficult for the algorithm to escape from that point in
the latter iterations. In this study, a modified Vortex Search algorithm (MVS) is proposed to overcome
above mentioned drawback of the existing VS algorithm. In the MVS algorithm, the candidate solutions
are generated around a number of points at each iteration pass. Computational results showed that with
the help of this modification the global search ability of the existing VS algorithm is improved and the
MVS algorithm outperformed the existing VS algorithm, PSO2011 and ABC algorithms for the benchmark
numerical function set.
A NEW APPROACH IN DYNAMIC TRAVELING SALESMAN PROBLEM: A HYBRID OF ANT COLONY ...ijmpict
Nowadays swarm intelligence-based algorithms are being used widely to optimize the dynamic traveling salesman problem (DTSP). In this paper, we have used mixed method of Ant Colony Optimization (AOC) and gradient descent to optimize DTSP which differs with ACO algorithm in evaporation rate and innovative data. This approach prevents premature convergence and scape from local optimum spots and also makes it possible to find better solutions for algorithm. In this paper, we’re going to offer gradient descent and ACO algorithm which in comparison to some former methods it shows that algorithm has significantly improved routes optimization.
MOCANAR: A Multi-Objective Cuckoo Search Algorithm for Numeric Association Ru...csandit
Extracting association rules from numeric features
involves searching a very large search space. To
deal with this problem, in this paper a meta-heuris
tic algorithm is used that we have called
MOCANAR. The MOCANAR is a Pareto based multi-object
ive cuckoo search algorithm which
extracts high quality association rules from numeri
c datasets. The support, confidence,
interestingness and comprehensibility are the objec
tives that have been considered in the
MOCANAR. The MOCANAR extracts rules incrementally,
in which, in each run of the algorithm, a
small number of high quality rules are made. In thi
s paper, a comprehensive taxonomy of meta-
heuristic algorithm have been presented. Using this
taxonomy, we have decided to use a Cuckoo
Search algorithm because this algorithm is one of t
he most matured algorithms and also, it is simple
to use and easy to comprehend. In addition, until n
ow, to our knowledge this method has not been
used as a multi-objective algorithm and has not bee
n used in the association rule mining area. To
demonstrate the merit and associated benefits of th
e proposed methodology, the methodology has
been applied to a number of datasets and high quali
ty results in terms of the objectives were
extracted
GENETIC ALGORITHM FOR FUNCTION APPROXIMATION: AN EXPERIMENTAL INVESTIGATIONijaia
Function Approximation is a popular engineering problems used in system identification or Equation
optimization. Due to the complex search space it requires, AI techniques has been used extensively to spot
the best curves that match the real behavior of the system. Genetic algorithm is known for their fast
convergence and their ability to find an optimal structure of the solution. We propose using a genetic
algorithm as a function approximator. Our attempt will focus on using the polynomial form of the
approximation. After implementing the algorithm, we are going to report our results and compare it with
the real function output.
This work considers the multi-objective optimization problem constrained by a system of bipolar fuzzy relational equations with max-product composition. An integer optimization based technique for order of preference by similarity to the ideal solution is proposed for solving such a problem. Some critical features associated with the feasible domain and optimal solutions of the bipolar max-Tp equation constrained optimization problem are studied. An illustrative example verifying the idea of this paper is included. This
is the first attempt to study the bipolar max-T equation constrained multi-objective optimization problems
from an integer programming viewpoint.
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithmaciijournal
In this paper we attempt to solve an automatic clustering problem by optimizing multiple objectives such as automatic k-determination and a set of cluster validity indices concurrently. The proposed automatic clustering technique uses the most recent optimization algorithm Jaya as an underlying optimization stratagem. This evolutionary technique always aims to attain global best solution rather than a local best solution in larger datasets. The explorations and exploitations imposed on the proposed work results to detect the number of automatic clusters, appropriate partitioning present in data sets and mere optimal values towards CVIs frontiers. Twelve datasets of different intricacy are used to endorse the performance of aimed algorithm. The experiments lay bare that the conjectural advantages of multi objective clustering optimized with evolutionary approaches decipher into realistic and scalable performance paybacks.
A NOVEL APPROACH TO MINE FREQUENT PATTERNS FROM LARGE VOLUME OF DATASET USING...IAEME Publication
In this paper, MDL based reduction in frequent pattern is presented. The ideal outcome of any pattern mining process is to explore the data in new insights. And also, we need to eliminate the non-interesting patterns that describe noise. The major problem in frequent pattern mining is to identify the interesting patterns. Instead of performing association rule mining on all the frequent item sets, it is feasible to select a sub set of frequent item sets and perform the mining task. Selecting a small set of frequent item sets from large amount of interesting ones is a difficult task. In our approach, MDL based algorithm is used for reducing the number of frequent item sets to be used for association rule mining is presented.
Machine Learning and Model-Based Optimization for Heterogeneous Catalyst Desi...Ichigaku Takigawa
2nd ICReDD International Symposium—Toward Interdisciplinary Research Guided by Theory and Calculation
Nov. 27 (wed) - Nov. 29 (fri), 2019
https://www.icredd.hokudai.ac.jp/event/1229
Inventory Model with Price-Dependent Demand Rate and No Shortages: An Interva...orajjournal
In this paper, an interval-valued inventory optimization model is proposed. The model involves the price dependent
demand and no shortages. The input data for this model are not fixed, but vary in some real bounded intervals. The aim is to determine the optimal order quantity, maximizing the total profit and minimizing the holding cost subjecting to three constraints: budget constraint, space constraint, and
budgetary constraint on ordering cost of each item. We apply the linear fractional programming approach based on interval numbers. To apply this approach, a linear fractional programming problem is modeled with interval type uncertainty. This problem is further converted to an optimization problem with interval valued
objective function having its bounds as linear fractional functions. Two numerical examples in crisp
case and interval-valued case are solved to illustrate the proposed approach.
A STUDY ON MULTI STAGE MULTIOBJECTIVE TRANSPORTATION PROBLEM UNDER UNCERTAINT...IAEME Publication
In present scenario due to high competition in market, there are lots of pressures on
organizations involbs with transportation industry, to provide the service in a better
and effective manner. The distribution of products among the customers in systematic
manner is not an easy task. Transportation models provide an effective framework to
meet these challenges. In an uncertainty environment, it is a too difficult to handle a
multi-objective transportation problem with fixed parameters, rather it is easy to
consider all related factors in terms of linguistic parameters. Different objectives of a
multi-objective transportation problem are affected by multiple numbers of criteria like
route of transportation, weather condition, vehicles used for transportation etc.
In this study a multi-stage multi-objective transportation model is developed with
fuzzy relations. Minimization of both cost and time of transportation are considered as
two different objectives of first stage which are associated with a number of different
criteria like detortion time, fixed charge and mode of transportation. In second stage,
another objective i.e quantity of transported amount is considered on the basis of
previous two objectives. All these factors considered for this model are imprecise in
nature and are represented in terms of linguistic variables. The fuzzy rule based multiobjective
transportation problem is formulated and Genetic Algorithm for multiobjective
problems (MOGA) is used to find optimal solution. The model is presented
with a numerical problem and optimum result is discussed.
A Genetic Algorithm on Optimization Test FunctionsIJMERJOURNAL
ABSTRACT: Genetic Algorithms (GAs) have become increasingly useful over the years for solving combinatorial problems. Though they are generally accepted to be good performers among metaheuristic algorithms, most works have concentrated on the application of the GAs rather than the theoretical justifications. In this paper, we examine and justify the suitability of Genetic Algorithms in solving complex, multi-variable and multi-modal optimization problems. To achieve this, a simple Genetic Algorithm was used to solve four standard complicated optimization test functions, namely Rosenbrock, Schwefel, Rastrigin and Shubert functions. These functions are benchmarks to test the quality of an optimization procedure towards a global optimum. We show that the method has a quicker convergence to the global optima and that the optimal values for the Rosenbrock, Rastrigin, Schwefel and Shubert functions are zero (0), zero (0), -418.9829 and -14.5080 respectively
Improvement of genetic algorithm using artificial bee colonyjournalBEEI
Genetic algorithm (GA) is a part of evolutionary computing that simulates the theory of evolution and natural selection, where this technique depends on a heuristic random search. This algorithm reflects the operation of natural selection, where the fittest individuals are chosen for reproduction so that they produce offspring of the next generation. This paper proposes a method to improve GA using artificial bee colony (GABC). This proposed algorithm was applied to random number generation (RNG), and travelling salesman problem (TSP). The proposed method used to generate initial populations for GA rather than the random generation that used in traditional GA. The results of testing on RNG show that the proposed GABC was better than traditional GA in the mean iteration and the execution time. The results of testing TSP show the superiority of GABC on the traditional GA. The superiority of the GABC is clear in terms of the percentage of error rate, the average length route, and obtaining the shortest route. The programming language Python3 was used in programming the proposed methods.
Study of relevancy, diversity, and novelty in recommender systemsChemseddine Berbague
In the next slides, we present our approach to tackling the conflicting recommendation quality in recommender systems using a genetic-based clustering algorithm. In our approach, we studied the users' tendencies toward diversity and proposed a pairwise similarity measure to amount it. Later, we used the new similarity within a fitness function to create overlapped clusters and to recommend balanced recommendations in terms of diversity and relevancy.
Optimal rule set generation using pso algorithmcsandit
Classification and Prediction is an important resea
rch area of data mining. Construction of
classifier model for any decision system is an impo
rtant job for many data mining applications.
The objective of developing such a classifier is to
classify unlabeled dataset into classes. Here
we have applied a discrete Particle Swarm Optimizat
ion (PSO) algorithm for selecting optimal
classification rule sets from huge number of rules
possibly exist in a dataset. In the proposed
DPSO algorithm, decision matrix approach was used f
or generation of initial possible
classification rules from a dataset. Then the propo
sed algorithm discovers important or
significant rules from all possible classification
rules without sacrificing predictive accuracy.
The proposed algorithm deals with discrete valued d
ata, and its initial population of candidate
solutions contains particles of different sizes. Th
e experiment has been done on the task of
optimal rule selection in the data sets collected f
rom UCI repository. Experimental results show
that the proposed algorithm can automatically evolv
e on average the small number of
conditions per rule and a few rules per rule set, a
nd achieved better classification performance
of predictive accuracy for few classes.
A MODIFIED VORTEX SEARCH ALGORITHM FOR NUMERICAL FUNCTION OPTIMIZATIONijaia
The Vortex Search (VS) algorithm is one of the recently proposed metaheuristic algorithms which was
inspired from the vortical flow of the stirred fluids. Although the VS algorithm is shown to be a good
candidate for the solution of certain optimization problems, it also has some drawbacks. In the VS
algorithm, candidate solutions are generated around the current best solution by using a Gaussian
distribution at each iteration pass. This provides simplicity to the algorithm but it also leads to some
problems along. Especially, for the functions those have a number of local minimum points, to select a
single point to generate candidate solutions leads the algorithm to being trapped into a local minimum
point. Due to the adaptive step-size adjustment scheme used in the VS algorithm, the locality of the created
candidate solutions is increased at each iteration pass. Therefore, if the algorithm cannot escape a local
point as quickly as possible, it becomes much more difficult for the algorithm to escape from that point in
the latter iterations. In this study, a modified Vortex Search algorithm (MVS) is proposed to overcome
above mentioned drawback of the existing VS algorithm. In the MVS algorithm, the candidate solutions
are generated around a number of points at each iteration pass. Computational results showed that with
the help of this modification the global search ability of the existing VS algorithm is improved and the
MVS algorithm outperformed the existing VS algorithm, PSO2011 and ABC algorithms for the benchmark
numerical function set.
A NEW APPROACH IN DYNAMIC TRAVELING SALESMAN PROBLEM: A HYBRID OF ANT COLONY ...ijmpict
Nowadays swarm intelligence-based algorithms are being used widely to optimize the dynamic traveling salesman problem (DTSP). In this paper, we have used mixed method of Ant Colony Optimization (AOC) and gradient descent to optimize DTSP which differs with ACO algorithm in evaporation rate and innovative data. This approach prevents premature convergence and scape from local optimum spots and also makes it possible to find better solutions for algorithm. In this paper, we’re going to offer gradient descent and ACO algorithm which in comparison to some former methods it shows that algorithm has significantly improved routes optimization.
MOCANAR: A Multi-Objective Cuckoo Search Algorithm for Numeric Association Ru...csandit
Extracting association rules from numeric features
involves searching a very large search space. To
deal with this problem, in this paper a meta-heuris
tic algorithm is used that we have called
MOCANAR. The MOCANAR is a Pareto based multi-object
ive cuckoo search algorithm which
extracts high quality association rules from numeri
c datasets. The support, confidence,
interestingness and comprehensibility are the objec
tives that have been considered in the
MOCANAR. The MOCANAR extracts rules incrementally,
in which, in each run of the algorithm, a
small number of high quality rules are made. In thi
s paper, a comprehensive taxonomy of meta-
heuristic algorithm have been presented. Using this
taxonomy, we have decided to use a Cuckoo
Search algorithm because this algorithm is one of t
he most matured algorithms and also, it is simple
to use and easy to comprehend. In addition, until n
ow, to our knowledge this method has not been
used as a multi-objective algorithm and has not bee
n used in the association rule mining area. To
demonstrate the merit and associated benefits of th
e proposed methodology, the methodology has
been applied to a number of datasets and high quali
ty results in terms of the objectives were
extracted
GENETIC ALGORITHM FOR FUNCTION APPROXIMATION: AN EXPERIMENTAL INVESTIGATIONijaia
Function Approximation is a popular engineering problems used in system identification or Equation
optimization. Due to the complex search space it requires, AI techniques has been used extensively to spot
the best curves that match the real behavior of the system. Genetic algorithm is known for their fast
convergence and their ability to find an optimal structure of the solution. We propose using a genetic
algorithm as a function approximator. Our attempt will focus on using the polynomial form of the
approximation. After implementing the algorithm, we are going to report our results and compare it with
the real function output.
This work considers the multi-objective optimization problem constrained by a system of bipolar fuzzy relational equations with max-product composition. An integer optimization based technique for order of preference by similarity to the ideal solution is proposed for solving such a problem. Some critical features associated with the feasible domain and optimal solutions of the bipolar max-Tp equation constrained optimization problem are studied. An illustrative example verifying the idea of this paper is included. This
is the first attempt to study the bipolar max-T equation constrained multi-objective optimization problems
from an integer programming viewpoint.
Automatic Unsupervised Data Classification Using Jaya Evolutionary Algorithmaciijournal
In this paper we attempt to solve an automatic clustering problem by optimizing multiple objectives such as automatic k-determination and a set of cluster validity indices concurrently. The proposed automatic clustering technique uses the most recent optimization algorithm Jaya as an underlying optimization stratagem. This evolutionary technique always aims to attain global best solution rather than a local best solution in larger datasets. The explorations and exploitations imposed on the proposed work results to detect the number of automatic clusters, appropriate partitioning present in data sets and mere optimal values towards CVIs frontiers. Twelve datasets of different intricacy are used to endorse the performance of aimed algorithm. The experiments lay bare that the conjectural advantages of multi objective clustering optimized with evolutionary approaches decipher into realistic and scalable performance paybacks.
A NOVEL APPROACH TO MINE FREQUENT PATTERNS FROM LARGE VOLUME OF DATASET USING...IAEME Publication
In this paper, MDL based reduction in frequent pattern is presented. The ideal outcome of any pattern mining process is to explore the data in new insights. And also, we need to eliminate the non-interesting patterns that describe noise. The major problem in frequent pattern mining is to identify the interesting patterns. Instead of performing association rule mining on all the frequent item sets, it is feasible to select a sub set of frequent item sets and perform the mining task. Selecting a small set of frequent item sets from large amount of interesting ones is a difficult task. In our approach, MDL based algorithm is used for reducing the number of frequent item sets to be used for association rule mining is presented.
Machine Learning and Model-Based Optimization for Heterogeneous Catalyst Desi...Ichigaku Takigawa
2nd ICReDD International Symposium—Toward Interdisciplinary Research Guided by Theory and Calculation
Nov. 27 (wed) - Nov. 29 (fri), 2019
https://www.icredd.hokudai.ac.jp/event/1229
Inventory Model with Price-Dependent Demand Rate and No Shortages: An Interva...orajjournal
In this paper, an interval-valued inventory optimization model is proposed. The model involves the price dependent
demand and no shortages. The input data for this model are not fixed, but vary in some real bounded intervals. The aim is to determine the optimal order quantity, maximizing the total profit and minimizing the holding cost subjecting to three constraints: budget constraint, space constraint, and
budgetary constraint on ordering cost of each item. We apply the linear fractional programming approach based on interval numbers. To apply this approach, a linear fractional programming problem is modeled with interval type uncertainty. This problem is further converted to an optimization problem with interval valued
objective function having its bounds as linear fractional functions. Two numerical examples in crisp
case and interval-valued case are solved to illustrate the proposed approach.
Modèle d'une plateforme de veille visant à automatiser la rediffusion de l'in...Serge Courrier
Cette présentation vise à détailler les avantages et inconvénients d'une plateforme de veille documentaire économique complète, depuis l'extraction jusqu'à la diffusion de l'information.
An optimal design of current conveyors using a hybrid-based metaheuristic alg...IJECEIAES
This paper focuses on the optimal sizing of a positive second-generation current conveyor (CCII+), employing a hybrid algorithm named DE-ACO, which is derived from the combination of differential evolution (DE) and ant colony optimization (ACO) algorithms. The basic idea of this hybridization is to apply the DE algorithm for the ACO algorithm’s initialization stage. Benchmark test functions were used to evaluate the proposed algorithm’s performance regarding the quality of the optimal solution, robustness, and computation time. Furthermore, the DE-ACO has been applied to optimize the CCII+ performances. SPICE simulation is utilized to validate the achieved results, and a comparison with the standard DE and ACO algorithms is reported. The results highlight that DE-ACO outperforms both ACO and DE.
THE NEW HYBRID COAW METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSijfcstjournal
In this article using Cuckoo Optimization Algorithm and simple additive weighting method the hybrid COAW algorithm is presented to solve multi-objective problems. Cuckoo algorithm is an efficient and structured method for solving nonlinear continuous problems. The created Pareto frontiers of the COAW proposed algorithm are exact and have good dispersion. This method has a high speed in finding the
Pareto frontiers and identifies the beginning and end points of Pareto frontiers properly. In order to validation the proposed algorithm, several experimental problems were analyzed. The results of which indicate the proper effectiveness of COAW algorithm for solving multi-objective problems.
The New Hybrid COAW Method for Solving Multi-Objective Problemsijfcstjournal
In this article using Cuckoo Optimization Algorithm and simple additive weighting method the hybrid COAW algorithm is presented to solve multi-objective problems. Cuckoo algorithm is an efficient and structured method for solving nonlinear continuous problems. The created Pareto frontiers of the COAW proposed algorithm are exact and have good dispersion. This method has a high speed in finding the Pareto frontiers and identifies the beginning and end points of Pareto frontiers properly. In order to validation the proposed algorithm, several experimental problems were analyzed. The results of which indicate the proper effectiveness of COAW algorithm for solving multi-objective problems
A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMSijfcstjournal
In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed
method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem
transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will
optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The advantage of
this method is the high accuracy and the dispersion of its Pareto frontier. In order to testing the efficiency
of the suggested method, a lot of test problems have been solved using this method. Comparing the results
of this method with the results of other similar methods shows that the Cuckoo algorithm is more suitable
for solving the multi-objective problems.
Optimization of Mechanical Design Problems Using Improved Differential Evolut...IDES Editor
Differential Evolution (DE) is a novel evolutionary
approach capable of handling non-differentiable, non-linear
and multi-modal objective functions. DE has been consistently
ranked as one of the best search algorithm for solving global
optimization problems in several case studies. This paper
presents an Improved Constraint Differential Evolution
(ICDE) algorithm for solving constrained optimization
problems. The proposed ICDE algorithm differs from
unconstrained DE algorithm only in the place of initialization,
selection of particles to the next generation and sorting the
final results. Also we implemented the new idea to five versions
of DE algorithm. The performance of ICDE algorithm is
validated on four mechanical engineering problems. The
experimental results show that the performance of ICDE
algorithm in terms of final objective function value, number
of function evaluations and convergence time.
Optimization of Mechanical Design Problems Using Improved Differential Evolut...IDES Editor
Differential Evolution (DE) is a novel evolutionary
approach capable of handling non-differentiable, non-linear
and multi-modal objective functions. DE has been consistently
ranked as one of the best search algorithm for solving global
optimization problems in several case studies. This paper
presents an Improved Constraint Differential Evolution
(ICDE) algorithm for solving constrained optimization
problems. The proposed ICDE algorithm differs from
unconstrained DE algorithm only in the place of initialization,
selection of particles to the next generation and sorting the
final results. Also we implemented the new idea to five versions
of DE algorithm. The performance of ICDE algorithm is
validated on four mechanical engineering problems. The
experimental results show that the performance of ICDE
algorithm in terms of final objective function value, number
of function evaluations and convergence time.
A Comparison between FPPSO and B&B Algorithm for Solving Integer Programming ...Editor IJCATR
Branch and Bound technique (B&B) is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of sub-problems using parallel computing technology. Flower pollination Algorithm is a recently-developed method in the field of computational intelligence. In this paper is presented an improved version of Flower pollination Meta-heuristic Algorithm, (FPPSO), for solving integer programming problems. The proposed algorithm combines the standard flower pollination algorithm (FP) with the particle swarm optimization (PSO) algorithm to improve the searching accuracy. Numerical results show that the FPPSO is able to obtain the optimal results in comparison to traditional methods (branch and bound) and other harmony search algorithms. However, the benefits of this proposed algorithm is in its ability to obtain the optimal solution within less computation, which save time in comparison with the branch and bound algorithm.Branch and bound, flower pollination Algorithm; meta-heuristics; optimization; the particle swarm optimization; integer programming.
COMPARISON BETWEEN THE GENETIC ALGORITHMS OPTIMIZATION AND PARTICLE SWARM OPT...IAEME Publication
Close range photogrammetry network design is referred to the process of placing a set of
cameras in order to achieve photogrammetric tasks. The main objective of this paper is tried to find
the best location of two/three camera stations. The genetic algorithm optimization and Particle
Swarm Optimization are developed to determine the optimal camera stations for computing the three
dimensional coordinates. In this research, a mathematical model representing the genetic algorithm
optimization and Particle Swarm Optimization for the close range photogrammetry network is
developed. This paper gives also the sequence of the field operations and computational steps for this
task. A test field is included to reinforce the theoretical aspects.
MULTIPROCESSOR SCHEDULING AND PERFORMANCE EVALUATION USING ELITIST NON DOMINA...ijcsa
Task scheduling plays an important part in the improvement of parallel and distributed systems. The problem of task scheduling has been shown to be NP hard. The time consuming is more to solve the problem in deterministic techniques. There are algorithms developed to schedule tasks for distributed environment, which focus on single objective. The problem becomes more complex, while considering biobjective.This paper presents bi-objective independent task scheduling algorithm using elitist Nondominated
sorting genetic algorithm (NSGA-II) to minimize the makespan and flowtime. This algorithm generates pareto global optimal solutions for this bi-objective task scheduling problem. NSGA-II is implemented by using the set of benchmark instances. The experimental result shows NSGA-II generates efficient optimal schedules.
Simulation-based Optimization of a Real-world Travelling Salesman Problem Usi...CSCJournals
This paper presents a real-world case study of optimizing waste collection in Sweden. The problem, involving approximately 17,000 garbage bins served by three bin lorries, is approached as a travelling salesman problem and solved using simulation-based optimization and an evolutionary algorithm. To improve the performance of the evolutionary algorithm, it is enhanced with a repair function that adjusts its genome values so that shorter routes are found more quickly. The algorithm is tested using two crossover operators, i.e., the order crossover and heuristic crossover, combined with different mutation rates. The results indicate that the order crossover is superior to the heuristics crossover, but that the driving force of the search process is the mutation operator combined with the repair function.
Reliable and accurate estimation of software has always been a matter of concern for industry and
academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all
types of datasets and environments. Since the motive of estimation model is to minimize the gap between
actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune
the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization,
Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of
COCOMO Model. The performance of these techniques has been analysed by established performance
measure. The results obtained have been validated by using data of Interactive voice response (IVR)
projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
Reliable and accurate estimation of software has always been a matter of concern for industry and academia. Numerous estimation models have been proposed by researchers, but no model is suitable for all types of datasets and environments. Since the motive of estimation model is to minimize the gap between actual and estimated effort, the effort estimation process can be viewed as an optimization problem to tune the parameters. In this paper, evolutionary computing techniques, including, Bee colony optimization, Particle swarm optimization and Ant colony optimization have been employed to tune the parameters of COCOMO Model. The performance of these techniques has been analysed by established performance measure. The results obtained have been validated by using data of Interactive voice response (IVR) projects. Evolutionary techniques have been found to be more accurate than existing estimation models.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Optimizing Mobile Robot Path Planning and Navigation by Use of Differential E...IOSR Journals
Abstract: Path planning and navigation is essential for an autonomous robot which can move avoiding the
static obstacles in a real world and to reach the specific target. Optimizing path for the robot movement gives
the optimal distance from the source to the target and save precious time as well. With the development of
various evolutionary algorithms, the differential evolution is taking the pace in comparison to genetic algorithm.
Differential evolution has been deployed quite successfully for solving global optimization problem. Differential
evolution is a very simple yet powerful metaheuristics type problem solving method. In this paper we are
proposing a Differential Evolution based path navigation algorithm for mobile path navigation and analyze its
efficiency with other developed approaches. The proposed algorithm optimized the robot path and navigates the
robot to the proper target efficiently.
Using particle swarm optimization to solve test functions problemsriyaniaes
In this paper the benchmarking functions are used to evaluate and check the particle swarm optimization (PSO) algorithm. However, the functions utilized have two dimension but they selected with different difficulty and with different models. In order to prove capability of PSO, it is compared with genetic algorithm (GA). Hence, the two algorithms are compared in terms of objective functions and the standard deviation. Different runs have been taken to get convincing results and the parameters are chosen properly where the Matlab software is used. Where the suggested algorithm can solve different engineering problems with different dimension and outperform the others in term of accuracy and speed of convergence.
1. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
DOI:10.5121/ijcsa.2015.5405 51
A HYBRID COA-DEA METHOD FOR
SOLVING MULTI-OBJECTIVE PROBLEMS
Mahdi Gorjestani1
, Elham shadkam2
, Mehdi Parvizi3
and Sajedeh Aminzadegan4
1,3,4
Department of Industrial Engineering, Faculty of Eng., Khayyam University,
Mashhad, Iran
2
Ph.D. Candidate of Department of Industrial and Systems Engineering, Isfahan
University of Technology, Isfahan, Iran, and Faculty Member of Industrial Engineering
Department, Faculty of Eng, Khayyam University, Mashhad, Iran
Abstract
The Cuckoo optimization algorithm (COA) is developed for solving single-objective problems and it cannot
be used for solving multi-objective problems. So the multi-objective cuckoo optimization algorithm based
on data envelopment analysis (DEA) is developed in this paper and it can gain the efficient Pareto
frontiers. This algorithm is presented by the CCR model of DEA and the output-oriented approach of it.
The selection criterion is higher efficiency for next iteration of the proposed hybrid method. So the profit
function of the COA is replaced by the efficiency value that is obtained from DEA. This algorithm is
compared with other methods using some test problems. The results shows using COA and DEA approach
for solving multi-objective problems increases the speed and the accuracy of the generated solutions.
Keywords
Multi-objective decision making (MODM), Data Envelopment Analysis (DEA), Cuckoo Optimization
Algorithm (COA), Optimization.
1.Introduction
Finding the best solution for an objective subject to some conditions calls optimization. In multi-
objective problems, there is not an optimal solution that can optimize all objectives
simultaneously. So, in order to solve problems the concept of Pareto frontiers is provided.
Usually, there are some Pareto optimized solutions that the best solution will be selected from
them by decision maker. Many practical problems in real world are multi-objective problem.
Several researches developed for solving multi-objective problem.
Ehrgott and Gandibleux studied on the approximate and the accurate problems related to the
combination method of multi-objective problems [1]. Arakawa et al. combined the General DEA
and the Genetic Algorithm to generate the efficient frontier in multi-objective optimization
problems [2]. Deb used the evolutionary algorithms for solving the multi-objective problem [3].
2. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
52
Nakayama et al. drew the Pareto frontier of the multi-objective optimization problems using DEA
in 2001 [4]. Deb et al. obtained the Pareto frontier of the multi-objective optimization problem
using Genetic Algorithm [5]. Kristina Vincova gained the Pareto frontier using DEA [6]. Reyes-
Sierra and Coello Coello investigated the method to solve the multi-objective optimization using
the particle swarm algorithm [7]. Cooper et al. and Tone improved the multi-objective
optimization algorithm using DEA and developed related software [8]. Pham and Ghanbarzadeh
solved the multi-objective optimization algorithm using the Bees Algorithm [9]. Nebro et al.
investigated a new method for multi-objective optimization algorithm based on the particle
swarm algorithm [10]. Yun et al. studied the solution of multi-objective optimization algorithm
using the GA and DEA. Also, they applied their method to generating the Pareto efficient
frontiers [11]. Yang and Deb used the Cuckoo optimization algorithm in order to solve the multi
objective-problem [12].
In this article, it is tried to use the meta-heuristic Cuckoo algorithm with the DEA approach for
solving multi-objective problems and draw the Pareto frontiers for efficient points of the
considered objective functions. Because of using CCR model of DEA, proposed method only
applicable to generating the convex efficient frontier. In the second section, the Cuckoo algorithm
is introduced. In the third section the multi-objective problems are defined. In the fourth section,
the concept of DEA is explained. The fifth section expresses the proposed hybrid method and in
the sixth section the test problems are given. At last the desired conclusion is provided.
2.Introducing the Cuckoo optimization algorithm
The COA is one of the best and newest evolutionary algorithms. After early evolutionary
methods like Genetic algorithm (GA), Simulated Annealing algorithm, so many evolutionary
methods that inspired from the nature, have been developed. Some of the useful algorithms for
solving complicated optimization problems are Particle Swarm Optimization (PSO), Ant Colony
Optimization (ACO), Artificial Bee Colony algorithm (ABC) and the Artificial Fish Swarm
algorithm. One of the other evolutionary algorithms that are developed in Iran is Imperialist
Competitive Algorithm (ICA). This algorithm is inspired from the competitive system of the
empires in order to get more colonies. After the ICA, the Cuckoo optimization algorithm is
presented that has the ability to find the general optimized solutions. This algorithm is inspired
from the life of a bird calls Cuckoo. The cuckoo living and egg laying method is a suitable
inspiration for inventing an evolutionary algorithm. The survival with the least effort is the base
of this method. This lazy bird forces other birds to play an important role in her survival so
nicely. The Cuckoo optimization algorithm expanded by Yang and Deb in 2009. This algorithm is
inspired by the egg laying method of cuckoos combined with the Levy Flight instead of simple
random isotropic walk. The COA investigated with more details by Rajabioun in 2011 [13].
The flowchart of the COA is given in the Figure 1.
3. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
53
Figure1. The flowchart of COA algorithm
For more information refers to [13].
3.The multi-objective optimization problem
The general form of a multi-objective optimization problem is as (1):
݊݅ܯ ݎ ݔܽܯ = ሼ݂ଵ, ݂ଶ, … , ݂ሽ
.ݏ ݃ .ݐሺݔሻ = ܿݔ
ୀଵ
≤ ܾ, ݅ = 1, … , ݉
ݔ ≥ 0, ݆ = 1, . . . , ݊
(1)
As it shown, we encounter to several numbers of the objectives in multi-objective problem. K is
the number of objective functions that can be min or max type, m is the number of constraints and
n is the number of decision variables. In multi-objective algorithms, there is not an optimal
solution that can optimize all of the objective functions simultaneously. So the concept of Pareto
optimized solution is provided. The Pareto optimal concept is explicable this way. ݔ∗ഥ = ሺݔଵ ...
,ݔଶ, ݔሻ is an optimal Pareto, if for each allowable xത and i={1,2,..k}, we have (for minimizing
problem is as (2)):
4. International Journal on Computational Science
In other words, *x is an optimal Pareto
one objective function in order to optimizing some of the objective functions.
4.Data Envelopment Analysis
DEA is a linear programming technique. Its main purpose is comparing and evaluating the
efficiency of a number of similar decision
power plants etc. that the amount of their consum
DEA shows the concept of evaluating the efficiency within a group
efficiency of each DMU is calculated according to other
The first model of DEA is CCR,
input, is the base of this method
outputs on total weighed of inputs instead of the ratio of an output on an input is used for
evaluating the efficiency in CCR
The CCR model
The CCR model is the first model of DEA and
providers (Charnes, Cooper, Rhodez) [4].
inputs and outputs of other decision m
evaluated. This basic model is suggested
∑=
m
i
ioi xVMin
1
jxvyu ij
k
r
m
i
irjr 0
1 1
=≤−∑ ∑= =
∑=
=
k
r
ror yuts
1
1..
00 ≥≥ ir vu
Where ru is the weight of output
reviewed DMU, ( {1,2,..., })o n∈
for DMUo. Also ijy is the amount of output
the number of outputs; m is the number of inputs and
ournal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
is an optimal Pareto solution when no other x exist that make at least
one objective function in order to optimizing some of the objective functions.
Data Envelopment Analysis
DEA is a linear programming technique. Its main purpose is comparing and evaluating the
efficiency of a number of similar decision making units like banks, hospitals, schools, refineries,
the amount of their consumed input and production output are different.
DEA shows the concept of evaluating the efficiency within a group of DMUs. In this method the
is calculated according to other DMUs that have the most operations.
first model of DEA is CCR, defining the efficiency according to the ratio of an output on an
input, is the base of this method [6]. In other words, calculating the ratio of total
inputs instead of the ratio of an output on an input is used for
in CCR model.
The CCR model is the first model of DEA and its named is the first letters of the names of its
(Charnes, Cooper, Rhodez) [4]. For determining the best efficient unit, the amounts of
inputs and outputs of other decision making units in finding the optimal weights for each unit
suggested as (3):
n,...,1=
output r, iv is the weight of input i and o is the index of
( {1,2,..., })o n . roy is the amount of output r and iox is the amount of input
the amount of output r and ijx is the amount of input i for the unit
is the number of inputs and n is the number of units.
& Applications (IJCSA) Vol.5, No.4, August 2015
54
(2)
exist that make at least
one objective function in order to optimizing some of the objective functions.
DEA is a linear programming technique. Its main purpose is comparing and evaluating the
like banks, hospitals, schools, refineries,
tion output are different.
. In this method the
that have the most operations.
defining the efficiency according to the ratio of an output on an
In other words, calculating the ratio of total weighed of
inputs instead of the ratio of an output on an input is used for
the first letters of the names of its
the amounts of
imal weights for each unit is
is the index of under
is the amount of input i
for the unit j. k is
(3)
5. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
55
5.The proposed hybrid algorithm
In this paper, it is tried to present a hybrid method in order to solve the multi-objective problems
using COA and DEA methods. This hybrid method finds the efficient points using DEA method
and gains the Pareto frontiers for multi-objective problems.
The steps of hybrid COA_DEA algorithm
1. In the first step of implementing the Cuckoo algorithm, the desired matrix will be formed
from habitats according to the initial population of cuckoos and the initial egg laying
radiuses.
2. The “profit function” of the Cuckoo algorithm will be replaced by the “efficiency value”.
This function take the habitat matrix as its input according to this matrix, the CCR model
will be produced for each habitats of the matrix and determines the efficiency for each
habitat.
3. The habitats will be sorted according to their efficiency values and other steps will be as
the explanations that are given in the references [13].
4. In each iteration, the habitats with the efficiency of one will be selected as good solutions
for transferring to next iteration.
5. At last iteration of the proposed algorithm, The Pareto frontiers for the main multi-
objective optimization problem will be drawn out based on the obtained values of f1 and
f2.
6.SOLVING TEST PROBLEMS
A number of test functions have been provided that can help to validate the proposed method in
Table 1.
Table 1. Test problems
Parameters setting for cuckoo algorithm are as follow:
6. International Journal on Computational Science
Number of initial population=5,
of eggs for each cuckoo=6, maximum iterations of the Cuckoo Algorithm
that we want to make=2, maximum number of cuckoos that can live at the same time
Test problem 1: [16]
Figure 1. Comparing the
COA_DEA method
ournal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
=5, minimum number of eggs for each cuckoo=2, maximum number
maximum iterations of the Cuckoo Algorithm=8, number of clusters
maximum number of cuckoos that can live at the same time
Figure 1. Comparing the proposed method with other methods
COA_DEA method
& Applications (IJCSA) Vol.5, No.4, August 2015
56
maximum number
number of clusters
maximum number of cuckoos that can live at the same time=50.
7. International Journal on Computational Science
Test problem 2: [14]
Figure2. Comparing the
Test problem 3: [15]
COA_DEA method
ournal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
. Comparing the proposed method with other methods
GDEA method Ranking method
& Applications (IJCSA) Vol.5, No.4, August 2015
57
Ranking method
8. International Journal on Computational Science
Figure 3.Comparing the
Test problem 4: [15]
Figure 4. Comparing the proposed method with other methods
7.Conclusion
In this paper, it is tried to solve multi
approach is a combination of the Cuckoo optimization algorithm and DEA method. As it shown
this method is one of the fastest, most accurate and most logical met
objective problems because it is a logical combination of both efficiency and finding the optimal
solutions. We conclude that the proposed method not only finds optimal answers and more
efficient points, but also it is faster in proce
ournal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
Comparing the proposed method with other methods
Figure 4. Comparing the proposed method with other methods
In this paper, it is tried to solve multi-objective problems with a new creative approach. This
approach is a combination of the Cuckoo optimization algorithm and DEA method. As it shown
this method is one of the fastest, most accurate and most logical method for solving multi
objective problems because it is a logical combination of both efficiency and finding the optimal
solutions. We conclude that the proposed method not only finds optimal answers and more
efficient points, but also it is faster in processing time than other algorithms. The obtained Pareto
& Applications (IJCSA) Vol.5, No.4, August 2015
58
objective problems with a new creative approach. This
approach is a combination of the Cuckoo optimization algorithm and DEA method. As it shown
hod for solving multi-
objective problems because it is a logical combination of both efficiency and finding the optimal
solutions. We conclude that the proposed method not only finds optimal answers and more
ssing time than other algorithms. The obtained Pareto
9. International Journal on Computational Science & Applications (IJCSA) Vol.5, No.4, August 2015
59
frontiers of this method were compared with the answers of similar algorithms like GA-DEA,
Ranking method, GA-GDEA, etc. The algorithm’s convergence rate in order to find the answer is
evident. So the suggested method is suitable and reliable method for solving multi-objective
optimization problems.
For further work, we can use another clustering method instead of current method for grouping
the cuckoos.
References
[1] Ehrgott, M., Gandibleux, X., Bound Sets for Biobjective Combinatorial Optimization Problems,
Computers & Operations Research, Vol. 34, Issue 9, pp. 2674-2694, 2007.
[2] Arakawa, M., Nakayama, H., Hagiwara, I., Yamakawa, H., Multiobjective Optimization using
adaptive range genetic algorithms with data envelopment analysis, Symposium on Multidisciplinary
Analysis and Optimization, 1998.
[3] Deb, K., Multi-Objective Optimization using Evolutionary Algorithms, John & Wiley Sons, Ltd.,
2001.
[4] Yun, Y.B., Nakayama, H., Tanino, T., Arakawa, M., Generation of efficient frontiers in multi-
objective optimization problems by generalized data envelopment analysis, European Journal of
Operational Research, Vol.129, No.3, pp.586-595, 2001.
[5] Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., A fast and elitist multiobjective genetic algorithm:
NSGA-II. IEEE Trans. Evol. Comput.6(2), 182–197, 2002.
[6] Kristina Vincova, Using DEA Models to Measure Efficiency, 2005.
[7] Reyes-Sierra, M., Coello Coello, C.A., Multiple objective particle swarm optimizers: A survey of the
state-of-art. International Journal of Computational Intelligence Research 2(3), 287–308, 2006.
[8] Cooper, W.W., Seiford, L.M., Tone, K., Data Envelopment Analysis: A Comprehensive Text with
Models, Applications, References and DEA Solver Software. Springer, New York, 2007.
[9] Pham, D.T., Ghanbarzadeh, A., multi-objective optimization using the bees algorithm. In: Third
international virtual conference on intelligent production machines and systems (IPROMS 2007):
Whittles, Dunbeath, Scotland, 2007.
[10] Nebro, A.J., Durillo, J.J., Garc´ıa-Nieto, J., Coello Coello, C.A., Luna, F., Alba, E., SMPSO: A new
PSO-based metaheuristic for multi-objective optimization. 2009 IEEE Symposium on Computational
Intelligence in Multicriteria Decision-Making, IEEE Press, New York, pp. 66-73, 2009.
[11] Yun, Y., Nakayama, H., Utilizing expected improvement and generalized data envelopment analysis
in multi-objective genetic algorithm, Journal of Global Optimization, Vol. 57, No. 2, pp. 367-384
2013.
[12] Yang, X.S. Deb, S., Multiobjective cuckoo search for design optimization, Computers & Operations
Research, 40, 1616-1624, 2013.
[13] Rajabioun, R., (2011), Cuckoo Optimization Algorithm, Applied Soft Computing, Vol 1, pp 5508-
5518, 2011.
[14] Yun, Y.B., Nakayama, H., Tanino, T., Arakawa, M., Generation of efficient frontiers in multi
objective optimization problems by generalized data envelopment analysis, European Journal of
Operational Research, 129, 586-595, 2001.
[15] Kalyanmoy Deb, Associate Member, IEEE, AmritPratap, Sameer Agarwal, and T. Meyarivan, A Fast
and Elitist Multiobjective Genetic Algorithm: NSGA-II , IEEE TRANSACTIONS ON
EVOLUTIONARY COMPUTATION, VOL. 6, NO. 2, 2002.
[16] Yun, Y., Nakayama, H., Arakdwa, M., Fitness Evaluation using Generalized Data Envelopment
Analysis in MOGA, Evolutionary Computation, 2004. CEC2004. Congress on, 464 – 471, 2004.