Search results for "Strategy"
showing 10 items of 2256 documents
Incorporating preference information in interactive reference point methods for multiobjective optimization
2009
In this paper, we introduce new ways of utilizing preference information specified by the decision maker in interactive reference point based methods. A reference point consists of desirable values for each objective function. The idea is to take the desires of the decision maker into account more closely when projecting the reference point onto the set of nondominated solutions. In this way we can support the decision maker in finding the most satisfactory solutions faster. In practice, we adjust the weights in the achievement scalarizing function that projects the reference point. We identify different cases depending on the amount of additional information available and demonstrate the c…
Prospect theory and stochastic multicriteria acceptability analysis (SMAA)
2009
Abstract We consider problems where multiple decision makers (DMs) want to choose their most preferred alternative from a finite set based on multiple criteria. Several approaches to support DMs in such problems have been suggested. Prospect theory has appealed to researchers through its descriptive power, but rare attempts have been made to apply it to support multicriteria decision making. The basic idea of prospect theory is that alternatives are evaluated by a difference function in terms of gains and losses with respect to a reference point. The function is suggested to be concave for gains and convex for losses and steeper for losses than for gains. Stochastic multicriteria acceptabil…
Improving Performance of Evolutionary Algorithms with Application to Fuzzy Control of Truck Backer-Upper System
2013
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/709027 Open access We propose a method to improve the performance of evolutionary algorithms (EA). The proposed approach defines operators which can modify the performance of EA, including Levy distribution function as a strategy parameters adaptation, calculating mean point for finding proper region of breeding offspring, and shifting strategy parameters to change the sequence of these parameters. Thereafter, a set of benchmark cost functions is utilized to compare the results of the proposed method with some other well-known algorithms.…
An improved sampling strategy based on trajectory design for application of the Morris method to systems with many input factors
2012
[EN] In this paper, a revised version of the Morris approach, which includes an improved sampling strategy based on trajectory design, has been adapted to the screening of the most influential parameters of a fuzzy controller applied to WWTPs. Due to the high number of parameters, a systematic approach has been proposed to apply this improved sampling strategy with low computational demand. In order to find out the proper repetition number of elementary effects of each input factor on model output (EEi) calculations, an iterative and automatic procedure has been applied. The results show that the sampling strategy has a significant effect on the parameter significance ranking and that rando…
Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts
2015
Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…
An Island Strategy for Memetic Discrete Tomography Reconstruction
2014
In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …
Solutions for districting problems with chance-constrained balancing requirements
2021
Abstract In this paper, a districting problem with stochastic demands is investigated. The goal is to divide a geographic area into p contiguous districts such that, with some given probability, the districts are balanced with respect to some given lower and upper thresholds. The problem is cast as a p -median problem with contiguity constraints that is further enhanced with chance-constrained balancing requirements. The total assignment cost of the territorial units to the representatives of the corresponding districts is used as a surrogate compactness measure to be optimized. Due to the tantalizing purpose of deriving a deterministic equivalent for the problem, a two-phase heuristic is d…
The distributed assembly permutation flowshop scheduling problem
2013
Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The o…
Greedy versus Dynamic Channel Aggregation Strategy in CRNs: Markov Models and Performance Evaluation
2011
Part 1: - PE-CRN 2011 Workshop; International audience; In cognitive radio networks, channel aggregation techniques which aggregate several channels together as one channel have been proposed in many MAC protocols. In this paper, we consider elastic data traffic and spectrum adaptation for channel aggregation, and propose two new strategies named as Greedy and Dynamic respectively. The performance of channel aggregation represented by these strategies is evaluated using continuous time Markov chain models. Moreover, simulation results based on various traffic distributions are utilized in order to evaluate the validity and preciseness of the mathematical models.
Non-dominated “trade-off” solutions in television scheduling optimization
2014
The main approaches for the television scheduling design are commonly based on the ratings or revenues maximization objective, and thus, only a single optimal solution can be obtained, corresponding to the best result for the considered objective. Therefore, these approaches lead up to the alternative solutions loss which, even if less effective from the ratings or revenues maximization viewpoint, may be more suitable for the decision maker because of better compromise in relation to factors influencing the decision process. Specifically, such a compromise could be achieved through a suitable “trade-off” between these factors, with reference to the decision context in which the decision mak…