26.11.2012 Views

Technical Sessions – Monday July 11

Technical Sessions – Monday July 11

Technical Sessions – Monday July 11

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

FA-18 IFORS 20<strong>11</strong> - Melbourne<br />

2 - The Trend is not Your Friend! Demystifying the Empirical<br />

Track Record of Techn. Trading Rules and its Interrelation<br />

with Market Efficiency by Asset Price Characteristics<br />

Peter Scholz, Frankfurt School of Finance and Management,<br />

60314, Frankfurt am Main, Germany,<br />

p.scholz@frankfurt-school.de, Ursula Walther<br />

The empirical success of technical trading rules, contradicting the efficient market<br />

hypothesis, still seems puzzling. We contribute by showing that timing success<br />

can be explained by the statistical characteristics of the underlying asset<br />

price, where market efficiency does not play any role. Five impact factors are<br />

studied: return autocorrelation, trend, volatility and its clustering and market<br />

efficiency. Different simple moving average rules are applied to simulated and<br />

real asset price data to allow for systematic parameter variations. Evaluation is<br />

done on the entire return distribution.<br />

3 - Rational Choice in IPD Games from an Investor’s Perspective<br />

Ulla Hofmann, Institute for Management, University Koblenz,<br />

Universitätsstraße 1, 50670, Koblenz, Germany,<br />

uhofmann@uni-koblenz.de, Thomas Burkhardt<br />

We consider experimental results in an iterated prisoner’s dilemma game from<br />

the perspective of a rational investor. We describe observed behavior using a<br />

stochastic Markov model and analyze the properties of the return distribution<br />

from the investor’s perspective. Some first theoretical considerations regarding<br />

optimal choice are discussed.<br />

� FA-18<br />

Friday, 9:00-10:30<br />

Meeting Room 215<br />

Applications of DEA in Health Sector<br />

Stream: Data Envelopment Analysis<br />

Invited session<br />

Chair: Ana Camanho, Faculdade de Engenharia, Universidade do<br />

Porto, DEMEGI - GEIN, Rua Dr. Roberto Frias, 4200-465, Porto,<br />

Portugal, acamanho@fe.up.pt<br />

1 - Estimating <strong>Technical</strong> Efficiency of Social Security Hospitals<br />

in Iran by Data Envelopment Analysis<br />

Nahid Hatam, Health Service Administration, Shiraz University<br />

of Medical Sciences(SUMS) -Shiraz - Iran, School of<br />

Management & Medical Information Sciences, 0098, Shiraz,<br />

Fars, Iran, Islamic Republic Of, hatamn@sums.ac.ir, Kimia<br />

Purmohamadi, Ali Keshtkaran, Mehdi Javanbakht<br />

This study examines the technical and scale efficiency of 64 public hospitals<br />

affiliated to social security organization in Iran, between 2006-2008, by estimating<br />

a deterministic frontier production function and the variable return to<br />

scale (VRS), and input-oriented DEA model.<br />

2 - Evaluating Relative Efficiency of Regulatory Departments<br />

in Pharmaceutical Companies in Iran<br />

Seyed Hamid Mostafavi, Socioeconomic Research Center,<br />

Cardiff University, Welsh School of Pharmacy, Redwood<br />

Building, King Edward VII Ave, CF10 3NB, Cardiff, United<br />

Kingdom, seyedhamid.mostafavi@gmail.com, Sam Salek<br />

This study applies DEA to determine the technical efficiency of DMUs based<br />

on technical, operational and financial inputs and outputs, and identify key performance<br />

indicators of the regulatory departments in pharmaceutical companies<br />

and evaluate their relative efficiencies. The results give efficiency scores<br />

of <strong>11</strong> companies and show that 3 were efficient. It is concluded that the existence<br />

of an independent regulatory department can create and sustain superior<br />

performance for companies to reach competitive advantage by exploiting new<br />

opportunities vis-à-vis new products’ time to market.<br />

3 - Assessing Efficiency of Primary Healthcare: Comparing<br />

DEA and SFA<br />

<strong>11</strong>4<br />

Sergio Maturana, Ingenieria Industrial y de Sistemas, P.<br />

Universidad Catolica de Chile, Casilla 306 Correo 22, Santiago,<br />

