14,870 research outputs found
Incremental multiple objective genetic algorithms
This paper presents a new genetic algorithm approach to multi-objective optimization problemsIncremental Multiple Objective Genetic Algorithms (IMOGA). Different from conventional MOGA methods, it takes each objective into consideration incrementally. The whole evolution is divided into as many phases as the number of objectives, and one more objective is considered in each phase. Each phase is composed of two stages: first, an independent population is evolved to optimize one specific objective; second, the better-performing individuals from the evolved single-objective population and the multi-objective population evolved in the last phase are joined together by the operation of integration. The resulting population then becomes an initial multi-objective population, to which a multi-objective evolution based on the incremented objective set is applied. The experiment results show that, in most problems, the performance of IMOGA is better than that of three other MOGAs, NSGA-II, SPEA and PAES. IMOGA can find more solutions during the same time span, and the quality of solutions is better
MULTIPLE-OBJECTIVE DECISION MAKING FOR AGROECOSYSTEM MANAGEMENT
Multiple-objective decision making (MODEM) provides an effective framework for integrated resource assessment of agroecosystems. Two elements of integrated assessment are discussed and illustrated: (1) adding noneconomic objectives as constraints in an optimization problem; and (2) evaluating tradeoffs among competing objectives using the efficiency frontier for objectives. These elements are illustrated for a crop farm and watershed in northern Missouri. An interactive, spatial decision support system (ISDSS) makes the MODEM framework accessible to unsophisticated users. A conceptual ISDSS is presented that assesses the socioeconomic, environmental, and ecological consequences of alternative management plans for reducing soil erosion and nonpoint source pollution in agroecosystems. A watershed decision support system based on the ISDSS is discussed.Agribusiness,
Recommended from our members
Evolving dynamic multiple-objective optimization problems with objective replacement
This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives may be replaced with new objectives during evolution. It is shown that the Pareto-optimal sets before and after the objective replacement share some common members. Based on this observation, we suggest the inheritance strategy. When objective replacement occurs, this strategy selects good chromosomes according to the new objective set from the solutions found before objective replacement, and then continues to optimize them via evolution for the new objective set. The experiment results showed that this strategy can help MOGAs achieve better performance than MOGAs without using the inheritance strategy, where the evolution is restarted when objective replacement occurs. More solutions with better quality are found during the same time span
Optimizing a multiple objective surgical case scheduling problem.
The scheduling of the operating theater on a daily base is a complicated task and is mainly based on the experience of the human planner. This, however, does not mean that this task can be seen as unimportant since the schedule of individual surgeries influences a medical department as a whole. Based on practical suggestions of the planner and on real-life constraints, we will formulate a multiple objective optimization model in order to facilitate this decision process. We will show that this optimization problem is NP-hard and hence hard to solve. Both exact and heuristic algorithms, based on integer programming and on implicit enumeration (branch-and-bound), will be introduced. These solution approaches will be thoroughly tested on a realistic test set using data of the surgical day-care center at the university hospital Gasthuisberg in Leuven (Belgium). Finally, results will be analyzed and conclusions will be formulated.Algorithms; Belgium; Branch-and-bound; Constraint; Data; Decision; Experience; Healthcare; Heuristic; Integer; Integer programming; Model; Optimization; Order; Processes; Real life; Scheduling; University;
Multiple Objective Programming Support
This paper gives a brief introduction into multiple objective programming support. We will overview basic concepts, formulations, and principles of solving multiple programming problems.To solve those problems requires the the intervention of a decision-maker. That's why behavioral assumptions play an important role in multiple objective programming. Which assumptions are made affects which kindof support is given to adecision maker. We will demonstrate how a free search type approach can be used to solve multiple objective programming problems
Speeding up Martins' algorithm for multiple objective shortest path problems
The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time. The label setting algorithm of Martins efficiently finds this set of Pareto optimal paths, but sometimes tends to be slow, especially for large networks such as transportation networks. In this article we investigate a number of speedup measures, resulting in new algorithms. It is shown that the calculation time to find the Pareto optimal set can be reduced considerably. Moreover, it is mathematically proven that these algorithms still produce the Pareto optimal set of paths
- …