scholarly journals The Multiagent Planning Problem

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Tamás Kalmár-Nagy ◽  
Giovanni Giardini ◽  
Bendegúz Dezső Bak
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Problem Solver ◽  
Planning Problem ◽  
Genetic Operators ◽  
Total Distance ◽  
Modified Genetic Algorithm ◽  
Multiagent Planning ◽  
Simple Paths ◽  
Better Than

The classical Multiple Traveling Salesmen Problem is a well-studied optimization problem. Given a set ofngoals/targets andmagents, the objective is to findmround trips, such that each target is visited only once and by only one agent, and the total distance of these round trips is minimal. In this paper we describe the Multiagent Planning Problem, a variant of the classical Multiple Traveling Salesmen Problem: given a set ofngoals/targets and a team ofmagents,msubtours (simple paths) are sought such that each target is visited only once and by only one agent. We optimize for minimum time rather than minimum total distance; therefore the objective is to find the Team Plan in which the longest subtour is as short as possible (a min–max problem). We propose an easy to implement Genetic Algorithm Inspired Descent (GAID) method which evolves a set of subtours using genetic operators. We benchmarked GAID against other evolutionary algorithms and heuristics. GAID outperformed the Ant Colony Optimization and the Modified Genetic Algorithm. Even though the heuristics specifically developed for Multiple Traveling Salesmen Problem (e.g.,k-split, bisection) outperformed GAID, these methods cannot solve the Multiagent Planning Problem. GAID proved to be much better than an open-source Matlab Multiple Traveling Salesmen Problem solver.

ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION

2009 ◽  
Vol 26 (04) ◽  
pp. 479-502 ◽  
Author(s):  
BIN LIU ◽  
TEQI DUAN ◽  
YONGMING LI
Keyword(s):  
Genetic Algorithm ◽  
Numerical Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Genetic Operators ◽  
Global Numerical Optimization ◽  
Candidate Solution ◽  
Low Dimension ◽  
Multi Agent ◽  
Agent Structure

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.

Solving the 0/1 knapsack problem using an adaptive genetic algorithm

2002 ◽  
Vol 16 (1) ◽  
pp. 23-30 ◽  
Author(s):  
ZOHEIR EZZIANE
Keyword(s):  
Genetic Algorithm ◽  
Knapsack Problem ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Adaptive Genetic Algorithm ◽  
Stochastic Algorithms ◽  
Initial Population ◽  
Genetic Operators ◽  
Adaptive Penalty ◽  
Genetic Algorithm Approach

Probabilistic and stochastic algorithms have been used to solve many hard optimization problems since they can provide solutions to problems where often standard algorithms have failed. These algorithms basically search through a space of potential solutions using randomness as a major factor to make decisions. In this research, the knapsack problem (optimization problem) is solved using a genetic algorithm approach. Subsequently, comparisons are made with a greedy method and a heuristic algorithm. The knapsack problem is recognized to be NP-hard. Genetic algorithms are among search procedures based on natural selection and natural genetics. They randomly create an initial population of individuals. Then, they use genetic operators to yield new offspring. In this research, a genetic algorithm is used to solve the 0/1 knapsack problem. Special consideration is given to the penalty function where constant and self-adaptive penalty functions are adopted.

scholarly journals Hybrid greedy genetic algorithm for the Euclidean Steiner tree problem

2019 ◽  
Author(s):  
Andrey Oliveira ◽  
Danilo Sanches ◽  
Bruna Osti
Keyword(s):  
Genetic Algorithm ◽  
Steiner Tree ◽  
Optimization Problem ◽  
Spanning Trees ◽  
Evolutionary Strategies ◽  
Steiner Tree Problem ◽  
Minimum Length ◽  
Genetic Operators ◽  
Steiner Points ◽  
Euclidean Steiner Tree Problem

This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem (OR-Library) are presented and discussed.This paper presents a genetic algorithm for the Euclidean Steiner tree problem. This is an optimization problem whose objective is to obtain a minimum length tree to interconnect a set of fixed points, and for this purpose to be achieved, new auxiliary points, called Steiner points, can be added. The proposed heuristic uses a genetic algorithm to manipulate spanning trees, which are then transformed into Steiner trees by inserting and repositioning the Steiner points. Greedy genetic operators and evolutionary strategies are tested. Results of numerical experiments for benchmark library problem (OR-Library) are presented and discussed.

scholarly journals Truss’ topology and shape optimization by genetic algorithms

