This paper deals with the evaluation of Decision Making Units (DMU) when their number is not large enough to allow the use of classic Data Envelopment Analysis (DEA) models. To do so, we take advantage of the TRIMAP software when used to study the Li and Reeves MultiCriteria DEA (MCDEA) model. We introduce an evaluation measure obtained with the integration of one of the objective functions along the weight spa...
http://www.sciencedirect.com/science/article/B6VC5-4VBDKNX-1/2/b7e59602a9fb4eb885f498b0d8c779cc
A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allocation hub locati...
The most efficient algorithms for solving the single-criterion 0,1-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria 0-1-knapsack instances. Numerical experiments were performed on five typ...
This paper presents a multiobjective linear integer programming model for supporting the choice of remote load control strategies in electric distribution network management. The model takes into account the main concerns in load management, considering three objective functions: minimization of the peak demand as perceived by the distribution network dispatch center, maximization of the utility profit associat...
Abstract In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This problem i...
Abstract This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, closed a...
Abstract MPLS (Multiprotocol Label Switching) enables the utilisation of explicit routes and other advanced routing mechanisms in multiservice packet networks, capable of dealing with multiple and heterogeneous QoS (Quality of Service) parameters. Firstly the paper presents a discussion of conceptual and methodological issues raised by multiobjective routing optimisation models for MPLS networks. The major con...
This paper describes a study on the application of an algorithm to rank the K-quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types of random generated networks. To simulate values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely ...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |