The document presents a new hybrid algorithm called Accelerated Bat Algorithm (ABATA) for solving integer programming problems. ABATA combines the Bat Algorithm with the Nelder-Mead local search method. The Bat Algorithm performs a wide exploration and deep exploitation during search, while Nelder-Mead refines solutions. ABATA invokes Nelder-Mead at each iteration to accelerate convergence compared to running more Bat Algorithm iterations alone. Experimental results show ABATA obtains optimal or near-optimal solutions for benchmark integer programming problems in reasonable time, making it a promising algorithm.
This document contains lecture notes on the design and analysis of algorithms. It covers topics like algorithm definition, complexity analysis, divide and conquer algorithms, greedy algorithms, dynamic programming, and NP-complete problems. The notes provide examples of algorithms like selection sort, towers of Hanoi, and generating permutations. Pseudocode is used to describe algorithms precisely yet readably.
The document discusses the characteristics of algorithms and the concept of mathematical expectation in average case analysis. It then provides the pseudocode for the MaxMin algorithm and discusses the greedy knapsack algorithm and the travelling salesman problem. Finally, it explains the sum of subsets problem, describing two formulations and how the solution space can be organized into trees.
COMPARING THE CUCKOO ALGORITHM WITH OTHER ALGORITHMS FOR ESTIMATING TWO GLSD ...csandit
This study introduces and compares different methods for estimating the two parameters of
generalized logarithmic series distribution. These methods are the cuckoo search optimization,
maximum likelihood estimation, and method of moments algorithms. All the required
derivations and basic steps of each algorithm are explained. The applications for these
algorithms are implemented through simulations using different sample sizes (n = 15, 25, 50,
100). Results are compared using the statistical measure mean square error.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
This study introduces and compares different methods for estimating the two parameters of generalized logarithmic series distribution. These methods are the cuckoo search optimization, maximum likelihood estimation, and method of moments algorithms. All the required derivations and basic steps of each algorithm are explained. The applications for these algorithms are implemented through simulations using different sample sizes (n = 15, 25, 50, 100). Results are compared using the statistical measure mean square error.
USING CUCKOO ALGORITHM FOR ESTIMATING TWO GLSD PARAMETERS AND COMPARING IT WI...ijcsit
This study introduces and compares different methods for estimating the two parameters of generalized logarithmic series distribution. These methods are the cuckoo search optimization, maximum likelihood estimation, and method of moments algorithms. All the required derivations and basic steps of each algorithm are explained. The applications for these algorithms are implemented through simulations using different sample sizes (n = 15, 25, 50, 100). Results are compared using the statistical measure mean square error.
This document compares different estimation methods for parameters of the generalized logarithmic series distribution (GLSD), including cuckoo search optimization (CSO), maximum likelihood estimation (MLE), and method of moments (MOM). The CSO algorithm is introduced and applied to estimate the two GLSD parameters. Simulation results using different sample sizes show that CSO performs best for small sample sizes while MLE is best for large sample sizes, based on mean square error. The document concludes that CSO is the best estimator for small sample sizes.
Here is the first set of notes for the first class in Analysis of Algorithm. I added a dedicatory for my dear Fabi... she has showed me what real idealism is....
This document contains lecture notes on the design and analysis of algorithms. It covers topics like algorithm definition, complexity analysis, divide and conquer algorithms, greedy algorithms, dynamic programming, and NP-complete problems. The notes provide examples of algorithms like selection sort, towers of Hanoi, and generating permutations. Pseudocode is used to describe algorithms precisely yet readably.
The document discusses the characteristics of algorithms and the concept of mathematical expectation in average case analysis. It then provides the pseudocode for the MaxMin algorithm and discusses the greedy knapsack algorithm and the travelling salesman problem. Finally, it explains the sum of subsets problem, describing two formulations and how the solution space can be organized into trees.
COMPARING THE CUCKOO ALGORITHM WITH OTHER ALGORITHMS FOR ESTIMATING TWO GLSD ...csandit
This study introduces and compares different methods for estimating the two parameters of
generalized logarithmic series distribution. These methods are the cuckoo search optimization,
maximum likelihood estimation, and method of moments algorithms. All the required
derivations and basic steps of each algorithm are explained. The applications for these
algorithms are implemented through simulations using different sample sizes (n = 15, 25, 50,
100). Results are compared using the statistical measure mean square error.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
This study introduces and compares different methods for estimating the two parameters of generalized logarithmic series distribution. These methods are the cuckoo search optimization, maximum likelihood estimation, and method of moments algorithms. All the required derivations and basic steps of each algorithm are explained. The applications for these algorithms are implemented through simulations using different sample sizes (n = 15, 25, 50, 100). Results are compared using the statistical measure mean square error.
USING CUCKOO ALGORITHM FOR ESTIMATING TWO GLSD PARAMETERS AND COMPARING IT WI...ijcsit
This study introduces and compares different methods for estimating the two parameters of generalized logarithmic series distribution. These methods are the cuckoo search optimization, maximum likelihood estimation, and method of moments algorithms. All the required derivations and basic steps of each algorithm are explained. The applications for these algorithms are implemented through simulations using different sample sizes (n = 15, 25, 50, 100). Results are compared using the statistical measure mean square error.
This document compares different estimation methods for parameters of the generalized logarithmic series distribution (GLSD), including cuckoo search optimization (CSO), maximum likelihood estimation (MLE), and method of moments (MOM). The CSO algorithm is introduced and applied to estimate the two GLSD parameters. Simulation results using different sample sizes show that CSO performs best for small sample sizes while MLE is best for large sample sizes, based on mean square error. The document concludes that CSO is the best estimator for small sample sizes.
Here is the first set of notes for the first class in Analysis of Algorithm. I added a dedicatory for my dear Fabi... she has showed me what real idealism is....
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood zone is generated, random number of partitions are selected and variables updating process is starting in order to generate a trail neighbor solutions. This process helps the SNMRVU algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to improve the best solution found so far and accelerates the convergence in the final stage. The performance of the SNMRVU algorithm is evaluated using 27 scalable benchmark functions and compared with four algorithms. The results show that the SNMRVU algorithm is promising and produces high quality solutions with low computational costs.
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.
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.
This document discusses algorithms for finding minimum and maximum elements in an array, including simultaneous minimum and maximum algorithms. It introduces dynamic programming as a technique for improving inefficient divide-and-conquer algorithms by storing results of subproblems to avoid recomputing them. Examples of dynamic programming include calculating the Fibonacci sequence and solving an assembly line scheduling problem to minimize total time.
This document provides definitions and explanations of key concepts in algorithm design and analysis including:
- Performance measurement is concerned with obtaining the space and time requirements of algorithms.
- An algorithm is a finite set of instructions that accomplishes a task given certain inputs and criteria.
- Time complexity refers to the amount of computer time needed for an algorithm to complete, while space complexity refers to the memory required.
- Common asymptotic notations like Big-O, Omega, and Theta are used to describe an algorithm's scalability.
- Divide-and-conquer and greedy algorithms are important design techniques that break problems into subproblems.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document provides an overview of learning Bayes networks from data. It discusses learning the structure and conditional probability tables (CPTs) of a Bayes network given training data. When the network structure is known, the CPTs can be directly estimated from sample statistics in the training data, handling both cases of complete and missing data using techniques like expectation-maximization. When the structure is unknown, scoring metrics like minimum description length are used to search the space of possible structures to find the best fitting network. Dynamic decision networks extend this framework to model sequential decision making problems.
Divide and conquer is an algorithm design paradigm where a problem is broken into smaller subproblems, those subproblems are solved independently, and then their results are combined to solve the original problem. Some examples of algorithms that use this approach are merge sort, quicksort, and matrix multiplication algorithms like Strassen's algorithm. The greedy method works in stages, making locally optimal choices at each step in the hope of finding a global optimum. It is used for problems like job sequencing with deadlines and the knapsack problem. Minimum cost spanning trees find subgraphs of connected graphs that include all vertices using a minimum number of edges.
This document provides an introduction to algorithms and their design and analysis. It discusses what algorithms are, their key characteristics, and the steps to develop an algorithm to solve a problem. These steps include defining the problem, developing a model, specifying and designing the algorithm, checking correctness, analyzing efficiency, implementing, testing, and documenting. Common algorithm design techniques like top-down design and recursion are explained. Factors that impact algorithm efficiency like use of loops, initial conditions, invariants, and termination conditions are covered. Finally, common control structures for algorithms like if/else, loops, and branching are defined.
An evolutionary method for constructing complex SVM kernelsinfopapers
D. Simian, F. Stoica, An Evolutionary Method for Constructing Complex SVM Kernels, Recent Advances in Mathematics and Computers in Biology and Chemistry, Proceedings of the 10th International Conference on Mathematics and Computers in Biology and Chemistry, MCBC’09, Prague, Chech Republic, WSEAS Press, ISBN 978-960-474-062-8, ISSN 1790-5125, pp.172-178, 2009
The document discusses divide and conquer algorithms. It explains that divide and conquer algorithms work by dividing problems into smaller subproblems, solving the subproblems independently, and then combining the solutions to solve the original problem. An example of finding the minimum and maximum elements in an array using divide and conquer is provided, with pseudocode. Advantages of divide and conquer algorithms include solving difficult problems and often finding efficient solutions.
Multi objective predictive control a solution using metaheuristicsijcsit
The application of multi objective model predictive control approaches is significantly limited with
computation time associated with optimization algorithms. Metaheuristics are general purpose heuristics
that have been successfully used in solving difficult optimization problems in a reasonable computation
time. In this work , we use and compare two multi objective metaheuristics, Multi-Objective Particle
swarm Optimization, MOPSO, and Multi-Objective Gravitational Search Algorithm, MOGSA, to generate
a set of approximately Pareto-optimal solutions in a single run. Two examples are studied, a nonlinear
system consisting of two mobile robots tracking trajectories and avoiding obstacles and a linear multi
variable system. The computation times and the quality of the solution in terms of the smoothness of the
control signals and precision of tracking show that MOPSO can be an alternative for real time
applications.
The document describes a novel mixed method for order reduction of discrete linear systems. The method uses particle swarm optimization (PSO) to determine the denominator polynomials of the reduced order model. It then uses a polynomial technique to derive the numerator coefficients by equating the original and reduced order transfer functions. This leads to a set of equations that can be solved for the numerator coefficients. The proposed method is illustrated on an 8th order example system from literature. It is found to provide a stable 2nd order reduced model. A lead compensator is then designed and connected to improve the steady state response of the original and reduced order systems.
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.
Backtracking based integer factorisation, primality testing and square root c...csandit
Breaking a big integer into two factors is a famous problem in the field of Mathematics and
Cryptography for years. Many crypto-systems use such a big number as their key or part of a
key with the assumption - it is too big that the fastest factorisation algorithms running on the
fastest computers would take impractically long period of time to factorise. Hence, many efforts
have been provided to break those crypto-systems by finding two factors of an integer for
decades. In this paper, a new factorisation technique is proposed which is based on the concept
of backtracking. Binary bit by bit operations are performed to find two factors of a given
integer. This proposed solution can be applied in computing square root, primality test, finding
prime factors of integer numbers etc. If the proposed solution is proven to be efficient enough, it
may break the security of many crypto-systems. Implementation and performance comparison of
the technique is kept for future research.
The document compares different heuristic algorithms for solving the traveling salesman problem (TSP), including greedy, 2-opt, 3-opt, genetic algorithm, simulated annealing, and neural networks. It implemented these algorithms and evaluated their computational efficiency on TSP problems of varying sizes (2-10,000 nodes). For small TSP problems (n<=50 nodes), the greedy 2-opt algorithm performed well with a high solution quality and short computation time. The neural network approach showed the best efficiency across all problem sizes. The algorithms were also improved using non-crossing methods, which always resulted in better solutions.
PPT - AutoML-Zero: Evolving Machine Learning Algorithms From ScratchJisang Yoon
1) AutoML-Zero is a framework that uses an evolutionary algorithm to evolve machine learning algorithms from basic mathematical operations, with minimal human constraints on the search space.
2) Experiments showed AutoML-Zero could find simple neural networks like linear and nonlinear regression models in difficult search spaces, outperforming random search.
3) When applied to image classification tasks on MNIST and CIFAR-10, the discovered algorithms achieved performance on par or better than standard models like logistic regression and multilayer perceptrons, trained with minimal human input.
A MODIFIED VORTEX SEARCH ALGORITHM FOR NUMERICAL FUNCTION OPTIMIZATIONijaia
This document presents a modified version of the Vortex Search (VS) algorithm called the Modified Vortex Search (MVS) algorithm for numerical function optimization. The VS algorithm has the drawback that it can get trapped in local minima for functions with multiple local minima. The MVS algorithm addresses this by generating candidate solutions around multiple points at each iteration rather than a single point, allowing it to escape local minima more easily. Computational results on benchmark functions showed the MVS algorithm outperformed the original VS algorithm, as well as PSO2011 and ABC algorithms.
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...Stephen Faucher
This document compares iterative methods for solving nonlinear systems of equations, including Gauss-Seidel method. It describes Bisection method, Newton-Raphson method, Secant method, and False Position method. Bisection method converges linearly but is simple. Newton-Raphson converges faster if the initial guess is close to the root but may diverge otherwise. Secant method does not require derivatives but can fail if the function is flat. False Position combines features of Bisection and Secant methods. The document analyzes the algorithms and convergence properties of each method.
The document discusses stacks and queues as linear data structures. A stack follows LIFO (last in first out) where the last element inserted is the first removed. Common stack operations are push to insert and pop to remove elements. Stacks can be implemented using arrays or linked lists. A queue follows FIFO (first in first out) where the first element inserted is the first removed. Common queue operations are enqueue to insert and dequeue to remove elements. Queues can also be implemented using arrays or linked lists. Circular queues and priority queues are also introduced.
This document provides instructions for requesting assignment writing help from the website HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete an order form with instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Receive the paper and authorize payment if satisfied. 5) Request revisions until fully satisfied, with the option of a full refund for plagiarized work. The purpose is to outline the process for students to get help writing assignments through the website.
5 Tips For Writing A Good History Paper Complete DTye Rausch
Here are the key contractual implications Daily Grind Ltd should consider regarding discontinuing commission payments to Fixit Ltd:
- Daily Grind Ltd has a valid contract with Fixit Ltd stipulating a 6.5% commission on Moondollar product sales in New Zealand. Unilaterally discontinuing payments would likely constitute a breach of contract.
- Fixit Ltd could sue Daily Grind Ltd for damages from lost commission payments. They would need to prove the contract's validity and that Daily Grind Ltd's actions breached the terms.
- Daily Grind Ltd's restructuring is generally not considered grounds to invalidate the contract. For the contract to be terminated, both parties would need to agree or there would need to be
More Related Content
Similar to Accelerated Bat Algorithm For Solving Integer Programming Problems
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood zone is generated, random number of partitions are selected and variables updating process is starting in order to generate a trail neighbor solutions. This process helps the SNMRVU algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to improve the best solution found so far and accelerates the convergence in the final stage. The performance of the SNMRVU algorithm is evaluated using 27 scalable benchmark functions and compared with four algorithms. The results show that the SNMRVU algorithm is promising and produces high quality solutions with low computational costs.
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.
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.
This document discusses algorithms for finding minimum and maximum elements in an array, including simultaneous minimum and maximum algorithms. It introduces dynamic programming as a technique for improving inefficient divide-and-conquer algorithms by storing results of subproblems to avoid recomputing them. Examples of dynamic programming include calculating the Fibonacci sequence and solving an assembly line scheduling problem to minimize total time.
This document provides definitions and explanations of key concepts in algorithm design and analysis including:
- Performance measurement is concerned with obtaining the space and time requirements of algorithms.
- An algorithm is a finite set of instructions that accomplishes a task given certain inputs and criteria.
- Time complexity refers to the amount of computer time needed for an algorithm to complete, while space complexity refers to the memory required.
- Common asymptotic notations like Big-O, Omega, and Theta are used to describe an algorithm's scalability.
- Divide-and-conquer and greedy algorithms are important design techniques that break problems into subproblems.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
The document provides an overview of learning Bayes networks from data. It discusses learning the structure and conditional probability tables (CPTs) of a Bayes network given training data. When the network structure is known, the CPTs can be directly estimated from sample statistics in the training data, handling both cases of complete and missing data using techniques like expectation-maximization. When the structure is unknown, scoring metrics like minimum description length are used to search the space of possible structures to find the best fitting network. Dynamic decision networks extend this framework to model sequential decision making problems.
Divide and conquer is an algorithm design paradigm where a problem is broken into smaller subproblems, those subproblems are solved independently, and then their results are combined to solve the original problem. Some examples of algorithms that use this approach are merge sort, quicksort, and matrix multiplication algorithms like Strassen's algorithm. The greedy method works in stages, making locally optimal choices at each step in the hope of finding a global optimum. It is used for problems like job sequencing with deadlines and the knapsack problem. Minimum cost spanning trees find subgraphs of connected graphs that include all vertices using a minimum number of edges.
This document provides an introduction to algorithms and their design and analysis. It discusses what algorithms are, their key characteristics, and the steps to develop an algorithm to solve a problem. These steps include defining the problem, developing a model, specifying and designing the algorithm, checking correctness, analyzing efficiency, implementing, testing, and documenting. Common algorithm design techniques like top-down design and recursion are explained. Factors that impact algorithm efficiency like use of loops, initial conditions, invariants, and termination conditions are covered. Finally, common control structures for algorithms like if/else, loops, and branching are defined.
An evolutionary method for constructing complex SVM kernelsinfopapers
D. Simian, F. Stoica, An Evolutionary Method for Constructing Complex SVM Kernels, Recent Advances in Mathematics and Computers in Biology and Chemistry, Proceedings of the 10th International Conference on Mathematics and Computers in Biology and Chemistry, MCBC’09, Prague, Chech Republic, WSEAS Press, ISBN 978-960-474-062-8, ISSN 1790-5125, pp.172-178, 2009
The document discusses divide and conquer algorithms. It explains that divide and conquer algorithms work by dividing problems into smaller subproblems, solving the subproblems independently, and then combining the solutions to solve the original problem. An example of finding the minimum and maximum elements in an array using divide and conquer is provided, with pseudocode. Advantages of divide and conquer algorithms include solving difficult problems and often finding efficient solutions.
Multi objective predictive control a solution using metaheuristicsijcsit
The application of multi objective model predictive control approaches is significantly limited with
computation time associated with optimization algorithms. Metaheuristics are general purpose heuristics
that have been successfully used in solving difficult optimization problems in a reasonable computation
time. In this work , we use and compare two multi objective metaheuristics, Multi-Objective Particle
swarm Optimization, MOPSO, and Multi-Objective Gravitational Search Algorithm, MOGSA, to generate
a set of approximately Pareto-optimal solutions in a single run. Two examples are studied, a nonlinear
system consisting of two mobile robots tracking trajectories and avoiding obstacles and a linear multi
variable system. The computation times and the quality of the solution in terms of the smoothness of the
control signals and precision of tracking show that MOPSO can be an alternative for real time
applications.
The document describes a novel mixed method for order reduction of discrete linear systems. The method uses particle swarm optimization (PSO) to determine the denominator polynomials of the reduced order model. It then uses a polynomial technique to derive the numerator coefficients by equating the original and reduced order transfer functions. This leads to a set of equations that can be solved for the numerator coefficients. The proposed method is illustrated on an 8th order example system from literature. It is found to provide a stable 2nd order reduced model. A lead compensator is then designed and connected to improve the steady state response of the original and reduced order systems.
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.
Backtracking based integer factorisation, primality testing and square root c...csandit
Breaking a big integer into two factors is a famous problem in the field of Mathematics and
Cryptography for years. Many crypto-systems use such a big number as their key or part of a
key with the assumption - it is too big that the fastest factorisation algorithms running on the
fastest computers would take impractically long period of time to factorise. Hence, many efforts
have been provided to break those crypto-systems by finding two factors of an integer for
decades. In this paper, a new factorisation technique is proposed which is based on the concept
of backtracking. Binary bit by bit operations are performed to find two factors of a given
integer. This proposed solution can be applied in computing square root, primality test, finding
prime factors of integer numbers etc. If the proposed solution is proven to be efficient enough, it
may break the security of many crypto-systems. Implementation and performance comparison of
the technique is kept for future research.
The document compares different heuristic algorithms for solving the traveling salesman problem (TSP), including greedy, 2-opt, 3-opt, genetic algorithm, simulated annealing, and neural networks. It implemented these algorithms and evaluated their computational efficiency on TSP problems of varying sizes (2-10,000 nodes). For small TSP problems (n<=50 nodes), the greedy 2-opt algorithm performed well with a high solution quality and short computation time. The neural network approach showed the best efficiency across all problem sizes. The algorithms were also improved using non-crossing methods, which always resulted in better solutions.
PPT - AutoML-Zero: Evolving Machine Learning Algorithms From ScratchJisang Yoon
1) AutoML-Zero is a framework that uses an evolutionary algorithm to evolve machine learning algorithms from basic mathematical operations, with minimal human constraints on the search space.
2) Experiments showed AutoML-Zero could find simple neural networks like linear and nonlinear regression models in difficult search spaces, outperforming random search.
3) When applied to image classification tasks on MNIST and CIFAR-10, the discovered algorithms achieved performance on par or better than standard models like logistic regression and multilayer perceptrons, trained with minimal human input.
A MODIFIED VORTEX SEARCH ALGORITHM FOR NUMERICAL FUNCTION OPTIMIZATIONijaia
This document presents a modified version of the Vortex Search (VS) algorithm called the Modified Vortex Search (MVS) algorithm for numerical function optimization. The VS algorithm has the drawback that it can get trapped in local minima for functions with multiple local minima. The MVS algorithm addresses this by generating candidate solutions around multiple points at each iteration rather than a single point, allowing it to escape local minima more easily. Computational results on benchmark functions showed the MVS algorithm outperformed the original VS algorithm, as well as PSO2011 and ABC algorithms.
A Comparison Of Iterative Methods For The Solution Of Non-Linear Systems Of E...Stephen Faucher
This document compares iterative methods for solving nonlinear systems of equations, including Gauss-Seidel method. It describes Bisection method, Newton-Raphson method, Secant method, and False Position method. Bisection method converges linearly but is simple. Newton-Raphson converges faster if the initial guess is close to the root but may diverge otherwise. Secant method does not require derivatives but can fail if the function is flat. False Position combines features of Bisection and Secant methods. The document analyzes the algorithms and convergence properties of each method.
The document discusses stacks and queues as linear data structures. A stack follows LIFO (last in first out) where the last element inserted is the first removed. Common stack operations are push to insert and pop to remove elements. Stacks can be implemented using arrays or linked lists. A queue follows FIFO (first in first out) where the first element inserted is the first removed. Common queue operations are enqueue to insert and dequeue to remove elements. Queues can also be implemented using arrays or linked lists. Circular queues and priority queues are also introduced.
Similar to Accelerated Bat Algorithm For Solving Integer Programming Problems (20)
This document provides instructions for requesting assignment writing help from the website HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete an order form with instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Receive the paper and authorize payment if satisfied. 5) Request revisions until fully satisfied, with the option of a full refund for plagiarized work. The purpose is to outline the process for students to get help writing assignments through the website.
5 Tips For Writing A Good History Paper Complete DTye Rausch
Here are the key contractual implications Daily Grind Ltd should consider regarding discontinuing commission payments to Fixit Ltd:
- Daily Grind Ltd has a valid contract with Fixit Ltd stipulating a 6.5% commission on Moondollar product sales in New Zealand. Unilaterally discontinuing payments would likely constitute a breach of contract.
- Fixit Ltd could sue Daily Grind Ltd for damages from lost commission payments. They would need to prove the contract's validity and that Daily Grind Ltd's actions breached the terms.
- Daily Grind Ltd's restructuring is generally not considered grounds to invalidate the contract. For the contract to be terminated, both parties would need to agree or there would need to be
Mr. Abraham Lincoln should be on the postage stamp because of his accomplishments. Lincoln was born in a log cabin in Kentucky and had to work manual labor jobs from a young age. He became known for his honesty, kindness, and intelligence. Lincoln rose to become president during the Civil War and helped abolish slavery with the Emancipation Proclamation.
Child Labour Essay For School Students In English Essay On Child LabourTye Rausch
The document provides instructions for creating an account on HelpWriting.net to request paper writing help. It outlines a 5-step process: 1) Create an account with password and email. 2) Complete an order form with instructions, sources, and deadline. 3) Review writer bids and choose one based on qualifications. 4) Review the paper and authorize payment if pleased. 5) Request revisions until satisfied.
Grinch Day Writing.Pdf Christmas Kindergarten, WTye Rausch
The document discusses the impact of the New Deal programs implemented by President Roosevelt during the Great Depression. It describes how the economy collapsed in 1929 and unemployment rose to around 18 million by 1933. The New Deal introduced several public works programs and reforms through agencies like the FERA to provide work relief and restore dignity to unemployed Americans. While criticized at first, the New Deal is now seen as helping stimulate the economy and end the Depression by getting people back to work through federal initiatives.
Scarecrow Craft And Writing Bulletin Board Writing CraTye Rausch
The book follows eight girls at a high school who are impacted by "the list", an annual tradition where students are ranked as the prettiest or ugliest in each grade. The story is told from the perspective of each girl, showing how they each deal with being labeled based on their appearance. While some embrace their label, others refuse to let it define them. The character of Bridget Honeycutt, who starves herself in an attempt to change her label, is particularly compelling. Seeing issues of body image and peer pressure through each girl's eyes provides deeper understanding of their diverse experiences.
PPT - Three Stages Of Writing PowerPoint Presentation, Free DowTye Rausch
The document discusses the process for requesting an assignment to be written through the website HelpWriting.net. It outlines the 5 steps: 1) Create an account with email and password. 2) Complete an order form providing instructions, sources, and deadline. 3) Review bids from writers and choose one. 4) Receive the paper and authorize payment if pleased. 5) Request revisions until satisfied, with a refund option for plagiarism. The document promotes HelpWriting.net by noting their promise to meet customer needs with original, high-quality content.
Hi-Write Paper Highlighted Yellow Lines Writing PaperTye Rausch
The document discusses how ravens have developed a foraging strategy involving wolves. Studies have shown that ravens benefit from kleptoparasitism by obtaining prey from wolves with reduced risk and search time. Ravens have become highly skilled at scavenging and rely on wolf predation, especially in winter. A controlled experiment introduced a board to observe how ravens adapted their foraging behavior based on food size available on or near the board.
How To Write A Science Fair Introduction - YouTubeTye Rausch
Rural Americans struggle to access healthcare due to distance, as a study found distance was the most important reason for lack of access to both routine and specialty care services. The study suggested improved transportation options could help rural Americans better access healthcare. Demographically, the study focused on populations living in rural areas over long distances from healthcare facilities.
The COMESA aims to achieve sustainable growth and development among member states through regional integration and cooperation. Its key objectives include promoting balanced development, raising living standards, fostering economic activity in all sectors, and establishing macroeconomic policies and programs. COMESA recognizes that peace, security and stability are essential preconditions for investment, trade and economic integration. It seeks to address weaknesses in member states by pooling resources to support their development efforts individually and collectively.
Gingerbread Man Maps Writing Center, GingerbreaTye Rausch
The document discusses the benefits of chickenpox vaccination. It notes that vaccination has considerably reduced deaths and medical costs from chickenpox since the vaccine was introduced in 1995. Cases of chickenpox have steadily declined, with hospitalizations dropping 93% between 1994-2012 and outpatient visits also declining after the two-dose vaccination period from 2006-2012. The widespread use of the chickenpox vaccine has helped reduce the spread of this highly contagious disease.
Easy Short English Paragraph On Politics WriTye Rausch
The document provides instructions for requesting writing assistance from HelpWriting.net. It outlines a 5-step process: 1) Create an account with a password and email. 2) Complete a 10-minute order form providing instructions, sources, and deadline. 3) Review bids from writers and select one. 4) Review the completed paper and authorize payment. 5) Request revisions to ensure satisfaction, with a refund option for plagiarized work. The process aims to match clients with qualified writers to fully meet writing needs.
How To Write A Critical Essay - Tips ExamplesTye Rausch
The document provides steps for requesting writing assistance from HelpWriting.net, including creating an account, completing an order form with instructions and deadline, reviewing writer bids and qualifications then placing a deposit, and authorizing final payment after reviewing and revising the completed paper as needed. The service offers original, plagiarism-free papers and refunds if plagiarized work is provided.
How To Write An Essay Transitions (With Worksheet) - YouTube Essay ...Tye Rausch
The document discusses reasons for individual travel and suggests they should be investigated further. It notes that tourism is a major global industry, but understanding travel motivations can help improve tourism planning and management. Individual travel is complex with many potential factors influencing decisions. Push factors like stress relief or escape from daily routine compel people to travel, while pull factors like attractions, activities or culture in destinations draw visitors. Properly examining psychological, socio-cultural and economic reasons for travel on an individual level could provide valuable insights for the tourism industry. Understanding diverse motivations may help create more appealing destination marketing, tailor experiences better to traveler needs and wants
Reading Essay Example. Reading And Writing EssayTye Rausch
The document provides instructions for creating an account, submitting a paper request, and receiving writing help on the HelpWriting.net site. It outlines a 5-step process: 1) Create an account with an email and password. 2) Complete a form with paper details, sources, and deadline. 3) Review bids from writers and choose one. 4) Review the completed paper and authorize payment. 5) Request revisions until satisfied, with the option of a full refund for plagiarized work. The summary focuses on the key steps involved in obtaining writing assistance through the site.
Strategies For Improving Handwriting - Make TakeTye Rausch
The document provides instructions for creating an account on HelpWriting.net to request writing assistance, including completing an order form with instructions and sources, and reviewing bids from writers to select one and provide a deposit to start the assignment. The process also allows for free revisions to ensure customer satisfaction, and HelpWriting.net promises original, high-quality content with refunds offered for plagiarized work.
Pay For Essay And Get The Best Paper You Need - How To Write For Free ...Tye Rausch
I apologize, upon reviewing the document I do not feel comfortable generating a summary as it contains copyrighted content from other sources without proper attribution.
A Literature Review Of Lesson Study In Initial Teacher EducationTye Rausch
This literature review examined how learning and observation are discussed in studies of Lesson Study (LS) in initial teacher education (ITE). Independent searches by teams in Norway and England identified 68 relevant peer-reviewed journal articles. The review found a lack of clarity around definitions of learning and how it should be observed in LS. There was also wide variation in the focus of classroom observations in ITE LS studies. The review suggests researchers should more explicitly define learning and observation methods to strengthen LS research in ITE.
An Investigation Of The Effects Of Citation Instruction To Avoid Plagiarism I...Tye Rausch
This document summarizes research on plagiarism in academic writing by English language learners. It discusses factors that may contribute to plagiarism among developing writers, such as differences in cultural understandings of text ownership, language proficiency, and lack of instruction in skills like summarization and paraphrasing sources. The document reviews studies investigating students' and instructors' perceptions of plagiarism. It also examines citation instruction as an approach for addressing plagiarism, noting that citing sources properly requires understanding their various functions in an argument. The study described in this document aims to measure the effects of citation skills instruction on postgraduate and graduate students' use of sources in academic writing assignments.
This document provides information about an academic writing course. The course aims to help participants become better academic writers through discussing writing principles and practicing writing techniques. It will cover recognizing good writing, becoming more productive writers, self-evaluation, peer feedback, and writing reviews. Assessment includes class participation, a group presentation analyzing example papers, submitting a revised introduction and reflection essay, and individually reviewing a book on academic writing. The schedule outlines weekly readings and writing assignments to help participants develop their skills in literature reviews, peer reviews, structure, clarity and other aspects of academic writing.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
How to Setup Default Value for a Field in Odoo 17Celine George
In Odoo, we can set a default value for a field during the creation of a record for a model. We have many methods in odoo for setting a default value to the field.
Temple of Asclepius in Thrace. Excavation resultsKrassimira Luka
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
Information and Communication Technology in EducationMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 2)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐈𝐂𝐓 𝐢𝐧 𝐞𝐝𝐮𝐜𝐚𝐭𝐢𝐨𝐧:
Students will be able to explain the role and impact of Information and Communication Technology (ICT) in education. They will understand how ICT tools, such as computers, the internet, and educational software, enhance learning and teaching processes. By exploring various ICT applications, students will recognize how these technologies facilitate access to information, improve communication, support collaboration, and enable personalized learning experiences.
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐫𝐞𝐥𝐢𝐚𝐛𝐥𝐞 𝐬𝐨𝐮𝐫𝐜𝐞𝐬 𝐨𝐧 𝐭𝐡𝐞 𝐢𝐧𝐭𝐞𝐫𝐧𝐞𝐭:
-Students will be able to discuss what constitutes reliable sources on the internet. They will learn to identify key characteristics of trustworthy information, such as credibility, accuracy, and authority. By examining different types of online sources, students will develop skills to evaluate the reliability of websites and content, ensuring they can distinguish between reputable information and misinformation.
How to Download & Install Module From the Odoo App Store in Odoo 17Celine George
Custom modules offer the flexibility to extend Odoo's capabilities, address unique requirements, and optimize workflows to align seamlessly with your organization's processes. By leveraging custom modules, businesses can unlock greater efficiency, productivity, and innovation, empowering them to stay competitive in today's dynamic market landscape. In this tutorial, we'll guide you step by step on how to easily download and install modules from the Odoo App Store.
Accelerated Bat Algorithm For Solving Integer Programming Problems
1. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-25-
Accelerated Bat Algorithm for Solving Integer Programming Problems
Ahmed Fouad Ali
Computer Science Department, Faculty of Computers and Information
Suez Canal University, Ismailia, Egypt.
ahmed fouad@ci.suez.edu.eg
Abstract
In this paper, we present a new hybrid algorithm for solving integer-programming
problems. The proposed algorithm is called accelerated bat algorithm (ABATA). In ABATA,
we try to accelerate the search process by invoking the Nelder-Mead method as a local search
method in order to refine the best obtained solution at each iteration. The bat algorithm has a
good ability to perform a wide exploration and a deep exploitation search, while the Nelder-
Mead method has a powerful performance as a local search method and can enhance the
exploitation ability of the proposed algorithm. The general performance of ABATA is tested
on seven integer-programming problems and compared against four benchmark algorithms.
The experimental results indicate that ABATA is a promising algorithm and can obtain a
global optimal solution or near optimal solution in reasonable time.
Keyboard: Bat algorithm, Nelder-Mead method, Integer programming problems,
Optimization problems.
1. Introduction
In the past two decades, many meta-heuristic algorithms have been applied to solve
global optimization problems, these algorithms are inspired from the behavior of a group of
social organisms. They are called nature inspired algorithms or swarm intelligence (SI)
algorithms, such as Ant Colony Optimization (ACO) [4], Artificial Bee Colony (ABC) [10],
Particle Swarm Optimization (PSO) [11], Bacterial foraging [19], Bat Algorithm (BA) [30],
Bee Colony Optimization (BCO) [24], Wolf search [23], Cat swarm [3], Cuckoo search [29],
Firefly algorithm (FA) [28], [29], Fish swarm/school [14], etc. SI algorithms have been
widely used to solve unconstrained and constrained problems and their applications. However
they have been applied in a few works to solve integer-programming problems, although the
variety of many real life applications for this problem such as warehouse location problem,
VLSI (very large scale integration) circuits design problems, robot path planning problems,
scheduling problem, game theory, engineering design problems, [5], [6], [17], [31].
Bat algorithm (BA) is a promising nature inspired algorithm inspired from the
echolocation behavior of the microbats [30]. BA has a good capability to balance the global
exploration and the local exploitation during the search process. In this work, we propose a
new hybrid bat algorithm and Nelder-Mead method by combining the bat algorithm with its
powerful capability of performing a wide exploration and a deep exploitation and the Nelder-
Mead method as a local search method to refine the best-obtained solution at each iteration.
The proposed algorithm is called accelerated bat algorithm (ABATA). Invoking the Nelder-
2. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-26-
Mead method in the proposed algorithm can accelerate the convergence instead of running the
algorithm more iteration without any improvement in the results.
Branch and Bound (BB) is one of the most famous exact integer programming
algorithm [1], [13], [15], however it suffer from high complexity, since they explore a
hundred of nodes in a big tree structure when solving a large scale problems. Recently, there
are some efforts to apply some of swarm intelligence algorithms to solve integer
programming problems such as ant colony algorithm [8], [9], artificial bee colony algorithm
[2], [25], particle swarm optimization algorithm [12], [18], [20], cuckoo search algorithm [26]
and firefly algorithm [27].
The main objective of this paper is to produce a new hybrid SI algorithm by combining
the bat algorithm with the Nelder-Mead method in order to solve integer-programming
problems [7]. In the proposed algorithm, we try to overcome the main problem of applying
other SI algorithm, which is consuming expensive computation time.
Moreover, the general performance of the proposed ABATA is tested on well-known
benchmark functions and has been compared against different algorithms. The experimental
results indicate that ABATA is a promising algorithm and outperforms the other algorithms.
The rest of this paper is organized as follow. In Section 2, we present an overview on the
related work for the proposed algorithm. Section 3 describes the proposed ABATA. Section
4 discusses the general performance of the proposed algorithm and reports the comparative
experimental results on the benchmark functions. Finally, the conclusion makes up Section 5.
2. Related Work
In this section, we present an overview on the related work for the proposed algorithm
and we highlight the definition of the integer-programming problem and the Nelder-Mead
method with the main structure of its algorithm as follow.
2.1 The Definition of the Integer Programming Problem
An integer-programming problem is a mathematical optimization problem in which all
of the variables are restricted to be integers. The unconstrained integer-programming problem
can be defined as follow.
� � � , � ∈ � ⊆ ℤ , (1)
Where ℤ is the set of integer variables, S is a not necessarily bounded set.
2.2 Nelder-Mead Method
In 1965, Nelder and Mead proposed the Nelder-Mead method (NM) [16], which is one
of the most popular derivative-free nonlinear optimization algorithms. The NM method starts
with � + points (vertices) � , � , … , � + , these vertices are evaluated, ordered and re-
labeled in order to assign the best point and the worst point. In minimization problems, the �
is considered as the best vertex or point if it has the minimum value of the objective function,
3. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-27-
while the worst point � + with the maximum value of the objective function. At each
iteration, new points are computed, along with their function values, to form a new simplex.
Four scalar parameters must be specified to define a complete Nelder-Mead method, these
parameters are reported in Table 1 and are chosen to satisfy � > , � > , < < , and
< � < .
The main steps of the Nelder-Mead method are shown in Algorithm 1 and the
summarization of these steps is shown as follow.
Step 1. The algorithm of the Nelder-Mead method starts with � + vertices ��, � = , … , � +
, which are evaluated and ordered according to their fitness function.
Step 2. The refection process starts by computing the reflected point � = � ( �
̅ −
� + ), where �̅ is the average of all points except the worst and � is a coefficients
of reflection parameter, � > .
Step 3. If the reflected point � is lower than the � ℎ
point � � and greater than the best
point � � , then the reflected point is accepted and the iteration is terminated.
Step 4. If the reflected point is better than the best point, then the algorithm starts the
expansion process by calculating the expanded point � , where � = � � − �
̅ , is
an expansion parameter and � > .
Step 5. If � is better than the reflected point � ℎ
, the expanded point � is accepted,
otherwise the reflected point is accepted and the iteration will terminated.
Step 6. If the reflected point � is greater than the � ℎ
point � , the algorithm starts a
contraction process by calculating an outside contracted point � , where � = �̅ +
� − �̅ or an inside contracted point �� by calculating an inside contracted point
�� , where �� = �̅ + � + − �̅ , is a contraction parameter and < < .
The selection of the outside contraction process and the inside contraction process is
depending on the values of the reflected point � and the � ℎ
point � .
Step 7. If the outside contracted point � or the inside contracted point �� is greater than the
reflected point � , the shrinkage process is starting by calculating the shrink point. In
the shrink process, the points are evaluated and the new vertices of simplex at the next
iteration will be �̀ , … , �̀ + , where �̀ = � + � �� − � , � = , … , � + , � is a
shrinkage parameter and < � < .
Algorithm 1 The Nelder-Mead Algorithm
1: Let �� denote the list of vertices in the current simplex, � = , … , � + .
2: Order. Order and re-label the � + vertices from lowest function value � � to highest function value
� � + so that � � � � … � � + .
3: Reflection. Compute the refection point � by � = �̅ + � �̅ − � + , where �̅ is the centroid of the � best
points, �̅ = ∑ �� /� , � = , … , �.
IF � � � � < � � Then
Replace � + with the reflected point � and go to Step 7.
End IF
4: Expansion.
IF � � < � � Then
Compute the expansion point, � by � = �̅ + � � − �̅ .
End IF
IF � � < � � Then
Replace � + with � and go to Step 7.
Else
4. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-28-
Replace � + with � and go to Step 7.
End IF
5: Contraction.
IF � � − � � Then
Perform a contraction between �̅ and the best among � + and � .
End IF
IF � � � � < � � + Then
Calculate � = �̅ + � − �̅ Outside contract
End IF
IF � � � � < � � + Then
Replace � + with � and go to Step 7.
Else
Go to Step 6.
End IF
IF � � � � + Then
Calculate �� = �̅ + � + − �̅ Inside contract
End IF
IF � �� � � + Then
Replace � + with �� and go to Step 7.
Else
Go to Step 6.
End IF
6: Shrink. Evaluate the � new vertices, �́ = � + � �� − � , � = , … , � + .
Replace the vertices � , … , � + with the new vertices �′
, … , � +
′
.
7: Stopping Condition. Order and re-label the vertices of the new simplex as
� , � , … , � + such that � � � � � � +
IF � � + − � � < � Then
Stop, where � > is a small-predetermined tolerance.
Else
Go to Step 3.
End IF
2.3. An Overview of the Bat Algorithm
Bat algorithm (BA) is a population based meta-heuristics algorithm developed by Xin-
She Yang in 2010 [30]. BA is based on the echolocation of microbats, which use a type of
sonar (echolocation) to detect prey and avoid obstacles in the dark. The main advantage of the
BA is that it can provide fast convergence at an initial stage by switching from exploration to
exploitation process. However, switching from exploration to exploitation quickly may lead
to stagnation after some initial stage. The main characteristics and steps of the bat algorithm
are presented in Algorithm 2 and can be summarized as follow.
2.3.1. Velocity and Movement of Virtual Bats
In simulation, at iteration �, each bat in the population moves randomly with a velocity
�� and a position �� . The position of each bat (solution) is evaluated by calculating its fitness
function value � �� and the overall best solution �∗
is assigned according to this value. The
position �� and the velocity �� for each solution in the population are adjusted as shown in
Equations 2, 3, 4. Bat algorithm is considered as a frequency-tuning algorithm, since each bat
is randomly assigned a frequency�, � ∈ [ � � , � ]. The frequency parameter is very
important to balance between the exploration and the exploitation processes in bat algorithm.
5. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-29-
In the initial population, each bat is randomly assigned a frequency then these values are
adjusted as shown in Equation 2.
�� = � � + � − � i (2)
Where ∈ [ , ] is a random vector drawn from a uniform distribution. The initial
velocity and position of each bat in the population are assigned randomly then they are
updated as shown in Equations 3, 4, respectively.
�� = ��
−
+ ( ��
−
− �∗
)��
(3)
Where �∗
is the best solution in the population.
�� = ��
−
+ ��
(4)
2.3.2. Loudness and Pulse Emission Rate
The loudness parameter �� and the pulse emission rate parameter �� are very important
parameters in a bat algorithm, since they control and switch between exploration and
exploitation process during the search. The loudness decreases once a bat has found its prey,
while the pulse emission rate increases. The values of loudness have to vary between
� and � � , when � � = means that a bat has found the prey. The value of loudness
can be updated during the search as follow.
��
+
= ∝ ��
(5)
Where ∝ is a constant and has the same effect as the cooling factor in simulated
annealing algorithm. In addition, the pulse emission rate parameter can be updated as follow.
�� = �� [ − exp − � ] (6)
Where is a constant and > .
2.3.3 Local Search Method
Each bat (solution) in the population is evaluated by calculating its fitness function
value and the overall best solution is selected as a current best solution �∗
. Once the best
solution is selected, each bat in the population generates a new solution by using a random
walk method as follow.
� = � + � � (7)
Where � is a random number and � ∈ [− , ], � = < �� > is the average loudness of
all the bats at the current iteration.
2.3.4. Bat Algorithm
The main steps of the bat algorithm are presented in Algorithm 2 and the description of
it can be summarized as follow.
6. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-30-
Algorithm 2 Bat Algorithm
1: Set the initial values of the minimum frequency � � , maximum frequency � , population size ��, the
loudness constant , the rate of pulse emission constant , the initial loudness � , the minimum loudness
� � , the initial rate of pulse emission � and the maximum number or iterations ��� .
2: Set � = .
3: For � = ; � < ��; � + + do
4: Generate the initial bat population �� randomly.
5: Generate the initial bat velocities �� randomly.
6: Assign the initial frequency �� to each �� .
7: Evaluate the initial population by calculating the objective function � �� for each solution in the
Population.
8: Set the initial values of the pulse rates �� and loudness ��.
9: End For
10:Repeat
11: � = � + .
12: Generate new bat solutions �� by adjusting frequency as shown in Equation 4.
13: Update the bat velocities �� as shown in Equations 2, 3.
14: Evaluate the new population by calculating the objective function � �� for each solution in the
population
15: Select the best solution �∗
from the population.
16: IF ���� > �� Then
17: Select a solution among the best solutions
18: Generate a local search solution around the selected best solution as shown in Equation 7.
19: End IF
20: Generate a random new solution
21: IF ���� < �� & � �� < � �∗
Then
22: Accept the new solutions.
23: Increase the rate of pulse emission �� and reduce the loudness � as shown in Equations 5, 6.
24: End IF
25: Evaluate the new population by calculating the objective function � �� for each solution in the
population.
26: Rank the population and select the best solution �∗
from the population.
27: Until � < ���
28: Produce the best solution.
Step 1. The algorithm starts by setting the initial values of its parameters and the main iteration counter is set to
zero (lines 1-2).
Step 2. The initial population is generated randomly by generating the initial position � and the initial velocity
� for each bat (solution) in the population, the initial frequency �� is assigned to each solution in the
population, where � is generated randomly from [� � , � ]. The initial population is evaluated by
calculating the objective function for each solution in the initial population � �� and the values of
pulse rate �� and loudness �� is initialized, where � ∈ [ , ] and �� varies from a large � to � �
(lines 3-9).
Step 3. The new population is generated by adjusting the position �� and the velocity �� for each solution in the
population as shown in Equations 2, 3, 4, where ∈ [ , ] is a random vector drawn from a uniform
distribution (lines 12-13).
Step 4. The new population is evaluated by calculating the objective function for each solution and the best
solution �∗
is selected from the population (lines 14-15).
Step 5. The local search method is applied by using a random walk method as show in Equation 7 in order to
refine the best-found solution at each iteration (lines 16-19).
Step 6. The new solution is accepted with some proximity depending on parameter ��, the rate of pulse emission
increases and the loudness decreases. The values of �� and �� are updated as shown in Equations 5 and
6.
Step 7. The new population is evaluated and the best solution is selected from the population. The operations are
repeated until termination criteria satisfied and the overall best solution is produced (lines 25-28).
7. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-31-
3. Accelerated Bat Algorithm (ABATA)
In the proposed algorithm, we combine the bat algorithm, which has a good capability
of exploring the search space and the Nelder-Mead method, which is one of the most
important direct search method and has a powerful performance as a local search method. The
proposed algorithm is called Accelerated BAT Algorithm (ABATA). ABATA starts with an
initial population, which is generated randomly and consists of �� bats (solutions). These
solutions are updated by moving randomly with a velocity �� and a position �� . Each solution
is evaluated by calculating its fitness function and the best solution is selected from the
population according to its fitness function value. ABATA uses a Nelder-Mead method as a
local search instead of a random walk method, which is applied in the standard bat algorithm
in order to refine the best solution found so far at each iteration. The structure of ABATA is
shown in Algorithm 3 and more details of ABATA structure are given bellow.
3.1. ABATA Algorithm
The formal detailed description of ABATA is given in the Algorithm 3 and we can
summarize the main steps of it as follow.
Algorithm 3 ABATA Algorithm
1: Set the initial values of the minimum frequency � � , maximum frequency � , population size ��, the
loudness constant , the rate of pulse emission constant , the initial loudness � , the minimum loudness
� � , the initial rate of pulse emission � and the maximum number or iterations ��� .
2: Set � = .
3: For � = ; � < ��; � + + do
4: Generate the initial bat population �� randomly.
5: Generate the initial bat velocities �� randomly.
6: Assign the initial frequency �� to each �� .
7: Evaluate the initial population by calculating the objective function � �� for each solution in the
Population.
8: Set the initial values of the pulse rates �� and loudness ��.
9: End For
10:Repeat
11: � = � + .
12: Generate new bat solutions �� by adjusting frequency as shown in Equation 4.
13: Update the bat velocities �� as shown in Equations 2, 3.
14: Evaluate the new population by calculating the objective function � �� for each solution in the
population
15: Select the best solution �∗
from the population.
16: IF ���� > �� Then
17: Select a solution among the best solutions
18: Refine the best obtained solution by using Nelder-Mead method as shown in Algorithm 1.
19: End IF
20: Generate a random new solution
21: IF ���� < �� & � �� < � �∗
Then
22: Accept the new solutions.
23: Increase the rate of pulse emission �� and reduce the loudness � as shown in Equations 5, 6.
24: End IF
25: Evaluate the new population by calculating the objective function � �� for each solution in the population
26: Rank the population and select the best solution �∗
from the population
27: Until � < ���
28: Produce the best solution.
8. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-32-
Step 1. The parameters of the minimum frequency � � , maximum frequency � ,
population size ��, the loudness constant � � , the rate of pulse emission constant ,
the initial loudness � , the minimum loudness � � , the initial rate of pulse emission
� , the maximum number or iterations ��� and the initial iteration counter are set
to their initial values (lines 1-2).
Step 2. The initial population is generated randomly by generating the initial position � and
the initial velocity � for each bat (solution) in the population, the initial frequency
�� is assigned to each solution in the population. The initial population is evaluated
by calculating the objective function for each solution in the initial population � ��
and the values of pulse rate �� and loudness �� is initialized (lines 3-9).
Step 3. The new population is generated by adjusting the position �� and the velocity �� for
each solution in the population as shown in Equations 2, 3, 4 (lines 12-13).
Step 4. The new population is evaluated by calculating the objective function for each
solution and the best solution �∗
is selected from the population (lines 14-15).
Step 5. The Nelder Mead method is applied as shown in Algorithm 1 in order to refine the
best-found solution at each iteration (lines 16-19).
Step 6. The new solution is accepted with some proximity depending on parameter ��, the
rate of pulse emission increases and the loudness is decreased as shown in Equations
5 and 6. (lines 21-24).
Step 7. The new population is evaluated and the best solution is selected from the population.
The operations are repeated until termination criteria satisfied. Finally, the overall
best solution is produced (lines 25-28).
In order to investigate the correctness of the proposed algorithm, we test it on seven
benchmark functions with known optimal values as shown in Table 2. The proposed
algorithm terminates the search when it reaches to the optimal value or near optimal value as
shown in Subsection 4.1. In the following section, we test the general performance of the
proposed algorithm and compare it with other algorithms to verify from its correctness.
4. Numerical Experiments
The performance of ABATA is tested on seven benchmark functions, which are
reported in Subsection 4.2 and their properties are reported in Table 2. ABATA was
programmed in MATLAB and the results of it are averaged over 50 runs. Before discussing
the results, we present the parameter tuning and performance analysis of ABATA as follows.
4.1. Parameter Setting
Before discussing the results, we summarize the setting of ABATA parameters and
there values as shown in Table 1.
9. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-33-
Table 1. Parameter setting.
Parameters Definitions Values
�� population size 20
� � minimum frequency 0
� maximum frequency 5
� initial loudness 1
� initial pulse emission rate 0.5
loudness constant 0.95
rate of pulse emission constant 0.9
� reflection parameter 1
� expansion parameter 2
contraction parameter 0.5
� shrinkage parameter 0.5
��� maximum number of iteration 1000
��� no. of maximum iterations used in NM method �
� no. of best solution for local search 1
These values are based on the common setting in the literature or determined through
our preliminary numerical experiments. These parameters are categorized in the following groups.
Population size parameter. The experimental tests show that the best population size
is �� = , increasing this number will increase the value of the evaluation function
without any improvement in the obtained results.
Frequency parameters. ABATA can be considered as a frequency-tuning algorithm.
Each bat (solution) is assigned a random frequency �, where� ∈ [� � , � ]. The
experimental results show that the best values of � � and � are set to 0, 5, respectively.
Loudness and pulse emission rate parameters. The values of loudness parameter �
and pulse emission rate � are very important to control the wide exploration and deep
exploitation process. The experimental results show that the best initial values for the
parameters � and � are set to 1 and 0.5, respectively. The values of the parameters �
and � are updated as shown in Equations 5, 6. The parameter is similar to the cooling
factor in simulated annealing. The best values of the parameters and are set to 0.95
and 0.9, respectively.
Local search parameters. ABATA uses a Nelder-Mead method as a local search
method starting from � best solutions, we set � = . The experimental results
show that the best parameter values of the Nelder-Mead method are � = , � = ,
= . , � = . and the maximum number of iterations used in the Nelder-Mead
method is �, where d is a problem dimension.
Termination parameters. The main termination criterion in ABATA is that the
maximum number of iterations is set to 1000. However, there are other two termination
criteria in order to make a fair comparison with other algorithms. The first termination
criterion is if | � − � � | < , where � and � � represent the best solution
found by the algorithm and the global minimum, respectively, the value of is set to
10-4
. The second termination criterion is that the maximum evaluation function value is
set to 20,000.
10. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-34-
4.2. Integer Programming Optimization Test Problems
ABATA is tested on seven benchmark integer-programming problems � − � and
compared against different algorithms in order to investigate its performance when applied to
solve integer-programming problems. The properties of the benchmark functions (function
number, dimension of the problem, problem bound and the global optimal of each problem)
are listed in Table 2 and the functions with their definitions are reported as follows.
Test problem 1 [22] This problem is defined by
� � = ‖�‖ = |� | + + |� |,
Test problem 2 [22] This problem is defined by
� � = ��
� = [� … � ] [
�
�
],
Test problem 3 [6] This problem is defined by
� � = −[ ]�
+ ��
[
− − −
− − −
− − − −
− − −
− − − ]
�,
Test problem 4 [6] This problem is defined by
� � = � + � − + � + � − ,
Test problem 5 [6] This problem is defined by
� � = � + � + � − � + � − � + � − � ,
Test problem 6 [21] This problem is defined by
� � = � + � + � � − � − � ,
Test problem 7 [6] This problem is defined by
� � = − . − . � − . � + . � + . � + . � � ,
Table 2. The properties of the Integer programming test functions.
Function Dimension Bound Optimal
� 5 [ − ] 0
� 5 [ − ] 0
� 5 [ − ] -737
� 2 [ − ] 0
� 4 [ − ] 0
� 2 [ − ] -6
� 2 [ − ] -3833.12
11. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-35-
4.3. The General Performance of ABATA with Integer Programming Problems
The first test to investigate the general performance of the proposed algorithm with the
integer programming problems has been applied by plotting the values of function values
versus the number of iterations as shown in Figure 1 for three-test functions � , � , � . The
results in Figure 1 show that the function values of ABATA are rapidly decreases as the
number of iterations increases and the hybridization between the bat algorithm and the
Nelder-Mead method can accelerate the search and help the algorithm to obtain the optimal or
near optimal solution in reasonable time.
Fig. 1. The general performance of ABATA with integer programming problems.
4.4. The Efficiency of ABATA with Integer Programming Problems
The second test in order to verify the efficiency of ABATA, has been applied by
comparing the proposed ABATA against the standard BA using the same BA parameters and
the same termination criteria. The results are shown in Figure 2. The solid line refers to
ABATA results, while the dotted line refers to the standard BA results. The results in Figure 2
represent the general performance of ABATA and the standard BA on four functions
� , � , � , � by plotting the values of function values versus the number of iterations. Figure 2
shows that the function values are rapidly decrease as the number of iterations increases for
ABATA results than those of the standard BA. We can conclude from Figures 1, 2 that the
combination between the bat algorithm and the Nelder-Mead method is effective and
accelerate the convergence of the proposed algorithm.
12. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-36-
Fig. 2. The efficiency of ABATA with integer programming problems.
4.5. ABATA and Other Algorithms
ABATA is compared against four benchmark algorithms (particle swarm optimization
with different variants) in order to verify of the efficiency of the proposed algorithm. Before
discussing the comparison results of all algorithms, we present a brief description about the
comparative four algorithms [20] as follows.
RWMPSOg. RWMPSOg is a RandomWalk Memetic Particle Swarm Optimization
(with global variant), which combines the particle swarm optimization with random
walk with direction exploitation by applying the random walk method in the overall best
global solution.
RWMPSOl. RWMPSOl is a Random Walk Memetic Particle Swarm Optimization
(with local variant), which combines the particle swarm optimization with random walk
with direction exploitation by applying the random walk method in the local best
solution.
PSOg. PSOg is a standard particle swarm optimization with global variant without local
search method.
PSOl. PSOl is a standard particle swarm optimization with local variant without local
search method.
4.5.1. Comparison between RWMPSOg, RWMPSOl, PSOg, PSOl and ABATA.
In this subsection, we present the comparison results between ABATA and the other
algorithms. The four comparative algorithms are tested on seven benchmark functions, which
are reported in Subsection 4.2. The results of the comparative algorithms are taken from their
original papers [20]. The minimum (min), maximum (max), average (Mean), standard
deviation (St.D) and Success rate (%Suc) of the evaluation function values are reported over
50 runs and reported in Table 3. The run is considered success if the algorithm reached to the
13. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-37-
global minimum of the solution within an error of 10-4
before the 20,000 function evaluation
value. The best results between the comparative algorithms are reported with boldface text.
The results in Table 3 show that ABATA is successes in all runs and obtains the objective
value of each function faster than the other algorithms.
Table 3. Experimental results of function evaluation for �� − �� test problems
Function Algorithm Min Max Mean St.D Suc
� RWMPSOg 17,160 74,699 27,176.3 8657 50
RWMPSOl 24,870 35,265 30,923.9 2405 50
PSOg 14,000 261,100 29,435.3 42,039 34
PSOl 27,400 35,800 31,252 1818 50
ABATA 1005 1225 1073.75 102.17 50
� RWMPSOg 252 912 578.5 136.5 50
RWMPSOl 369 1931 773.9 285.5 50
PSOg 400 1000 606.4 119 50
PSOl 450 1470 830.2 206 50
ABATA 425 645 511.25 98.773 50
� RWMPSOg 361 41,593 6490.6 6913 50
RWMPSOl 5003 15,833 9292.6 2444 50
PSOg 2150 187,000 12,681 35,067 50
PSOl 4650 22,650 11,320 3803 50
ABATA 202 4512 644.7 1358.85 50
� RWMPSOg 76 468 215 97.9 50
RWMPSOl 73 620 218.7 115.3 50
PSOg 100 620 369.6 113.2 50
PSOl 120 920 390 134.6 50
ABATA 104 150 123.5 19.63 50
� RWMPSOg 687 2439 1521.8 360.7 50
RWMPSOl 675 3863 2102.9 689.5 50
PSOg 680 3440 1499 513.1 43
PSOl 800 3880 2472.4 637.5 50
ABATA 656 1546 1059.25 381.02 50
� RWMPSOg 40 238 110.9 48.6 50
RWMPSOl 40 235 112 48.7 50
PSOg 80 350 204.8 62 50
PSOl 70 520 256 107.5 50
ABATA 80 125 101.25 20.15 50
� RWMPSOg 72 620 242.7 132.2 50
RWMPSOl 70 573 248.9 134.4 50
PSOg 100 660 421.2 130.4 50
PSOl 100 820 466 165 50
ABATA 80 425 187.5 159.60 50
14. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-38-
5. Conclusion
In this paper, a new hybrid algorithm has been proposed in order to solve integer-
programming problems by combining the bat algorithm with the Nelder-Mead method. The
proposed algorithm is called accelerated bat algorithm (ABATA). ABATA has a good ability
to perform a wide exploration and a deep exploitation. Invoking the Nelder-Mead method as a
local search method in ABATA accelerate the search by refining the best obtained solution at
each iteration. ABATA has been intensely tested on seven integer-programming problems and
compared against other 4 algorithms in order to test its performance for solving integer
programming problems. The numerical results indicate that the proposed ABATA is a
promising algorithm and suitable to find a global optimal solution or near optimal solution in
reasonable time.
References
[1]. B. Borchers and J.E. Mitchell, "Using an Interior Point Method In a Branch and Bound
Algorithm For Integer Programming", Technical Report, Rensselaer Polytechnic
Institute, July 1992.
[2]. N. Bacanin, M. Tuba, "Artificial Bee Colony (ABC) Algorithm for Constrained
Optimization Improved with Genetic Operators", Studies in Informatics and Control,
Vol. 21, Issue 2, pp. 137-146, 2012.
[3]. S.A. Chu, P.-W. Tsai, and J.-S. Pan, "Cat swarm optimization", Lecture Notes in
Computer Science (including subseries Lecture Notes in Artificial Intelligence and
Lecture Notes in Bioinformatics), 4099 LNAI:854-858, 2006.
[4]. M. Dorigo, "Optimization, Learning and Natural Algorithms", Ph.D. Thesis, Politecnico
di Milano, Italy, 1992.
[5]. A. R. Fletcher, "Practical method of optimization", Vol.1 & 2, John Wiley and Sons, 1980.
[6]. Glankwahmdee, J.S. Liebman and G.L. Hogg, "Unconstrained discrete nonlinear
programming", Engineering Optimization, 4, 95-107, 1979.
[7]. F.S. Hillier and G. J. Lieberman, "Introduction to operations research", MCGraw-Hill, 1995.
[8]. R. Jovanovic, M. Tuba, "An ant colony optimization algorithm with improved
pheromone correction strategy for the minimum weight vertex cover problem", Applied
Soft Computing, Vol. 11, Issue 8, pp. 53605366, 2011.
[9]. R. Jovanovic, M. Tuba, "Ant Colony Optimization Algorithm with Pheromone
Correction Strategy for Minimum Connected Dominating Set Problem", Computer
Science and Information Systems (ComSIS), Vol. 9, Issue 4, Dec 2012.
[10]. D. Karaboga and B. Basturk, "A powerful and e_cient algorithm for numerical function
optimization", artificial bee colony (abc) algorithm. Journal of global optimization,
39(3):459-471, 2007.
[11]. J. Kennedy, RC. Eberhart, "Particle Swarm Optimization", Proceedings of the IEEE
International Conference on Neural Networks, Vol 4, pp 19421948, 1995.
15. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-39-
[12]. E.C. Laskari, K.E. Parsopoulos, M.N. Vrahatis, "Particle Swarm Optimization for
Integer Programming", Proceedings of the IEEE 2002 Congress on Evolutionary
Computation, Honolulu (HI), pp. 1582-1587, 2002.
[13]. E.L. Lawler and D.W. Wood, "Branch and Bound Methods", A Survey, Operations
Research, Vol. 14, pp. 699-719, 1966.
[14]. X.L. Li, Z.J. Shao, and J.X. Qian, "Optimizing method based on autonomous animates
Fish-swarm algorithm", Xitong Gongcheng Lilun yu Shijian/System Engineering
Theory and Practice, 22(11):32, 2002.
[15]. V.M. Manquinho, J.P. Marques Silva, A.L. Oliveira and K.A. Sakallah, "Branch and
Bound Algorithms for Highly Constrained Integer Programs", Technical Report,
Cadence European Laboratories, Portugal, 1997.
[16]. JA. Nelder and R. Mead, "A simplex methods for function minimization", Computer
journal 7:308-313, 1965.
[17]. G. L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, editor, "Handbooks in OR &
MS", volume 1. Elsevier, 1989.
[18]. K.E. Parsopoulos and M.N. Vrahatis, "Unified particle swarm optimization for tackling
operations research problems", in Proceeding of IEEE 2005 swarm Intelligence
Symposium, Pasadena, USA, 53-59, 2005.
[19]. M.K. Passino, "Biomimicry of bacterial foraging for distributed optimization and
control", Control Systems, IEEE 22(3):52-67, 2002.
[20]. Y.G. Petalas, K.E. Parsopoulos. M.N. Vrahatis, "Memetic particle swarm optimization",
Ann oper Res, 156:99-127, 2007.
[21]. S.S. Rao, "Engineering optimization-theory and practice", Wiley: New Delhi, 1994.
[22]. G. Rudolph, "An evolutionary algorithm for integer programming", In: Davidor Y,
Schwefel H-P, Mnner R (eds), pp. 139-148. Parallel Problem Solving from Nature 3, 1994.
[23]. R. Tang, S. Fong, X.S. Yang, and S. Deb, " Wolf search algorithm with ephemeral
memory", In Digital Information Management (ICDIM), 2012 Seventh International
Conference on Digital Information Management, pages 165-172, 2012.
[24]. D. Teodorovic and M. DellOrco, "Bee colony optimization a cooperative learning
approach to complex transportation problems", In Advanced OR and AI Methods in
Transportation: Proceedings of 16th MiniEURO Conference and 10th Meeting of
EWGT (13-16 September 2005).Poznan: Publishing House of the Polish Operational
and System Research, pages 51-60, 2005.
[25]. M. Tuba, N. Bacanin, N. Stanarevic, "Adjusted artificial bee colony (ABC) algorithm
for engineering problems", WSEAS Transaction on Computers, Volume 11, Issue 4, pp.
111-120, 2012.
[26]. M. Tuba, M. Subotic, N. Stanarevic, "Performance of a modified cuckoo search
algorithm for unconstrained optimization problems", WSEAS Transactions on Systems,
Volume 11, Issue 2, pp. 62-74, 2012.
16. Egyptian Computer Science Journal Vol. 39 No. 1 January 2015 ISSN-1110-2586
-40-
[27]. N. Bacanin, I. Brajevic, M. Tuba, "Firefly Algorithm Applied to Integer Programming
Problems", Recent Advances in Mathematics, 2013.
[28]. X.S. Yang, "Firefly algorithm, stochastic test functions and design optimization",
International Journal of Bio-Inspired Computation, 2(2):78-84, 2010.
[29]. X.S. Yang and S. Deb, "Cuckoo search via levy flights", In Nature & Biologically
Inspired Computing, 2009. NaBIC 2009. World Congress on, pages 210-214. IEEE, 2009.
[30]. X.S. Yang, "A new meta-heuristic bat-inspired algorithm", Nature Inspired Cooperative
Strategies for Optimization (NICSO 2010), pages 6574, 2010.
[31]. S. Zuhe, A. Neumaier and M.C. Eiermann, "Solving Minimax problems by Interval
Methods", BIT, Vol. 30, PP. 742-751, 1990.