2021 ◽  
Vol 47 ◽  
Author(s):  
Dmitrij Šešok ◽  
Paulius Ragauskas
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Shape Optimization ◽  
Optimization Problem ◽  
Numerical Solutions ◽  
Search Algorithm ◽  
Truss Topology ◽  
Modified Genetic Algorithm ◽  
Topology And Shape Optimization ◽  
System Characteristics

In the paper the global optimization problem of truss systems is studied.  The genetic algorithms are employed for the optimization. As the objective function the structure mass is treated; the constraints include equilibrium, local stability and other requirements.  All the truss system characteristics needed for genetic algorithm are obtained via finite element solution. Topology optimization of truss system is performed using original modified genetic algorithm, while the shape optimization – using ordinary genetic algorithm. Numerical solutions are presented. The obtained solutions are compared with global extremes obtained using full search algorithm.  All the numerical examples are solved using original software.

Finding Diversity in Mechanisms Using a Hybrid Genetic Algorithm

2000 ◽  
Author(s):  
Robert A. O’Neil ◽  
Louis J. Everett
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Solution Space ◽  
Global Optimum ◽  
Small Error ◽  
Test Function ◽  
Modified Genetic Algorithm ◽  
Path Synthesis ◽  
Alternative Solutions ◽  
Better Than

Abstract The path synthesis problem for mechanical linkages still presents problems for engineers, although it has been examined for more than two centuries. This research approached the design problem as one of creating a characteristic test function to compare a synthesized output path with a desired output path, and finding a set of linkages that reduce the corresponding error. Since the solution space of this approach is very large with typically a generous number of local minima, it may be possible to find several linkages that each produce a small error. This research investigated the ability to use a modified genetic algorithm to search for a global minima and simultaneously identify several linkage designs that are “almost” as good as the global optimum. Having alternative solutions will allow designers to choose a mechanism that best fits criteria other than path error. The results from using the method on a subclass of linkage problems demonstrate that solutions can be found that “fit” better than those found in the literature. The results also show that a diverse family of acceptable designs can be obtained and that this family includes both “well known” designs and heretofore unknown solutions.

scholarly journals Exploring human genome feature for improving genetic algorithm performance

2019 ◽  
Vol 270 ◽  
pp. 03001
Author(s):  
Febri Zukhruf ◽  
Irma Susan Kurnia ◽  
Russ Bona Frazila ◽  
Gaga Irawan Nugraha ◽  
Mas Rizky A.A Syamsunarno
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Transportation Network ◽  
Network Design Problem ◽  
Darwinian Evolution ◽  
Genetic Operators ◽  
Algorithm Performance ◽  
Genome Feature ◽  
Hard Problems ◽  
Np Hard Problems

Genetic algorithm (i.e., GA) has longtermly obtained an extensive recognition for solving the optimization problem. Its pipelines process, which involves several operations, has been applied in many NP-hard problems, including the transportation network design problem (i.e., TNDP). As part of evolutionary computation methods, GA is inspired by Darwinian evolution, which is relied on the genetic operators (i.e., recombination, and mutation). On other side, the considerably achievement has been acquired by the genome researches, which offers an opportunity to deeply explore the recombination and mutation processes. This paper then presents variants of GA, which are inspired by the recent genome evidence of genetic operators. This exploration expectantly extends the benefit of evolution-based algorithm, which has been shown by the previous finding of GA. For examining the performance of proposed GA, the numerical experiment is involved for solving the TNDP. The performance comparisons show that the variation of crossover rate within a certain group of population provide better result than the standard GA.

Research on Extreme Points Optimizing of Nonlinear Multi-Peak Function Based on Genetic Algorithm

2010 ◽  
Vol 121-122 ◽  
pp. 304-308
Author(s):  
Lu Gang Yang
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Extreme Points ◽  
Function Optimization ◽  
Experimental Result ◽  
Genetic Optimization ◽  
Binary Coding ◽  
Coding Method ◽  
Peak Function ◽  
Better Than

In the application of Genetic Algorithm (GA) to solve the function optimization problem, different encoding methods have different effect on performance of GA. Aiming at the global optimization problem of a class of nonlinear multi-peak function, the paper utilized binary coding and floating coding methods for genetic optimization and analyzed their performance. The experimental result of four kinds of typical nonlinear multi-peak function showed that under the precondition of given genetic operator, the optimizing performance of floating coding method to optimize nonlinear multi-peak function with isolated extreme points is less that the binary coding. The tuning ability of floating coding is stronger. As to the ordinary multi-peak function, the search affect is better than binary coding.

Sign in / Sign up

Export Citation Format

Share Document