Global Bacteria Optimization Meta-Heuristic

2011 ◽  
pp. 178-194 ◽  
Author(s):  
Elyn L. Solano-Charris ◽  
Libardo S. Gómez-Vizcaíno ◽  
Jairo R. Montoya-Torres ◽  
Carlos D. Paternina-Arboleda
Keyword(s):  
Optimization Problems ◽  
Real Life ◽  
Good Alternative ◽  
Computational Time ◽  
Approximate Algorithms ◽  
Scheduling Problems ◽  
Mathematical Functions ◽  
Multi Objective ◽  
Combinatorial Optimization Problems

A large number of real-life optimization problems in economics and business are complex and difficult to solve. Hence, using approximate algorithms is a very good alternative to solve this class of problems. Meta-heuristics solution procedures represent general approximate algorithms applicable to a large variety of optimization problems. Most of the meta-heuristics mimic natural metaphors to solve complex optimization problems. This chapter presents a novel procedure based on Bacterial Phototaxis, called Global Bacteria Optimization (GBO) algorithm, to solve combinatorial optimization problems. The algorithm emulates the movement of an organism in response to stimulus from light. The effectiveness of the proposed meta-heuristic algorithm is first compared with the well-known meta-heuristic MOEA (Multi-Objective Evolutionary Algorithm) using mathematical functions. The performance of GBO is also analyzed by solving some single- and multi-objective classical jobshop scheduling problems against state-of-the-art algorithms. Experimental results on well-known instances show that GBO algorithm performs very well and even outperforms existing meta-heuristics in terms of computational time and quality of solution.

scholarly journals ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov
Keyword(s):  
Decision Making ◽  
Knapsack Problem ◽  
Propositional Logic ◽  
Optimization Problems ◽  
Real Life ◽  
Combinatorial Optimization Problems ◽  
Intuitionistic Fuzzy ◽  
Life Problems ◽  
Multiple Constraint

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.

Multi Objective Optimization in Scheduling of FMS Using Roulette Wheel Selection Process

2012 ◽  
Vol 622-623 ◽  
pp. 35-39 ◽  
Author(s):  
Durgesh Sharma ◽  
Suresh Garg ◽  
Chitra Sharma
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Selection Process ◽  
Optimal Schedule ◽  
Real Life ◽  
Optimization Techniques ◽  
Scheduling Problem ◽  
Multi Objective ◽  
Combinatorial Optimization Problems ◽  
Roulette Wheel

Most of real-life engineering problems are objectives optimization problems. In many cases objectives under consideration conflict with each other and optimizing a particular solution with respect to a single objective can result in unacceptable results with respect to the other.FMS Scheduling problem is considered as one of the most difficult NP-hard combinatorial optimization problems. Therefore, determining an optimal schedule and controlling an FMS is considered a difficult task. It is difficult for traditional optimization techniques to provide the best solution. In this paper, we propose a multi-objective genetic algorithm for effectively solving job processing FMS Scheduling problem. An attempt has been made to generate a schedule using Genetic Algorithm with Roulette Wheel Base Selection Process to minimize Total Make Span Time and to maximize machine utilization time.

scholarly journals Complementing Solutions to Optimization Problems via Crowdsourcing on Video Game Plays

2020 ◽  
Vol 10 (23) ◽  
pp. 8410
Author(s):  
Mariano Vargas-Santiago ◽  
Raúl Monroy ◽  
José Emmanuel Ramirez-Marquez ◽  
Chi Zhang ◽  
Diana A. Leon-Velasco ◽  
...  
Keyword(s):  
Video Games ◽  
Video Game ◽  
Optimization Problems ◽  
Solution Space ◽  
Computer Algorithm ◽  
Computational Time ◽  
Scheduling Problems ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Conflicting Objectives

Leveraging human insight and intuition has been identified as having the potential for the improvement of traditional algorithmic methods. For example, in a video game, a user may not only be entertained but may also be challenged to beat the score of another player; additionally, the user can learn complicated concepts, such as multi-objective optimization, with two or more conflicting objectives. Traditional methods, including Tabu search and genetic algorithms, require substantial computational time and resources to find solutions to multi-objective optimization problems (MOPs). In this paper, we report on the use of video games as a way to gather novel solutions to optimization problems. We hypothesize that humans may find solutions that complement those found mechanically either because the computer algorithm did not find a solution or because the solution provided by the crowdsourcing of video games approach is better. We model two different video games (one for the facility location problem and one for scheduling problems), we demonstrate that the solution space obtained by a computer algorithm can be extended or improved by crowdsourcing novel solutions found by humans playing a video game.

scholarly journals Utilizing Model Knowledge for Design Developed Genetic Algorithm to Solving Problem

2018 ◽  
Vol 3 (2) ◽  
pp. 172
Author(s):  
Hamidreza Salmani mojaveri
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Parallel Machines ◽  
Job Shop ◽  
Optimization Problems ◽  
Premature Convergence ◽  
Local Optimum ◽  
Scheduling Problems ◽  
Algorithm Implementation

One of the discussed topics in scheduling problems is Dynamic Flexible Job Shop with Parallel Machines (FDJSPM). Surveys show that this problem because of its concave and nonlinear nature usually has several local optimums. Some of the scheduling problems researchers think that genetic algorithms (GA) are appropriate approach to solve optimization problems of this kind. But researches show that one of the disadvantages of classical genetic algorithms is premature convergence and the probability of trap into the local optimum. Considering these facts, in present research, represented a developed genetic algorithm that its controlling parameters change during algorithm implementation and optimization process. This approach decreases the probability of premature convergence and trap into the local optimum. The several experiments were done show that the priority of proposed procedure of solving in field of the quality of obtained solution and convergence speed toward other present procedure.

