Models for Improved Effectiveness Based on Dea Efficiency Results

Golany, Boaz; Phillips, Fred; Rousseau, John J.

doi:10.1080/07408179308964322

Cited by 94 publications

(38 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since the conventional DEA models do not take into account the aggregate input consumption, it is necessary to use enhanced models that handle all DMUs jointly in order to reallocate limited organisational resources among several DMUs. Examples of DEA models that can be used to implement different centralised resource allocation strategies can be found in Beasley (2003), Korhonen and Syrjänen (2004), Golany et al (1993), Golany and Tamir (1995), Athanassopoulos (1995Athanassopoulos ( , 1998, Lozano and Villa (2004).…”

Section: Dea-based Resource Allocation Approachesmentioning

confidence: 99%

The assessment of retailing efficiency using Network Data Envelopment Analysis

2008

View full text Add to dashboard Cite

EURO 24 -Lisbon 2010Traveling salesperson problem (TSP) instances encountered in real-world logistics operations are often sparse and asymmetric, and of large size. The literature on tabu search heuristics for the traveling salesman problem primarily deals with relatively small symmetric TSPs defined on complete graphs. In this paper, we provide data structures which speed up the performance of tabu search on large sparse asymmetric TSPs. We show that the speed up using our data strucures is significant, and allows us to use tabu search on much larger instances than those reported in the literature. -A new greedy approach to the Quadratic Assignment Problem (QAP)Theodoros Gevezes, Mathematical and Physical Sciences, Aristotle University of Thessaloniki, 51124, Thessaloniki, Greece, theogev@gen.auth.grA new greedy approach is presented for the QAP, where instead of building a solution starting from an empty set, a feasible solution is reached gradually by deleting the worst elements. In order to implement this greedy approach, a set of necessary and sufficient conditions for a zero-one matrix to be a solution of the QAP is proved, while the verification of these conditions requires the solution of linear assignment problem with additional constraints. The new greedy approach has been incorporated in a Greedy Randomized Adaptive Search Procedure (GRASP) with favorable computational results. -A new heuristic for the minimization of tool switches problemEdson Senne, Mathematics, UNESP/FEG, Caixa Postal 205, 12516-410, Guaratingueta, SP, Brazil, elfsenne@feg.unesp.br, Antonio Chaves, Horacio YanasseThe minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. This work presents a new heuristic for the MTSP. This heuristic has a constructive phase, which is based on a graph where the vertices correspond the tools and exists an arc k=(i,j) binding vertices i and j if tools i and j are necessary for the execution of task k, and an improved phase based on the Iterated Local Search. Computational results show that the proposed heuristic has better performance than other methods from the literature. UMTS is the Third Generation mobile telecoms networks which will bring video, music and internet services to the cell phone and a range of electronic products. This paper deals with the implementation of the UMTS services in the existing GSM900 bandwidth. It focuses on the issue of spectrum and capacity reduction in UMTS900 deployment area and buffer area, which can be seen as an optimization problem, where the decision variable is the number of transmitters that assure an acceptable QoS of the GSM service. An efficient tabu search method is proposed to solve this problem. The point coverage, sink location, and data routing problems are considered within a unified frame and two integrated mixed-integer linear programming formulations are developed. They are difficult to solve and a hybrid procedure is proposed. The best sensor locations are ...

show abstract

Section: Dea-based Resource Allocation Approachesmentioning

confidence: 99%

The assessment of retailing efficiency using Network Data Envelopment Analysis

2008

View full text Add to dashboard Cite

show abstract

“…Um procedimento em cinco etapas para a alocação de inputs é apresentado por Golany et al (1993 Para o caso de input único, Thanassoulis (1996) propõe um modelo de programação inteira mista, que agrupa as unidades em conjuntos e determina um nível marginal de recursos. Este fator é usado pelos decisores para alocar o recurso.…”

Section: Estado Da Arteunclassified

Algoritmo de alocação de recursos discretos com análise de envoltória de dados

et al. 2006

View full text Add to dashboard Cite

ResumoA alocação de recursos é um dos problemas clássicos abordados pela Pesquisa Operacional. A inserção de modelos de Análise de Envoltória de Dados (DEA) nesse contexto traz novas possibilidades de estudo, em especial quando combinada com o uso de algoritmos de programação inteira. Este artigo apresenta um algoritmo para distribuição de recursos discretos usando modelos DEA de forma seqüencial. O método proposto é aplicado no estudo de caso da alocação de vagas docentes na Universidade Federal Fluminense. Os resultados são comparados com aqueles obtidos pela comissão encarregada da distribuição das vagas.Palavras-chave: DEA; alocação de recursos; algoritmo seqüencial. AbstractThe resource allocation is one of the main problems in Operational Research. The use of Data Envelopment Analysis (DEA) in this field is a new feature with a great potential, mainly when combined with integer programming problems. This paper presents an algorithm to allocate integer resources using a step-by-step DEA algorithm. We applied the proposed approach to a real case study, which consists in allocating teacher positions in some departments of Universidade Federal Fluminense. We compare the results with those obtained by the official commission.

show abstract

“…Many practical studies have used non-oriented measures; for example, Colwell and Davis [27] used an intermediation approach that speci ed inputs in the form of costs and outputs in the form of revenue. Finding the closest target has been considered for both oriented models (see the following examples: [28][29][30]) and non-oriented models (see the following examples: [31][32][33][34][35]). The only question that most DEA studies focus on is \how is a company ine cient?…”

Section: Introductionmentioning

confidence: 99%

Finding an improved region of efficiency via DEA-efficient hyperplanes

et al. 2017

View full text Add to dashboard Cite

Abstract. The analysis of e ciency is conducted for two vital purposes: rstly, in order to evaluate the current level of e ciency; secondly, to provide information on how to improve the level of e ciency, which is to provide benchmarking information. The ine cient Decision Making Units (DMUs) are usually able to improve their performance, and Data Envelopment Analysis (DEA) projections provide a prescription for improvement. However, sometimes, an ine cient DMU cannot move its performance toward the best practice by either decreasing its inputs or increasing its outputs. On the other hand, it can scarcely reach its e cient benchmark. This research suggests a method to nd an improved region of e ciency through DEA-e cient hyperplanes by providing an algorithm for detecting an improved e ciency path. In addition to the production of reasonable benchmarking information, the proposed algorithm provides the general requirements that satisfy the demands which every professional decision-maker should meet. Finally, we provide a more detailed description of some new issues, extending the insights from this analysis of the benchmark region from the under-evaluated ine cient DMU. Finally, numerical examples are provided to demonstrate the results of the analysis.

show abstract

Models for Improved Effectiveness Based on Dea Efficiency Results

Cited by 94 publications

References 5 publications

The assessment of retailing efficiency using Network Data Envelopment Analysis

The assessment of retailing efficiency using Network Data Envelopment Analysis

Algoritmo de alocação de recursos discretos com análise de envoltória de dados

Finding an improved region of efficiency via DEA-efficient hyperplanes

Contact Info

Product

Resources

About