52 resultados para Multi-objective optimisation

em Deakin Research Online - Australia


Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, a Modified micro Genetic Algorithm (MmGA) is proposed for undertaking Multi-objective Optimization Problems (MOPs). An NSGA-II inspired elitism strategy and a population initialization strategy are embedded into the traditional micro Genetic Algorithm (mGA) to form the proposed MmGA. The main aim of the MmGA is to improve its convergence rate towards the pareto optimal solutions. To evaluate the effectiveness of the MmGA, two experiments using the Kursawe test function in MOPs are conducted, and the results are compared with those from other approaches using a multi-objective evolutionary algorithm indicator, i.e. the Generational Distance (GD). The outcomes positively demonstrate that the MmGA is able to provide useful solutions with improved GD measures for tackling MOPs.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, an evolutionary algorithm is used for developing a decision support tool to undertake multi-objective job-shop scheduling problems. A modified micro genetic algorithm (MmGA) is adopted to provide optimal solutions according to the Pareto optimality principle in solving multi-objective optimisation problems. MmGA operates with a very small population size to explore a wide search space of function evaluations and to improve the convergence score towards the true Pareto optimal front. To evaluate the effectiveness of the MmGA-based decision support tool, a multi-objective job-shop scheduling problem with actual information from a manufacturing company is deployed. The statistical bootstrap method is used to evaluate the experimental results, and compared with those from the enumeration method. The outcome indicates that the decision support tool is able to achieve those optimal solutions as generated by the enumeration method. In addition, the proposed decision support tool has advantage of achieving the results within a fraction of the time.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The Kidney Exchange Problem (KEP) is an optimisation problem that was first discussed in Rapaport (1986) but has only more recently been the subject of much work by combinatorial optimisation re-searchers. This has been in parallel with its increased prevalence in the medical community. In the basic formulation of a KEP, each instance of the problem features a directed graph D = (V,A) . Each node i ∈ V represents an incompatible pair wherein the patient needs to trade kidneys with the patient of another incompatible pair. The goal is to find an optimal set of cycles such that as many patients as possible receive a transplant. The problem is further complicated by the imposition of a cycle-size constraint, usually considered to be 3 or 4. Kidney exchange programs around the world implement different algorithms to solve the allocation problem by matching up kidneys from potential donors to patients. In some systems all transplants are considered equally desirable, whereas in others, ranking criteria such as the age of the patient or distance they will need to travel are applied, hence the multi-criteria nature of the KEP. To address the multi-criteria aspect of the KEP, in this paper we propose a two-stage approach for the kidney exchange optimisation problem. In the first stage the goal is to find the optimal number of exchanges, and in the second stage the goal is to maximise the weighted sum of the kidney matches, subject to the added constraint that the number of exchanges must remain optimal. The idea can potentially be extended to multiple-objectives, by repeating the process in multiple runs. In our preliminary numerical experiments, we first find the maximum number of kidney matches by using an existing open source exact algorithm of Anderson et al. (2015). The solution will then be used as an initial solution for the stage two optimisation problem, wherein two heuristic methods, steepest ascent and random ascent, are implemented in obtaining good quality solutions to the objective of maximizing total weight of exchanges. The neighbourhood is obtained by two-swaps. It is our intention in the future to implement a varying neighbourhood scheme within the same two heuristic framework, or within other meta-heuristic framework.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The practice of solely relying on the human resources department in the selection process of external training providers has cast doubts and mistrust across other departments as to how trainers are sourced. There are no measurable criteria used by human resource personnel, since most decisions are based on intuitive experience and subjective market knowledge. The present problem focuses on outsourcing of private training programs that are partly government funded, which has been facing accountability challenges. Due to the unavailability of a scientific decision-making approach in this context, a 12-step algorithm is proposed and tested in a Japanese multinational company. The model allows the decision makers to revise their criteria expectations, in turn witnessing the change of the training providers' quota distribution. Finally, this multi-objective sensitivity analysis provides a forward-looking approach to training needs planning and aids decision makers in their sourcing strategy.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, a multi-objective image segmentation approach with an Interactive Evolutionary Computation (IEC)-based framework is presented. Two objectives, i.e., the overall deviation and the connectivity measure, are optimized simultaneously using a mu

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The forecasting behavior of the high volatile and unpredictable wind power energy has always been a challenging issue in the power engineering area. In this regard, this paper proposes a new multi-objective framework based on fuzzy idea to construct optimal prediction intervals (Pis) to forecast wind power generation more sufficiently. The proposed method makes it possible to satisfy both the PI coverage probability (PICP) and PI normalized average width (PINAW), simultaneously. In order to model the stochastic and nonlinear behavior of the wind power samples, the idea of lower upper bound estimation (LUBE) method is used here. Regarding the optimization tool, an improved version of particle swam optimization (PSO) is proposed. In order to see the feasibility and satisfying performance of the proposed method, the practical data of a wind farm in Australia is used as the case study.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Multi-objective traveling salesman problem (MOTSP) is an important field in operations research, which has wide applications in the real world. Multi-objective ant colony optimization (MOACO) as one of the most effective algorithms has gained popularity for solving a MOTSP. However, there exists the problem of premature convergence in most of MOACO algorithms. With this observation in mind, an improved multiobjective network ant colony optimization, denoted as PMMONACO, is proposed, which employs the unique feature of critical tubes reserved in the network evolution process of the Physarum-inspired mathematical model (PMM). By considering both pheromones deposited by ants and flowing in the Physarum network, PM-MONACO uses an optimized pheromone matrix updating strategy. Experimental results in benchmark networks show that PM-MONACO can achieve a better compromise solution than the original MOACO algorithm for solving MOTSPs.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Since asset returns have been recognized as not normally distributed, the avenue of research regarding portfolio higher moments soon emerged. To account for uncertainty and vagueness of portfolio returns as well as of higher moment risks, we proposed a new portfolio selection model employing fuzzy sets in this paper. A fuzzy multi-objective linear programming (MOLP) for portfolio optimization is formulated using marginal impacts of assets on portfolio higher moments, which are modelled by trapezoidal fuzzy numbers. Through a consistent centroid-based ranking of fuzzy numbers, the fuzzy MOLP is transformed into an MOLP that is then solved by the maximin method. By taking portfolio higher moments into account, the approach enables investors to optimize not only the normal risk (variance) but also the asymmetric risk (skewness) and the risk of fat-tails (kurtosis). An illustrative example demonstrates the efficiency of the proposed methodology comparing to previous portfolio optimization models.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Software Defined Networking (SDN) and Internet of Things (IoT) integration has thrown many critical challenges. Specifically, in heterogeneous SDN-IoT ecosystem, optimized resources utilization and effective management at the control layer is very difficult. This mainly affects the application specific Quality of Service (QoS) and energy consumption of the IoT network. Motivated from this, we propose a new Resource Management (RM) method at the control layer, in distributed SDN-IoT networks. This paper starts with reasons that why at control layer RM is more complex in the SDN-IoT ecosystem. After-that, we highlight motivated examples that necessitate to investigate new RM methods in SDN-IoT context. Further, we propose a novel method to compute controller performance. Theoretical analysis is conducted to prove that the proposed method is better than the existing methods.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A neurogenetic-based hybrid framework is developed where the main components within the framework are artificial neural networks (ANNs) and genetic algorithms (GAs). The investigation covers a mode of combination or hybridisation between the two components that is called task hybridisation. The combination between ANNs and GAs using task hybridisation leads to the development of a hybrid multilayer feedforward network, trained using supervised learning. This paper discusses the GA method used to optimize the process parameters, using the ANN developed as the process mode, in a solder paste printing process, which is part of the process in the surface mount technology (SMT) method. The results obtained showed that the GA-based optimization method works well under various optimization criteria