A multi-objective evolutionary algorithm based on niche selection in solving irregular Pareto fronts

2021 ◽  
pp. 1-21
Author(s):  
Xin Li ◽  
Xiaoli Li ◽  
Kang Wang
Keyword(s):  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Environmental Selection ◽  
Optimal Solution Set ◽  
Pareto Fronts

The key characteristic of multi-objective evolutionary algorithm is that it can find a good approximate multi-objective optimal solution set when solving multi-objective optimization problems(MOPs). However, most multi-objective evolutionary algorithms perform well on regular multi-objective optimization problems, but their performance on irregular fronts deteriorates. In order to remedy this issue, this paper studies the existing algorithms and proposes a multi-objective evolutionary based on niche selection to deal with irregular Pareto fronts. In this paper, the crowding degree is calculated by the niche method in the process of selecting parents when the non-dominated solutions converge to the first front, which improves the the quality of offspring solutions and which is beneficial to local search. In addition, niche selection is adopted into the process of environmental selection through considering the number and the location of the individuals in its niche radius, which improve the diversity of population. Finally, experimental results on 23 benchmark problems including MaF and IMOP show that the proposed algorithm exhibits better performance than the compared MOEAs.

Multi-Objective Genetic and Fuzzy Approaches in Rule Mining Problem of Knowledge Discovery in Databases

2014 ◽  
pp. 147-179
Author(s):  
Harihar Kalia ◽  
Satchidananda Dehuri ◽  
Ashish Ghosh
Keyword(s):  
Knowledge Discovery ◽  
Optimization Problems ◽  
Fuzzy Rule ◽  
Numerical Data ◽  
Knowledge Discovery In Databases ◽  
Rule Mining ◽  
Boundary Problems ◽  
Multi Objective ◽  
Advantages And Disadvantages

Knowledge Discovery in Databases (KDD) is the process of automatically searching patterns from large volumes of data by using specific data mining techniques. Classification, association, and associative classification (integration of classification and association) rule mining are popularly used rule mining techniques in KDD for harvesting knowledge in the form of rule. The classical rule mining techniques based on crisp sets have bad experience of “sharp boundary problems” while mining rule from numerical data. Fuzzy rule mining approaches eliminate these problems and generate more human understandable rules. Several quality measures are used in order to quantify the quality of these discovered rules. However, most of these objectives/criteria are conflicting to each other. Thus, fuzzy rule mining problems are modeled as multi-objective optimization problems rather than single objective. Due to the ability of finding diverse trade-off solutions for several objectives in a single run, multi-objective genetic algorithms are popularly employed in rule mining. In this chapter, the authors discuss the multi-objective genetic-fuzzy approaches used in rule mining along with their advantages and disadvantages. In addition, some of the popular applications of these approaches are discussed.

Dynamic Template Generation

2021 ◽  
pp. 1-37
Keyword(s):  
Optimization Problems ◽  
Real Life ◽  
Dynamic Test ◽  
Test Paper ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Life Problems ◽  
Conflicting Objectives ◽  
Complex Optimization ◽  
Dynamic Template

A test blueprint/test template, also known as the table of specifications, represents the structure of a test. It has been highly recommended in assessment textbook to carry out the preparation of a test with a test blueprint. This chapter focuses on modeling a dynamic test paper template using multi-objective optimization algorithm and makes use of the template in dynamic generation of examination test paper. Multi-objective optimization-based models are realistic models for many complex optimization problems. Modeling a dynamic test paper template, similar to many real-life problems, includes solving multiple conflicting objectives satisfying the template specifications.

scholarly journals Comparison of synchronous and asynchronous parallelization of extreme surrogate-assisted multi-objective evolutionary algorithm

2020 ◽  
Author(s):  
Tomohiro Harada ◽  
Misaki Kaidan ◽  
Ruck Thawonmas
Keyword(s):  
Machine Learning ◽  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Computing Time ◽  
The Other ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Evaluation Time ◽  
Surrogate Function

Abstract This paper investigates the integration of a surrogate-assisted multi-objective evolutionary algorithm (MOEA) and a parallel computation scheme to reduce the computing time until obtaining the optimal solutions in evolutionary algorithms (EAs). A surrogate-assisted MOEA solves multi-objective optimization problems while estimating the evaluation of solutions with a surrogate function. A surrogate function is produced by a machine learning model. This paper uses an extreme learning surrogate-assisted MOEA/D (ELMOEA/D), which utilizes one of the well-known MOEA algorithms, MOEA/D, and a machine learning technique, extreme learning machine (ELM). A parallelization of MOEA, on the other hand, evaluates solutions in parallel on multiple computing nodes to accelerate the optimization process. We consider a synchronous and an asynchronous parallel MOEA as a master-slave parallelization scheme for ELMOEA/D. We carry out an experiment with multi-objective optimization problems to compare the synchronous parallel ELMOEA/D with the asynchronous parallel ELMOEA/D. In the experiment, we simulate two settings of the evaluation time of solutions. One determines the evaluation time of solutions by the normal distribution with different variances. On the other hand, another evaluation time correlates to the objective function value. We compare the quality of solutions obtained by the parallel ELMOEA/D variants within a particular computing time. The experimental results show that the parallelization of ELMOEA/D significantly reduces the computational time. In addition, the integration of ELMOEA/D with the asynchronous parallelization scheme obtains higher quality of solutions quicker than the synchronous parallel ELMOEA/D.

Sign in / Sign up

Export Citation Format

Share Document