Technical Sessions – Monday July 11

FC-05 IFORS 2011 - Melbourne
Feature extraction and classification are the basic methods used to analyze and
interpret economical data. The number of samples is often much smaller than
the number of features. In this situation it makes impossible to estimate the
classifier parameters properly and the classification results may be inadequate.
In this case it is important to decrease the dimension of the feature space. This
can be done by feature extraction. In this paper we present a new feature extraction
method. Our method is an extension of the classical PLS algorithm. A
new weighted separation criterions are applied.
2 - Proposal for a Strategic Planning for the Replacement
of Products in Stores based on Sales Forecast
Maria Teresinha Arns Steiner, Production Engineering Dept.,
UFPR, R. Pe. Anchieta, 1231 - Ap. 31, 80730-000, Curitiba, Pr,
Brazil, tere@ufpr.br, Cassius Tadeu Scarpin, Pedro Steiner Neto
This paper presents a proposal for strategic planning for the replacement of
products in stores of a supermarket network. A quantitative method for forecasting
time series is used for this, the Artificial Radial Basis Neural Networks
(RBFs), and also a qualitative method to interpret the forecasting results and
establish limits for each product stock for each store in the network.
3 - A Habitual Domain Approach to Coalition Formation in
n-Person Games
Moussa Larbani, Business Administration, IIUM University,
Jalan Gombak„ 53100, Kuala Lumpur, Kuala Lumpur, Malaysia,
larbani61@hotmail.com, Po-Lung Yu
In this paper we present a new approach to n-person games based on Habitual
Domain theory. The constructed game model captures the fact that the underlying
changes in the psychological aspects and mind states of players over
the arriving events are the key factors that determine the dynamic process of
coalition formation.
4 - Game-Theoretic Models for Competition in Public Transit
Services
Janny Leung, Systems Engineering and Engineering
Management Dept, The Chinese University of Hong Kong,
Shatin, New Territories, Hong Kong, jleung@se.cuhk.edu.hk,
Eddie Chan
We present game-theoretic models for investigating the competitive situation
when several service providers offer public transit services, and study the impact
on services offered to the public and the resultant ridership of the system.
The competition among the operators can be modelled by a class of games
called potential games. We discuss mathematical programmes that can be used
to find the Nash equilibria. By analysing the equilibria solutions, we examine
how different structures of the transit networks impact the services offered and
the overall ridership of the system.
� FC-05
Friday, 15:15-16:45
Meeting Room 104
Queuing and Simulation
Stream: Contributed Talks
Contributed session
Chair: Michael Manitz, Technology and Operations Management,
Chair of Production and Supply Chain Management, University of
Duisburg/Essen, Mercator School of Management, Lotharstr. 65,
47057, Duisburg, Germany, michael.manitz@uni-due.de
1 - The Cross-Entropy Method for Estimating Burr XII Parameters
Babak Abbasi, Mathematical and Geospatial Sciences, RMIT
University, School of Mathematical and Geospatial Sciences,
RMIT University, Melbourne, VIC, Australia,
babak.abbasi@rmit.edu.au
This paper proposes a method in estimating parameters of Burr XII distribution
which is widely used in practical applications such as lifetime data analysis.
The Cross-Entropy (CE) method is developed in context of Maximum
Likelihood Estimation (MLE) of Burr XII distribution for complete data or in
presence of multiple censoring. A simulation study is conducted to assess the
performance of the MLE via CE method for different parameter settings and
sample sizes. The results are compared to other existing methods in both uncensored
and censored situations.
126
2 - Efficient Procedures for Optimization via Simulation
with Binary Variables
Shing Chih Tsai, Industrial and Information Management,
National Cheng Kung University, No. 1, University Road„
Tainan, Taiwan, sctsai@mail.ncku.edu.tw
In the paper we propose a generic rapid screening procedure for zero-one optimization
via simulation problem and then present the customized versions
providing different statistical guarantees. Our optimization framework has several
screening phases and one clean-up phase to select the best. Some strategies
to construct the set of initial solutions and search for good solutions (in each
screening phase) are also discussed. Experimental results are provided to compare
the efficiency of our procedures with existing ones.
3 - Performance Evaluation of General Assembly/Disassembly
Queueing Networks with Blocking
Michael Manitz, Technology and Operations Management, Chair
of Production and Supply Chain Management, University of
Duisburg/Essen, Mercator School of Management, Lotharstr. 65,
47057, Duisburg, Germany, michael.manitz@uni-due.de
In this presentation, A/D queueing networks with blocking, generally distributed
service times, and synchronization constraints at assembly and disassembly
stations are analyzed. A decomposition approach for the throughput
and the variance of the inter-departure times is described. The subsystems are
analyzed as G/G/1/N stopped-arrival queueing systems whose virtual arrivalprocess
and service parameters are estimated via solving a system of so-called
decomposition equations. The quality of the presented approximation procedure
is tested against the results of various simulation experiments.
� FC-06
Friday, 15:15-16:45
Meeting Room 105
Location and Facility Planning
Stream: Contributed Talks
Contributed session
Chair: Tsutomu Suzuki, Faculty of Systems and Information
Engineering, University of Tsukuba, 1-1-1 Tennodai, 305 8573,
Tsukuba, Ibaraki, Japan, tsutomu@risk.tsukuba.ac.jp
1 - Matching Warehouses with Auto Parts at a Motorcycle
Assembler in Thailand
Sorawit Yaoyuenyong, Graduate School of Management and
Innovation, King Mongkut’s University of Technology Thonburi,
Thailand, sorawit.yao@kmutt.ac.th, Pakkanart Srimahasap
When there is a new motorcycle model assembled at a plant, its engineers need
to re-assign 8 different types of auto parts to 8 different warehouses in order
to minimize the total daily distance in moving all parts. Parts are moved from
4 unloading locations outside the building to these warehouses, then to more
than 100 locations inside assembly lines. Some parts are also moved among the
warehouses. This problem formulation can be viewed as the Assignment Problem
with a non-linear objective function. A computer program using Excel’s
Solver was successfully developed to solve this problem.
2 - A Comparison of Methods for Solving the Sensor Location
Problem
Rodolfo Garcia-Flores, Mathematical and Information Sciences
(CMIS), Commonwealth Scientific and Industrial Research
Organisation (CSIRO), 71 Normanby Rd., Clayton, 3168,
Melbourne, VIC, Australia, Rodolfo.Garcia-Flores@csiro.au,
Peter Toscas, Olena Gavriliouk, Geoff Robinson
A problem that frequently arises in environmental surveillance is where to place
a set of sensors in order to maximise collected information. In this article we
compare two methods for solving this problem: a discrete approach based in
the classical k-median location model, and a continuous approach based on the
minimisation of the prediction error variance. Unlike conventional methods
used by geo-statisticians like the Metropolis-Hastings algorithm, the methods
proposed assume no prior knowledge of the spacial dependencies. We present
an overview of both methods and a comparison of results.