Chile, smaturan@ing.puc.cl, Martha Ramirez-Valdivia<br />

This article uses the same data set and compares the efficiency ranking and index<br />

by applying Data Envelopment Analysis and Stochastic Frontier Analysis<br />

to 259 nationwide municipalities that administer Chilean primary healthcare.<br />

The SFA efficiency value reaches 79.34% whilst the DEA value is 82.07%.<br />

Up to 67% decision making units found to be "better’ under DEA were also<br />

classified as "better’ under SFA. The results show that both methods provide<br />

efficiency measures that are similar enough to conclude that there are no statistically<br />

significant differences between them.<br />

4 - Benchmarking Countries Environmental Performance<br />

Andreia Zanella, FEUP - Faculdade de Engenharia da<br />

Universidade do Porto, Portugal, andreia.zanella@fe.up.pt, Ana<br />

Camanho, Teresa Galvão Dias<br />

Environmental performance assessments are often conducted using environmental<br />

indicators. These indicators provide a starting point for comparisons,<br />

although the identification of directions for improvement is difficult. The main<br />

contribution of this paper is the development of a DEA model with virtual<br />

weight restrictions that provides a summary measure of countries performance.<br />

It also enables the identification of the strengths and weaknesses of each country,<br />

as well as the peers and targets that inefficient countries should follow to<br />

improve environmental practices.<br />

� FA-19<br />

Friday, 9:00-10:30<br />

Meeting Room 216<br />

Multiobjective Flows and Paths Problems<br />

Stream: Network Optimisation and Telecommunications<br />

Contributed session<br />

Chair: Bi Yu Chen, Department of Civil and Structural Engineering,<br />

The Hong Kong Polytechnic University, Kowloon, Hong Kong,<br />

chen.biyu@gmail.com<br />

1 - Algorithms for Biojective Shortest Path Problems in<br />

Fuzzy Networks<br />

Iraj Mahdavi, Department of Industrial Engineering, Mazandaran<br />

University of Science & Technology, P.O.Box 734, 4716685635,<br />

Babol, Mazandaran, Iran, Islamic Republic Of,<br />

irajarash@rediffmail.com<br />

We consider biobjective shortest path problems in networks with fuzzy arc<br />

lengths. Considering the available studies for single objective shortest path<br />

problems in fuzzy networks, using a distance function for comparison of fuzzy<br />

numbers, we propose three approaches for solving the biobjective problems.<br />

We propose a fuzzy number ranking method to determine a fuzzy shortest<br />

path. Illustrative examples are worked out to show the effectiveness of our<br />

algorithms.<br />

2 - Multiobjective Shortest Paths in Multimodal Networks<br />

Romain Billot, Smart Transport Research Centre, QUT, 2 George<br />

St GPO box 2434, 4101, Brisbane, QLD, Australia,<br />

billotro@gmail.com, David Rey<br />

Computation of multimodal travel time has become a critical issue for the transportation<br />

specialists in order to provide the network users with an efficient information<br />

about their journey conditions. After a review of the different approaches<br />

for multimodal shortest paths computation and a practical example<br />

for the city of Lyon in France, we broad the topic by considering the multiobjective<br />

aspects. We present a method that combines the use of A* algorithms<br />

with genetic algorithms and conclude the paper with a discussion about the<br />

introduction of the stochasticity into theses solutions.<br />

3 - A Return to the Traveling Salesman Model: The Network<br />

Branch and Bound Approach<br />

Elias Munapo, Decision Sciences Dept., University of South<br />

Africa, Preller Street, Pretoria, P. O. Box 392, UNISA 0003, 27,<br />

Pretoria, Gauteng, South Africa, munape@unisa.ac.za<br />

This paper presents a network branch and bound approach for solving the difficult<br />

traveling salesman (TSP) problem. A rooted tree is how the TSP is tackled,<br />

with the root representing the optimal solution, and lower levels representing<br />

sub-problems traversed using a combination of minimum spanning tree (MST),<br />

arc fixing and leaf removal. In that sense, the tree is optimized (in terms of size<br />

at lower levels) by starting with nodes having smallest degree. The strength<br />

of the method lies in that the MST is easier to solve than either the linear programming<br />

or assignment based algorithms.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!