Relevância:

90.00% 90.00%

Publicador:

Resumo:

Compression ignition (CI) engine design is subject to many constraints which presents a multi-criteria optimisation problem that the engine researcher must solve. In particular, the modern CI engine must not only be efficient, but must also deliver low gaseous, particulate and life cycle greenhouse gas emissions so that its impact on urban air quality, human health, and global warming are minimised. Consequently, this study undertakes a multi-criteria analysis which seeks to identify alternative fuels, injection technologies and combustion strategies that could potentially satisfy these CI engine design constraints. Three datasets are analysed with the Preference Ranking Organization Method for Enrichment Evaluations and Geometrical Analysis for Interactive Aid (PROMETHEE-GAIA) algorithm to explore the impact of 1): an ethanol fumigation system, 2): alternative fuels (20 % biodiesel and synthetic diesel) and alternative injection technologies (mechanical direct injection and common rail injection), and 3): various biodiesel fuels made from 3 feedstocks (i.e. soy, tallow, and canola) tested at several blend percentages (20-100 %) on the resulting emissions and efficiency profile of the various test engines. The results show that moderate ethanol substitutions (~20 % by energy) at moderate load, high percentage soy blends (60-100 %), and alternative fuels (biodiesel and synthetic diesel) provide an efficiency and emissions profile that yields the most “preferred” solutions to this multi-criteria engine design problem. Further research is, however, required to reduce Reactive Oxygen Species (ROS) emissions with alternative fuels, and to deliver technologies that do not significantly reduce the median diameter of particle emissions.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

Recently, much attention has been given to the mass spectrometry (MS) technology based disease classification, diagnosis, and protein-based biomarker identification. Similar to microarray based investigation, proteomic data generated by such kind of high-throughput experiments are often with high feature-to-sample ratio. Moreover, biological information and pattern are compounded with data noise, redundancy and outliers. Thus, the development of algorithms and procedures for the analysis and interpretation of such kind of data is of paramount importance. In this paper, we propose a hybrid system for analyzing such high dimensional data. The proposed method uses the k-mean clustering algorithm based feature extraction and selection procedure to bridge the filter selection and wrapper selection methods. The potential informative mass/charge (m/z) markers selected by filters are subject to the k-mean clustering algorithm for correlation and redundancy reduction, and a multi-objective Genetic Algorithm selector is then employed to identify discriminative m/z markers generated by k-mean clustering algorithm. Experimental results obtained by using the proposed method indicate that it is suitable for m/z biomarker selection and MS based sample classification.