Path optimization for multiple objectives in directed graphs using genetic algorithms

2008 ◽  
Author(s):  
Juan Rada ◽  
Ruben Parma ◽  
Wilmer Pereira
Keyword(s):  
Genetic Algorithms ◽  
Directed Graphs ◽  
Multiple Objectives ◽  
Path Optimization

Parallel Single and Multiple Objectives Genetic Algorithms

2013 ◽  
pp. 73-110
Author(s):  
B. S. P. Mishra ◽  
S. Dehuri ◽  
R. Mall ◽  
A. Ghosh
Keyword(s):  
Genetic Algorithms ◽  
Processing Time ◽  
Multiple Objectives ◽  
Multiple Objective ◽  
Acceptable Solution ◽  
Multi Objective ◽  
Potential Applications

This paper critically reviews the reported research on parallel single and multi-objective genetic algorithms. Many early efforts on single and multi-objective genetic algorithms were introduced to reduce the processing time needed to reach an acceptable solution. However, some parallel single and multi-objective genetic algorithms converged to better solutions as compared to comparable sequential single and multiple objective genetic algorithms. The authors review several representative models for parallelizing single and multi-objective genetic algorithms. Further, some of the issues that have not yet been studied systematically are identified in the context of parallel single and parallel multi-objective genetic algorithms. Finally, some of the potential applications of parallel multi-objective GAs are discussed.

FUZZY COGNITIVE MAPS WITH GENETIC ALGORITHM FOR GOAL-ORIENTED DECISION SUPPORT

2004 ◽  
Vol 12 (supp02) ◽  
pp. 31-42 ◽  
Author(s):  
M. SHAMIM KHAN ◽  
SEBASTIAN KHOR ◽  
ALEX CHONG
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Genetic Algorithms ◽  
Decision Support ◽  
Directed Graphs ◽  
Cognitive Maps ◽  
Fuzzy Cognitive Maps ◽  
Initial State ◽  
Initial Stimulus ◽  
Over Time

Fuzzy cognitive maps are signed directed graphs used to model the evolution of scenarios with time. FCMs can be useful in decision support for predicting future states given an initial state. Genetic algorithms (GA) are well-established tools for optimization. This paper concerns the use of FCMs in goal-directed analysis of scenarios for aiding decision making. A methodology for GA-based goal-directed analysis is presented. The search for the initial stimulus state, that over time leads to a target state of interest, is optimized using GA. This initial state found can be used to answer the question – what course of events leads to a certain state in a given scenario?

scholarly journals Comparison of Genetic Algorithm and Hill Climbing for Shortest Path Optimization Mapping

2018 ◽  
Vol 31 ◽  
pp. 11017
Author(s):  
Mona Fronita ◽  
Rahmat Gernowo ◽  
Vincencius Gunawan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Shortest Path ◽  
Path Optimization ◽  
Hill Climbing ◽  
Small Cities ◽  
Mutation Probability ◽  
Optimal Distance ◽  
Early Departure ◽  
Google Map Api

Traveling Salesman Problem (TSP) is an optimization to find the shortest path to reach several destinations in one trip without passing through the same city and back again to the early departure city, the process is applied to the delivery systems. This comparison is done using two methods, namely optimization genetic algorithm and hill climbing. Hill Climbing works by directly selecting a new path that is exchanged with the neighbour’s to get the track distance smaller than the previous track, without testing. Genetic algorithms depend on the input parameters, they are the number of population, the probability of crossover, mutation probability and the number of generations. To simplify the process of determining the shortest path supported by the development of software that uses the google map API. Tests carried out as much as 20 times with the number of city 8, 16, 24 and 32 to see which method is optimal in terms of distance and time computation. Based on experiments conducted with a number of cities 3, 4, 5 and 6 producing the same value and optimal distance for the genetic algorithm and hill climbing, the value of this distance begins to differ with the number of city 7. The overall results shows that these tests, hill climbing are more optimal to number of small cities and the number of cities over 30 optimized using genetic algorithms.

RDF Query Path Optimization Using Hybrid Genetic Algorithms

2022 ◽  
Vol 12 (1) ◽  
pp. 1-16
Author(s):  
Qazi Mudassar Ilyas ◽  
Muneer Ahmad ◽  
Sonia Rauf ◽  
Danish Irfan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Execution Time ◽  
Optimization Problems ◽  
Hybrid Genetic Algorithm ◽  
Solution Space ◽  
Path Optimization ◽  
Initial Population ◽  
Description Framework ◽  
The Cost

Resource Description Framework (RDF) inherently supports data mergers from various resources into a single federated graph that can become very large even for an application of modest size. This results in severe performance degradation in the execution of RDF queries. As every RDF query essentially traverses a graph to find the output of the Query, an efficient path traversal reduces the execution time of RDF queries. Hence, query path optimization is required to reduce the execution time as well as the cost of a query. Query path optimization is an NP-hard problem that cannot be solved in polynomial time. Genetic algorithms have proven to be very useful in optimization problems. We propose a hybrid genetic algorithm for query path optimization. The proposed algorithm selects an initial population using iterative improvement thus reducing the initial solution space for the genetic algorithm. The proposed algorithm makes significant improvements in the overall performance. We show that the overall number of joins for complex queries is reduced considerably, resulting in reduced cost.

Genetic Algorithms with multiple objectives

1998 ◽  
Author(s):  
Erik Schaumann ◽  
Richard Balling ◽  
Kirstin Day
Keyword(s):  
Genetic Algorithms ◽  
Multiple Objectives
Sign in / Sign up

Export Citation Format

Share Document