An Empirical Comparison of Some Multiobjective Graph Search Algorithms
نویسندگان
چکیده
This paper compares empirically the performance in time and space of two multiobjective graph search algorithms, MOA* and NAMOA*. Previous theoretical work has shown that NAMOA* is never worse than MOA*. Now, a statistical analysis is presented on the relative performance of both algorithms in space and time over sets of randomly generated problems.
منابع مشابه
A New Approach to Multiobjective A* Search
The paper presents a new algorithm for multiobjective heuristic graph search problems. The algorithm presents some nice properties that are easily proven. Additionally, empirical tests show that substantial savings in memory can be achieved over previous proposals.
متن کاملAn Analysis of Multiobjective Search Algorithms and Heuristics
This thesis analyzes the performance of multiobjective heuristic graph search algorithms. The analysis is focused on the influence of heuristic information, correlation between objectives and solution depth.
متن کاملRunning Time Analysis of Evolutionary Algorithms on Vector-Valued Pseudo-Boolean Functions
This paper presents a rigorous running time analysis of evolutionary algorithms on pseudo-Boolean multiobjective optimization problems. We propose and analyze di erent population-based algorithms, the simple evolutionary multiobjective optimizer SEMO and two improved versions, FEMO and GEMO. The analysis is carried out on two bi-objective model problems, LOTZ (Leading Ones Trailing Zeroes) and ...
متن کاملBidirectional Preference-based Search for Multiobjective State Space Graph Problems
In multiobjective state space graph problems, each solution-path is evaluated by a cost vector. These cost vectors can be partially or completely ordered using a preference relation compatible with Pareto dominance. In this context, multiobjective preference-based search (MOPBS) aims at computing the preferred feasible solutions according to a predefined preference model, these preferred soluti...
متن کاملThe Role of Elitism in Multiobjective Optimization with Evolutionary Algorithms
This paper studies the influence of elitism in Evolutionary Multiobjective Optimization. The true efficiency of inserting elitism in these algorithms was not yet sufficiently developed. Many algorithms for multiobjective optimization use different methods to keep the best individuals (the elite) founded on the duration of the search process. The problem is how this elitism can be preserved and,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010