Data Envelopment Analysis with metaheuristics
|
|
- Justina Willis
- 5 years ago
- Views:
Transcription
1 Data Envelopment Analysis with metaheuristics Juan Aparicio 1 Domingo Giménez 2 José J. López-Espín 1 Jesús T. Pastor 1 1 Miguel Hernández University, 2 University of Murcia ICCS, Cairns, June 10, 2014 Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
2 Outline 1 Introduction to DEA 2 Mix model of mathematical lineal programming 3 Metaheuristic Methods for Determining Closest Targets Experimental results 4 Conclusions and future works Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
3 Introduction to DEA DEA (Data Envelopment Analysis) is a non-parametric technique to estimate the current level of efficiency of a set of entities. DEA also provides information on how to remove inefficiency through the determination of benchmarking information. Objective: Study DEA models based on closest to efficient targets, which are related to the shortest projection to the production frontier. Problem: Usually, these models have been solved with unsatisfactory methods since all of them are related in some sense to a combinatorial NP-hard problem. Possible solution: Metaheuristic algorithms. Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
4 Object agent for the measure: DMU (Decision Making Unit). Each DMU j consumes m inputs, denoted as (x 1j,..., x mj ), to produce s outputs, denoted as (y 1j,..., y sj ). As usual, it is assumed that all DMUs operate in the same technological environment. Objetive: The estimation of the production frontier and the technical efficiency of each DMU (the distance from each interior DMU to the boundary of the technology). Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
5 Mix model of mathematical lineal programming (Aparicio et al., 2007) t ik x ik max β k 1 m m i=1 s.t. β k + 1 s t + rk s r=1 = 1 (c.1) y rk β k x ik + n j=1 α jkx ij + t ik = 0 i (c.2) β k y rk + n j=1 α jky rj t + rk = 0 r (c.3) m i=1 ν ikx ij + s r=1 µ rky rj + d jk = 0 j (c.4) It must be solved n times, one for each DMU. ν ik 1 i (c.5) µ rk 1 r (c.6) d jk Mb jk j (c.7) α jk M(1 b jk ) j (c.8) b jk = 0, 1 (c.9) β k 0 (c.10) t ik 0 i (c.11) t + rk 0 r (c.12) d jk 0 j (c.13) α jk 0 j (c.14) Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
6 We focus on some constraints: t ik x ik max β k 1 m m i=1 s.t. β k + 1 s t + rk s r=1 = 1 (c.1) y rk β k x ik + n j=1 α jkx ij + t ik = 0 i (c.2) β k y rk + n j=1 α jky rj t + rk = 0 r (c.3) m i=1 ν ikx ij + s r=1 µ rky rj + d jk = 0 j (c.4) ν ik 1 i (c.5) µ rk 1 r (c.6) d jk Mb jk j (c.7) α jk M(1 b jk ) j (c.8) It must be solved n times, one for each DMU. b jk = 0, 1 (c.9) β k 0 (c.10) t ik 0 i (c.11) t + rk 0 r (c.12) d jk 0 j (c.13) α jk 0 j (c.14) Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
7 Metaheuristic Methods for Determining Closest Targets Defining a Valid Solution: A solution is represented by a vector of real and binary values. Binary part: b 0k... b jk Real part: β k α 0k... α jk t 0k... t ik t + 0k... t + rk A valid chromosome satisfies the constraints (c.1, c.2, c.3, c.8, c.9, c.10, c.11, c.12, c14). Score: Value returned by the objective function. β k 1 m m t ik x ik i=1 Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
8 Initialization Methods: Method 1. Random. Generate randomly b, β, α, t + rk and t ik Method 2. Heuristic. βk is randomly generated. α jk are generated randomly in different ranges depending on X and Y. FOR j := 1,..., n IF X k high AND Y k low α jk 0 IF X k low AND Y k high α jk Generate randomly 0.5 α jk 1 IF (X k low AND Y k low) OR (X k high AND Y k high) α jk Generate randomly 0 α jk 0.25 t + rk and t ik are deduced from (c.2) and (c.3). Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
9 Method 3. Heuristic with local search. An extension of method 2 with an adjustment process for α jk. First, obtain βk, t 1k,...,t mk, t+ 1k,...,t+ sk, α 1k,...,α nk and b 1k,...,b nk as in Method 2. After that, adjust βk and α 1k,...,α nk : repeat while 1 i n and 1 r s such as t ik 0 or t+ rk 0 and the number of α jk 0 2 do if t ik 0 and t+ rk 0 then Increase β k end if if t ik 0 and t+ rk 0 then Decrease β k end if if t ik 0 or t+ rk 0 then Choose α jk no null randomly and make it equal to zero, decreasing the rest α jk in p and find the minimum α jk and modify its value in order to satisfy restrictions end if end while until a valid solution is obtained or Iterations MaxIter or the number of α jk no null is lower than 2 Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
10 Method 4. Distributed metaheuristic. A genetic algorithm is used to produce valid solutions of the problem. The chromosomes are sets of α jk and β k which satisfy c.1, c.2, c.3, c.8, c.9, c.10 and c.14. The evaluation function is the sum of t + rk and t ik, and the solution with the highest score gives the best candidate. Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
11 Experimental results Two objectives are pursued: To compare the effectiveness of the four methods proposed, studying the execution cost and the percentage of valid solutions. To study how the percentage of valid solutions decreases when the size of the problem increases. Comparison of the percentage of valid solutions with each generation method: Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
12 Execution cost and percentage of valid solutions when the four methods of initiation are used, varying the problem size: size Method 1 Method 2 m n s time % val. time % val size Method 3 Method 4 m n s time % val. time % val , Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
13 Conclusions The application of heuristic and metaheuristic methods to obtain solutions for a mathematical programming model for Data Envelopment Analysis is studied. It is a first step to approximate the solution of the optimization problem. Four different methods to generate the sets of solutions were tested. The heuristic method with local search gives the best results. Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
14 Future works Roadmap: Increment the number of valid solutions with hybrid metaheuristics: combination of local search with distributed metaheuristics. Analyze the application of other metaheuristics, and hyperheuristics on top of them. Inclusion of the methods in metaheuristics for the optimization problem with a reduced number of restrictions. Extend the methodology to include the remaining restriction. Aparicio, Giménez, López-Espín, Pastor () DEA with metaheuristics ICCS, Cairns, June 10, / 14
Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis
Using Genetic Algorithms for Maximizing Technical Efficiency in Data Envelopment Analysis Juan Aparicio 1 Domingo Giménez 2 Martín González 1 José J. López-Espín 1 Jesús T. Pastor 1 1 Miguel Hernández
More informationParametrized Genetic Algorithms for NP-hard problems on Data Envelopment Analysis
Parametrized Genetic Algorithms for NP-hard problems on Data Envelopment Analysis Juan Aparicio 1 Domingo Giménez 2 Martín González 1 José J. López-Espín 1 Jesús T. Pastor 1 1 Miguel Hernández University,
More informationObtaining simultaneous equation models from a set of variables through genetic algorithms
Obtaining simultaneous equation models from a set of variables through genetic algorithms José J. López Universidad Miguel Hernández (Elche, Spain) Domingo Giménez Universidad de Murcia (Murcia, Spain)
More informationInvestigación Operativa. New Centralized Resource Allocation DEA Models under Constant Returns to Scale 1
Boletín de Estadística e Investigación Operativa Vol. 28, No. 2, Junio 2012, pp. 110-130 Investigación Operativa New Centralized Resource Allocation DEA Models under Constant Returns to Scale 1 Juan Aparicio,
More informationINEFFICIENCY EVALUATION WITH AN ADDITIVE DEA MODEL UNDER IMPRECISE DATA, AN APPLICATION ON IAUK DEPARTMENTS
Journal of the Operations Research Society of Japan 2007, Vol. 50, No. 3, 163-177 INEFFICIENCY EVALUATION WITH AN ADDITIVE DEA MODEL UNDER IMPRECISE DATA, AN APPLICATION ON IAUK DEPARTMENTS Reza Kazemi
More informationSpecial Cases in Linear Programming. H. R. Alvarez A., Ph. D. 1
Special Cases in Linear Programming H. R. Alvarez A., Ph. D. 1 Data Envelopment Analysis Objective To compare technical efficiency of different Decision Making Units (DMU) The comparison is made as a function
More informationFH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs
FH2(P 2,P2) hybrid flow shop scheduling with recirculation of jobs Nadjat Meziani 1 and Mourad Boudhar 2 1 University of Abderrahmane Mira Bejaia, Algeria 2 USTHB University Algiers, Algeria ro nadjet07@yahoo.fr
More informationNeville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method
Neville s Method MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have learned how to approximate a function using Lagrange polynomials and how to estimate
More informationData Envelopment Analysis and its aplications
Data Envelopment Analysis and its aplications VŠB-Technical University of Ostrava Czech Republic 13. Letní škola aplikované informatiky Bedřichov Content Classic Special - for the example The aim to calculate
More informationPRIORITIZATION METHOD FOR FRONTIER DMUs: A DISTANCE-BASED APPROACH
PRIORITIZATION METHOD FOR FRONTIER DMUs: A DISTANCE-BASED APPROACH ALIREZA AMIRTEIMOORI, GHOLAMREZA JAHANSHAHLOO, AND SOHRAB KORDROSTAMI Received 7 October 2003 and in revised form 27 May 2004 In nonparametric
More informationPRINCIPAL COMPONENT ANALYSIS TO RANKING TECHNICAL EFFICIENCIES THROUGH STOCHASTIC FRONTIER ANALYSIS AND DEA
PRINCIPAL COMPONENT ANALYSIS TO RANKING TECHNICAL EFFICIENCIES THROUGH STOCHASTIC FRONTIER ANALYSIS AND DEA Sergio SCIPPACERCOLA Associate Professor, Department of Economics, Management, Institutions University
More informationFinding the strong defining hyperplanes of production possibility set with constant returns to scale using the linear independent vectors
Rafati-Maleki et al., Cogent Mathematics & Statistics (28), 5: 447222 https://doi.org/.8/233835.28.447222 APPLIED & INTERDISCIPLINARY MATHEMATICS RESEARCH ARTICLE Finding the strong defining hyperplanes
More informationChance Constrained Data Envelopment Analysis The Productive Efficiency of Units with Stochastic Outputs
Chance Constrained Data Envelopment Analysis The Productive Efficiency of Units with Stochastic Outputs Michal Houda Department of Applied Mathematics and Informatics ROBUST 2016, September 11 16, 2016
More informationSymmetric Error Structure in Stochastic DEA
Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 4, No. 4, Year 2012 Article ID IJIM-00191, 9 pages Research Article Symmetric Error Structure in Stochastic
More information7.1 Sampling Error The Need for Sampling Distributions
7.1 Sampling Error The Need for Sampling Distributions Tom Lewis Fall Term 2009 Tom Lewis () 7.1 Sampling Error The Need for Sampling Distributions Fall Term 2009 1 / 5 Outline 1 Tom Lewis () 7.1 Sampling
More informationABSTRACT INTRODUCTION
Implementation of A Log-Linear Poisson Regression Model to Estimate the Odds of Being Technically Efficient in DEA Setting: The Case of Hospitals in Oman By Parakramaweera Sunil Dharmapala Dept. of Operations
More informationData envelopment analysis
15 Data envelopment analysis The purpose of data envelopment analysis (DEA) is to compare the operating performance of a set of units such as companies, university departments, hospitals, bank branch offices,
More informationUSING STRATIFICATION DATA ENVELOPMENT ANALYSIS FOR THE MULTI- OBJECTIVE FACILITY LOCATION-ALLOCATION PROBLEMS
USING STRATIFICATION DATA ENVELOPMENT ANALYSIS FOR THE MULTI- OBJECTIVE FACILITY LOCATION-ALLOCATION PROBLEMS Jae-Dong Hong, Industrial Engineering, South Carolina State University, Orangeburg, SC 29117,
More informationSensitivity and Stability Radius in Data Envelopment Analysis
Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics Vol. 1, No. 3 (2009) 227-234 Sensitivity and Stability Radius in Data Envelopment Analysis A. Gholam Abri a, N. Shoja a, M. Fallah
More information3D HP Protein Folding Problem using Ant Algorithm
3D HP Protein Folding Problem using Ant Algorithm Fidanova S. Institute of Parallel Processing BAS 25A Acad. G. Bonchev Str., 1113 Sofia, Bulgaria Phone: +359 2 979 66 42 E-mail: stefka@parallel.bas.bg
More informationA parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times
A parallel metaheuristics for the single machine total weighted tardiness problem with sequence-dependent setup times Wojciech Bożejko Wroc law University of Technology Institute of Computer Engineering,
More informationRank aggregation in cyclic sequences
Rank aggregation in cyclic sequences Javier Alcaraz 1, Eva M. García-Nové 1, Mercedes Landete 1, Juan F. Monge 1, Justo Puerto 1 Department of Statistics, Mathematics and Computer Science, Center of Operations
More informationDetermination of Economic Optimal Strategy for Increment of the Electricity Supply Industry in Iran by DEA
International Mathematical Forum, 2, 2007, no. 64, 3181-3189 Determination of Economic Optimal Strategy for Increment of the Electricity Supply Industry in Iran by DEA KH. Azizi Department of Management,
More informationA MIXED INTEGER QUADRATIC PROGRAMMING MODEL FOR THE LOW AUTOCORRELATION BINARY SEQUENCE PROBLEM. Jozef Kratica
Serdica J. Computing 6 (2012), 385 400 A MIXED INTEGER QUADRATIC PROGRAMMING MODEL FOR THE LOW AUTOCORRELATION BINARY SEQUENCE PROBLEM Jozef Kratica Abstract. In this paper the low autocorrelation binary
More informationGroups performance ranking based on inefficiency sharing
Available online at http://ijim.srbiau.ac.ir/ Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 5, No. 4, 2013 Article ID IJIM-00350, 9 pages Research Article Groups performance ranking based on inefficiency
More informationRanking Decision Making Units with Negative and Positive Input and Output
Int. J. Research in Industrial Engineering, pp. 69-74 Volume 3, Number 3, 2014 International Journal of Research in Industrial Engineering www.nvlscience.com Ranking Decision Making Units with Negative
More informationExtended Job Shop Scheduling by Object-Oriented. Optimization Technology
Extended Job Shop Scheduling by Object-Oriented Optimization Technology Minoru Kobayashi, Kenji Muramatsu Tokai University Address: 1117 Kitakaname, Hiratsuka, Kanagawa, 259-1292, Japan Telephone: +81-463-58-1211
More informationON MONOCHROMATIC ASCENDING WAVES. Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 13346
INTEGERS: Electronic Journal of Combinatorial Number Theory 7(), #A3 ON MONOCHROMATIC ASCENDING WAVES Tim LeSaulnier 1 and Aaron Robertson Department of Mathematics, Colgate University, Hamilton, NY 1336
More informationAN IMPROVED APPROACH FOR MEASUREMENT EFFICIENCY OF DEA AND ITS STABILITY USING LOCAL VARIATIONS
Bulletin of Mathematics Vol. 05, No. 01 (2013), pp. 27 42. AN IMPROVED APPROACH FOR MEASUREMENT EFFICIENCY OF DEA AND ITS STABILITY USING LOCAL VARIATIONS Isnaini Halimah Rambe, M. Romi Syahputra, Herman
More informationA Slacks-base Measure of Super-efficiency for Dea with Negative Data
Australian Journal of Basic and Applied Sciences, 4(12): 6197-6210, 2010 ISSN 1991-8178 A Slacks-base Measure of Super-efficiency for Dea with Negative Data 1 F. Hosseinzadeh Lotfi, 2 A.A. Noora, 3 G.R.
More informationFirefly algorithm in optimization of queueing systems
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 60, No. 2, 2012 DOI: 10.2478/v10175-012-0049-y VARIA Firefly algorithm in optimization of queueing systems J. KWIECIEŃ and B. FILIPOWICZ
More informationA new ILS algorithm for parallel machine scheduling problems
J Intell Manuf (2006) 17:609 619 DOI 10.1007/s10845-006-0032-2 A new ILS algorithm for parallel machine scheduling problems Lixin Tang Jiaxiang Luo Received: April 2005 / Accepted: January 2006 Springer
More informationAuthor Copy. A modified super-efficiency DEA model for infeasibility. WD Cook 1,LLiang 2,YZha 2 and J Zhu 3
Journal of the Operational Research Society (2009) 60, 276 --281 2009 Operational Research Society Ltd. All rights reserved. 0160-5682/09 www.palgrave-journals.com/jors/ A modified super-efficiency DEA
More informationA Data Envelopment Analysis Based Approach for Target Setting and Resource Allocation: Application in Gas Companies
A Data Envelopment Analysis Based Approach for Target Setting and Resource Allocation: Application in Gas Companies Azam Mottaghi, Ali Ebrahimnejad, Reza Ezzati and Esmail Khorram Keywords: power. Abstract
More informationRestarting a Genetic Algorithm for Set Cover Problem Using Schnabel Census
Restarting a Genetic Algorithm for Set Cover Problem Using Schnabel Census Anton V. Eremeev 1,2 1 Dostoevsky Omsk State University, Omsk, Russia 2 The Institute of Scientific Information for Social Sciences
More informationSensitive Ant Model for Combinatorial Optimization
Sensitive Ant Model for Combinatorial Optimization CAMELIA CHIRA cchira@cs.ubbcluj.ro D. DUMITRESCU ddumitr@cs.ubbcluj.ro CAMELIA-MIHAELA PINTEA cmpintea@cs.ubbcluj.ro Abstract: A combinatorial optimization
More informationRecognizing single-peaked preferences on aggregated choice data
Recognizing single-peaked preferences on aggregated choice data Smeulders B. KBI_1427 Recognizing Single-Peaked Preferences on Aggregated Choice Data Smeulders, B. Abstract Single-Peaked preferences play
More informationNested Effects Models at Work
21/06/2010 Nested ffects Models at Work Tutorial Session: Network Modelling in Systems Biology with R Prof. Dr. Holger Fröhlich Algorithmic Bioinformatics Bonn-Aachen International Center for Information
More informationA DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING
Journal of the Operations Research Society of Japan 2004, Vol. 47, No. 2, 73-81 2004 The Operations Research Society of Japan A DEA- COMPROMISE PROGRAMMING MODEL FOR COMPREHENSIVE RANKING Akihiro Hashimoto
More informationILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common String Partition
Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 66 (2018) 15 22 www.elsevier.com/locate/endm ILP-Based Reduced Variable Neighborhood Search for Large-Scale Minimum Common
More informationEuropean Journal of Operational Research
European Journal of Operational Research 207 (200) 22 29 Contents lists available at ScienceDirect European Journal of Operational Research journal homepage: www.elsevier.com/locate/ejor Interfaces with
More informationJoint Variable Selection for Data Envelopment Analysis via Group Sparsity
Submitted to Management Science manuscript Joint Variable Selection for Data Envelopment Analysis via Group Sparsity Zhiwei (Tony) Qin Department of Industrial Engineering & Operations Research, Columbia
More informationNovel Models for Obtaining the Closest Weak and Strong Efficient Projections in Data Envelopment Analysis
Bol. Soc. Paran. Mat. (3s.) v. 00 0 (0000):????. c SPM ISSN21751188 on line ISSN00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.41096 Novel Models for Obtaining the Closest Weak and Strong
More informationGENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS
GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS A genetic algorithm is a random search technique for global optimisation in a complex search space. It was originally inspired by an
More informationLarge-Scale 3D En-Route Conflict Resolution
Large-Scale 3D En-Route Conflict Resolution Cyril Allignol, Nicolas Barnier, Nicolas Durand, Alexandre Gondran and Ruixin Wang allignol,barnier,durand,gondran,wangrx @recherche.enac.fr ATM 2017 Seattle
More informationPhylogenetic trees 07/10/13
Phylogenetic trees 07/10/13 A tree is the only figure to occur in On the Origin of Species by Charles Darwin. It is a graphical representation of the evolutionary relationships among entities that share
More informationHybrid Metaheuristics for Crop Rotation
Hybrid Metaheuristics for Crop Rotation Angelo Aliano Filho Doutorando em Matemática Aplicada, IMECC, UNICAMP, 13083-859, Campinas, SP, Brazil Helenice de Oliveira Florentino Departamento de Bioestatística,
More informationSingle Solution-based Metaheuristics
Parallel Cooperative Optimization Research Group Single Solution-based Metaheuristics E-G. Talbi Laboratoire d Informatique Fondamentale de Lille Single solution-based metaheuristics Improvement of a solution.
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationQuadratic Multiple Knapsack Problem with Setups and a Solution Approach
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Quadratic Multiple Knapsack Problem with Setups and a Solution Approach
More informationDeveloping a Data Envelopment Analysis Methodology for Supplier Selection in the Presence of Fuzzy Undesirable Factors
Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 4, No. 3, Year 2012 Article ID IJIM-00225, 10 pages Research Article Developing a Data Envelopment Analysis
More informationA METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA
Journal of the Operations Research Society of Japan 2003, Vol. 46, No. 2, 189-202 2003 The Operations Research Society of Japan A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING
More informationModeling undesirable factors in efficiency evaluation
European Journal of Operational Research142 (2002) 16 20 Continuous Optimization Modeling undesirable factors in efficiency evaluation Lawrence M. Seiford a, Joe Zhu b, * www.elsevier.com/locate/dsw a
More informationSelf-Adaptive Ant Colony System for the Traveling Salesman Problem
Proceedings of the 29 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 29 Self-Adaptive Ant Colony System for the Traveling Salesman Problem Wei-jie Yu, Xiao-min
More informationUsing AHP for Priority Determination in IDEA
Applied Mathematical Sciences, Vol. 5, 2011, no. 61, 3001-3010 Using AHP for Priority Determination in IDEA Gholam Reza Jahanshahloo Department of Mathematics, Science and Research Branch Islamic Azad
More informationMethods for finding optimal configurations
CS 1571 Introduction to AI Lecture 9 Methods for finding optimal configurations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Search for the optimal configuration Optimal configuration search:
More informationIdentifying Efficient Units in Large-Scale Dea Models
Pyry-Antti Siitari Identifying Efficient Units in Large-Scale Dea Models Using Efficient Frontier Approximation W-463 Pyry-Antti Siitari Identifying Efficient Units in Large-Scale Dea Models Using Efficient
More informationClassifying inputs and outputs in data envelopment analysis
European Journal of Operational Research 180 (2007) 692 699 Decision Support Classifying inputs and outputs in data envelopment analysis Wade D. Cook a, *, Joe Zhu b a Department of Management Science,
More informationAn artificial chemical reaction optimization algorithm for. multiple-choice; knapsack problem.
An artificial chemical reaction optimization algorithm for multiple-choice knapsack problem Tung Khac Truong 1,2, Kenli Li 1, Yuming Xu 1, Aijia Ouyang 1, and Xiaoyong Tang 1 1 College of Information Science
More informationUSING LEXICOGRAPHIC PARAMETRIC PROGRAMMING FOR IDENTIFYING EFFICIENT UNITS IN DEA
Pekka J. Korhonen Pyry-Antti Siitari USING LEXICOGRAPHIC PARAMETRIC PROGRAMMING FOR IDENTIFYING EFFICIENT UNITS IN DEA HELSINKI SCHOOL OF ECONOMICS WORKING PAPERS W-381 Pekka J. Korhonen Pyry-Antti Siitari
More informationJoint Use of Factor Analysis (FA) and Data Envelopment Analysis (DEA) for Ranking of Data Envelopment Analysis
Joint Use of Factor Analysis () and Data Envelopment Analysis () for Ranking of Data Envelopment Analysis Reza Nadimi, Fariborz Jolai Abstract This article combines two techniques: data envelopment analysis
More informationComplete Closest-Target Based Directional FDH Measures of Efficiency in DEA
Complete Closest-Target Based Directional FDH Measures of Efficiency in DEA Mahmood Mehdiloozad a,*, Israfil Roshdi b a MSc, Faculty of Mathematical Sciences and Computer, Kharazmi University, Tehran,
More informationGenetic Algorithm approach to Solve Shortest Path and Travelling Salesman Problem
Network Design Using Genetic Algorithm CHAPTER 7 Genetic Algorithm approach to Solve Shortest Path and Travelling Salesman Problem Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other
More informationSelective Measures under Constant and Variable Returns-To- Scale Assumptions
ISBN 978-93-86878-06-9 9th International Conference on Business, Management, Law and Education (BMLE-17) Kuala Lumpur (Malaysia) Dec. 14-15, 2017 Selective Measures under Constant and Variable Returns-To-
More informationReview of ranking methods in the data envelopment analysis context
European Journal of Operational Research 140 (2002) 249 265 www.elsevier.com/locate/dsw Review of ranking methods in the data envelopment analysis context Nicole Adler a, *,1, Lea Friedman b,2, Zilla Sinuany-Stern
More informationMohammad Saidi-Mehrabad a, Samira Bairamzadeh b,*
Journal of Optimization in Industrial Engineering, Vol. 11, Issue 1,Winter and Spring 2018, 3-0 DOI:10.22094/JOIE.2018.272 Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize
More informationAnt Colony Optimization: an introduction. Daniel Chivilikhin
Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Submitted to imanufacturing & Service Operations Management manuscript MSOM-11-370.R3 Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement (Authors names blinded
More informationA DIMENSIONAL DECOMPOSITION APPROACH TO IDENTIFYING EFFICIENT UNITS IN LARGE-SCALE DEA MODELS
Pekka J. Korhonen Pyry-Antti Siitari A DIMENSIONAL DECOMPOSITION APPROACH TO IDENTIFYING EFFICIENT UNITS IN LARGE-SCALE DEA MODELS HELSINKI SCHOOL OF ECONOMICS WORKING PAPERS W-421 Pekka J. Korhonen Pyry-Antti
More informationA Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems
A Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems Mauro Franceschelli Daniele Rosa Carla Seatzu Francesco Bullo Dep of Electrical and Electronic Engineering, Univ of Cagliari, Italy (e-mail:
More informationA Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem Carlos Cotta Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Campus de Teatinos,
More informationA Stochastic-Oriented NLP Relaxation for Integer Programming
A Stochastic-Oriented NLP Relaxation for Integer Programming John Birge University of Chicago (With Mihai Anitescu (ANL/U of C), Cosmin Petra (ANL)) Motivation: The control of energy systems, particularly
More informationA New Method for Optimization of Inefficient Cost Units In The Presence of Undesirable Outputs
Available online at http://ijim.srbiau.ac.ir/ Int. J. Industrial Mathematics (ISSN 2008-5621) Vol. 10, No. 4, 2018 Article ID IJIM-01173, 8 pages Research Article A New Method for Optimization of Inefficient
More informationInteger Programming, Constraint Programming, and their Combination
Integer Programming, Constraint Programming, and their Combination Alexander Bockmayr Freie Universität Berlin & DFG Research Center Matheon Eindhoven, 27 January 2006 Discrete Optimization General framework
More informationIntuitionistic Fuzzy Estimation of the Ant Methodology
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Intuitionistic Fuzzy Estimation of the Ant Methodology S Fidanova, P Marinov Institute of Parallel Processing,
More informationHomework 3 Solutions
5233/IOC5063 Theory of Cryptology, Fall 205 Instructor Prof. Wen-Guey Tzeng Homework 3 Solutions 7-Dec-205 Scribe Amir Rezapour. Consider an unfair coin with head probability 0.5. Assume that the coin
More informationPlanning maximum capacity Wireless Local Area Networks
Edoardo Amaldi Sandro Bosio Antonio Capone Matteo Cesana Federico Malucelli Di Yuan Planning maximum capacity Wireless Local Area Networks http://www.elet.polimi.it/upload/malucell Outline Application
More informationIndian Institute of Management Calcutta. Working Paper Series. WPS No. 787 September 2016
Indian Institute of Management Calcutta Working Paper Series WPS No. 787 September 2016 Improving DEA efficiency under constant sum of inputs/outputs and Common weights Sanjeet Singh Associate Professor
More informationConstruct, Merge, Solve & Adapt: A New General Algorithm For Combinatorial Optimization
Construct, Merge, Solve & Adapt: A New General Algorithm For Combinatorial Optimization Christian Blum a,b, Pedro Pinacho a,c, Manuel López-Ibáñez d, José A. Lozano a a Department of Computer Science and
More informationClick-Through Rate prediction: TOP-5 solution for the Avazu contest
Click-Through Rate prediction: TOP-5 solution for the Avazu contest Dmitry Efimov Petrovac, Montenegro June 04, 2015 Outline Provided data Likelihood features FTRL-Proximal Batch algorithm Factorization
More informationMinimization of Energy Loss using Integrated Evolutionary Approaches
Minimization of Energy Loss using Integrated Evolutionary Approaches Attia A. El-Fergany, Member, IEEE, Mahdi El-Arini, Senior Member, IEEE Paper Number: 1569614661 Presentation's Outline Aim of this work,
More informationPrediction of A CRS Frontier Function and A Transformation Function for A CCR DEA Using EMBEDED PCA
03 (03) -5 Available online at www.ispacs.com/dea Volume: 03, Year 03 Article ID: dea-0006, 5 Pages doi:0.5899/03/dea-0006 Research Article Data Envelopment Analysis and Decision Science Prediction of
More informationImplementation of Travelling Salesman Problem Using ant Colony Optimization
RESEARCH ARTICLE OPEN ACCESS Implementation of Travelling Salesman Problem Using ant Colony Optimization Gaurav Singh, Rashi Mehta, Sonigoswami, Sapna Katiyar* ABES Institute of Technology, NH-24, Vay
More informationCapacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm
Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm Bharat Solanki Abstract The optimal capacitor placement problem involves determination of the location, number, type
More information30E00300 Productivity and Efficiency Analysis Abolfazl Keshvari, Ph.D.
30E00300 Productivity and Efficiency Analysis 2016 Abolfazl Keshvari, Ph.D. abolfazl.keshvari@aalto.fi Mathematics and statistics We need to know some basics of math and stat What is a function, and its
More informationA Note on the Scale Efficiency Test of Simar and Wilson
International Journal of Business Social Science Vol. No. 4 [Special Issue December 0] Abstract A Note on the Scale Efficiency Test of Simar Wilson Hédi Essid Institut Supérieur de Gestion Université de
More informationA hybrid heuristic for minimizing weighted carry-over effects in round robin tournaments
A hybrid heuristic for minimizing weighted carry-over effects Allison C. B. Guedes Celso C. Ribeiro Summary Optimization problems in sports Preliminary definitions The carry-over effects minimization problem
More informationMULTI-COMPONENT RETURNS TO SCALE: A DEA-BASED APPROACH
Int. J. Contemp. Math. Sci., Vol. 1, 2006, no. 12, 583-590 MULTI-COMPONENT RETURNS TO SCALE: A DEA-BASED APPROACH Alireza Amirteimoori 1 Department of Mathematics P.O. Box: 41335-3516 Islamic Azad University,
More informationPRIORITIZATION METHOD FOR FRONTIER DMUs: A DISTANCE-BASED APPROACH
PRIORITIZATION METHOD FOR FRONTIER DMUs: A DISTANCE-BASED APPROACH ALIREZA AMIRTEIMOORI, GHOLAMREZA JAHANSHAHLOO, AND SOHRAB KORDROSTAMI Received 7 October 2003 and in revised form 27 May 2004 In nonparametric
More informationDamages to return with a possible occurrence of eco technology innovation measured by DEA environmental assessment
DOI 10.1186/s40008-017-0067-x RESEARCH Open Access Damages to return with a possible occurrence of eco technology innovation measured by DEA environmental assessment Toshiyuki Sueyoshi * *Correspondence:
More informationHill-climbing Strategies on Various Landscapes: An Empirical Comparison
Hill-climbing Strategies on Various Landscapes: An Empirical Comparison Matthieu Basseur LERIA, Université d Angers, France matthieu.basseur@univ-angers.fr Adrien Goëffon LERIA, Université d Angers, France
More informationEffective Variable Fixing and Scoring Strategies for Binary Quadratic Programming
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming Yang Wang, Zhipeng Lü,FredGlover, and Jin-Kao Hao LERIA, Université d Angers, Boulevard Lavoisier, 4945 Angers Cedex, France
More informationTUTORIAL: HYPER-HEURISTICS AND COMPUTATIONAL INTELLIGENCE
TUTORIAL: HYPER-HEURISTICS AND COMPUTATIONAL INTELLIGENCE Nelishia Pillay School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal South Africa TUTORIAL WEBSITE URL: http://titancs.ukzn.ac.za/ssci2015tutorial.aspx
More informationEVOLUTIONARY DISTANCES
EVOLUTIONARY DISTANCES FROM STRINGS TO TREES Luca Bortolussi 1 1 Dipartimento di Matematica ed Informatica Università degli studi di Trieste luca@dmi.units.it Trieste, 14 th November 2007 OUTLINE 1 STRINGS:
More informationA General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
OPERATIONS RESEARCH Vol. 61, No. 2, March April 2013, pp. 386 397 ISSN 0030-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/10.1287/opre.1120.1093 2013 INFORMS A General Framework for Designing
More informationMetaheuristics and Local Search
Metaheuristics and Local Search 8000 Discrete optimization problems Variables x 1,..., x n. Variable domains D 1,..., D n, with D j Z. Constraints C 1,..., C m, with C i D 1 D n. Objective function f :
More informationA Branch and Bound Algorithm for the Project Duration Problem Subject to Temporal and Cumulative Resource Constraints
A Branch and Bound Algorithm for the Project Duration Problem Subject to Temporal and Cumulative Resource Constraints Christoph Schwindt Institut für Wirtschaftstheorie und Operations Research University
More informationClimbing discrepancy search for flowshop and jobshop scheduling with time-lags
Climbing discrepancy search for flowshop and jobshop scheduling with time-lags Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari To cite this version: Wafa Karoui, Marie-José Huguet, Pierre
More information23. The Finite Fourier Transform and the Fast Fourier Transform Algorithm
23. The Finite Fourier Transform and the Fast Fourier Transform Algorithm 23.1 Introduction: Fourier Series Early in the Nineteenth Century, Fourier studied sound and oscillatory motion and conceived of
More information15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete
CS125 Lecture 15 Fall 2016 15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete Already know SAT NP, so only need to show SAT is NP-hard. Let L be any language in NP. Let M be a NTM that decides L
More information