1,424 research outputs found
Ergonomic Chair Design by Fusing Qualitative and Quantitative Criteria using Interactive Genetic Algorithms
This paper emphasizes the necessity of formally bringing qualitative and
quantitative criteria of ergonomic design together, and provides a novel
complementary design framework with this aim. Within this framework, different
design criteria are viewed as optimization objectives; and design solutions are
iteratively improved through the cooperative efforts of computer and user. The
framework is rooted in multi-objective optimization, genetic algorithms and
interactive user evaluation. Three different algorithms based on the framework
are developed, and tested with an ergonomic chair design problem. The parallel
and multi-objective approaches show promising results in fitness convergence,
design diversity and user satisfaction metrics
A bi-objective genetic algorithm approach to risk mitigation in project scheduling
A problem of risk mitigation in project scheduling is formulated as a bi-objective optimization problem, where the expected makespan and the expected total cost are both to be minimized. The expected total cost is the sum of four cost components: overhead cost, activity execution cost, cost of reducing risks and penalty cost for tardiness. Risks for activities are predefined. For each risk at an activity, various levels are defined, which correspond to the results of different preventive measures. Only those risks with a probable impact on the duration of the related activity are considered here. Impacts of risks are not only accounted for through the expected makespan but are also translated into cost and thus have an impact on the expected total cost. An MIP model and a heuristic solution approach based on genetic algorithms (GAs) is proposed. The experiments conducted indicate that GAs provide a fast and effective solution approach to the problem. For smaller problems, the results obtained by the GA are very good. For larger problems, there is room for improvement
Research on Preference Polyhedron Model Based Evolutionary Multiobjective Optimization Method for Multilink Transmission Mechanism Conceptual Design
To make the optimal design of the multilink transmission mechanism applied in mechanical press, the intelligent optimization techniques are explored in this paper. A preference polyhedron model and new domination relationships evaluation methodology are proposed for the purpose of reaching balance among kinematic performance, dynamic performance, and other performances of the multilink transmission mechanism during the conceptual design phase. Based on the traditional evaluation index of single target of multicriteria design optimization, the robust metrics of the mechanism system and preference metrics of decision-maker are taken into consideration in this preference polyhedron model and reflected by geometrical characteristic of the model. At last, two optimized multilink transmission mechanisms are designed based on the proposed preference polyhedron model with different evolutionary algorithms, and the result verifies the validity of the proposed optimization method
A convergence acceleration operator for multiobjective optimisation
A novel multiobjective optimisation accelerator is
introduced that uses direct manipulation in objective space
together with neural network mappings from objective space to decision space. This operator is a portable component that can be hybridized with any multiobjective optimisation algorithm. The purpose of this Convergence Acceleration Operator (CAO) is to enhance the search capability and the speed of convergence of the host algorithm. The operator acts directly in objective space to suggest improvements to solutions obtained by a multiobjective evolutionary algorithm (MOEA). These suggested improved objective vectors are then mapped into decision variable space and tested. The CAO is incorporated with two leading MOEAs, the Non-Dominated Sorting Genetic Algorithm (NSGA-II) and the Strength Pareto Evolutionary Algorithm (SPEA2) and tested. Results show that the hybridized algorithms consistently improve the speed of convergence of the original algorithm whilst maintaining the desired distribution of solutions
A Preference-guided Multiobjective Evolutionary Algorithm based on Decomposition
Multiobjective evolutionary algorithms based on decomposition (MOEA/Ds) represent a class of widely employed problem solvers for multicriteria optimization problems. In this work we investigate the adaptation of these methods for incorporating preference information prior to the optimization, so that the search process can be biased towards a Pareto-optimal region that better satisfies the aspirations of a decision-making entity. The incorporation of the Preference-based Adaptive Region-of-interest (PAR) framework into the MOEA/D requires only the modification of the reference points used within the scalarization function, which in principle allows a straightforward use in more sophisticated versions of the base algorithm. Experimental results using the UF benchmark set suggest gains in diversity within the region of interest, without significant losses in convergence
06501 Abstracts Collection -- Practical Approaches to Multi-Objective Optimization
From 10.12.06 to 15.12.06, the Dagstuhl Seminar 06501 ``Practical Approaches to Multi-Objective Optimization\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
An ACO-based Hyper-heuristic for Sequencing Many-objective Evolutionary Algorithms that Consider Different Ways to Incorporate the DM's Preferences
Many-objective optimization is an area of interest common to researchers, professionals, and practitioners because of its real-world implications. Preference incorporation into Multi-Objective Evolutionary Algorithms (MOEAs) is one of the current approaches to treat Many-Objective Optimization Problems (MaOPs). Some recent studies have focused on the advantages of embedding preference models based on interval outranking into MOEAs; several models have been proposed to achieve it. Since there are many factors influencing the choice of the best outranking model, there is no clear notion of which is the best model to incorporate the preferences of the decision maker into a particular problem. This paper proposes a hyper-heuristic algorithm—named HyperACO—that searches for the best combination of several interval outranking models embedded into MOEAs to solve MaOPs. HyperACO is able not only to select the most appropriate model but also to combine the already existing models to solve a specific MaOP correctly. The results obtained on the DTLZ and WFG test suites corroborate that HyperACO can hybridize MOEAs with a combined preference model that is suitable to the problem being solved. Performance comparisons with other state-of-the-art MOEAs and tests for statistical significance validate this conclusion
Multi‐Objective Hyper‐Heuristics
Multi‐objective hyper‐heuristics is a search method or learning mechanism that operates over a fixed set of low‐level heuristics to solve multi‐objective optimization problems by controlling and combining the strengths of those heuristics. Although numerous papers on hyper‐heuristics have been published and several studies are still underway, most research has focused on single‐objective optimization. Work on hyper‐heuristics for multi‐objective optimization remains limited. This chapter draws attention to this area of research to help researchers and PhD students understand and reuse these methods. It also provides the basic concepts of multi‐objective optimization and hyper‐heuristics to facilitate a better understanding of the related research areas, in addition to exploring hyper‐heuristic methodologies that address multi‐objective optimization. Some design issues related to the development of hyper‐heuristic framework for multi‐objective optimization are discussed. The chapter concludes with a case study of multi‐objective selection hyper‐heuristics and its application on a real‐world problem
- …