Technical Sessions – Monday July 11

4 - Reliable Shortest Path Problem in Stochastic Networks
with Spatial Correlation
Bi Yu Chen, Department of Civil and Structural Engineering,
The Hong Kong Polytechnic University, Kowloon, Hong Kong,
chen.biyu@gmail.com, William Lam
This study investigates the reliable shortest path problem (RSPP) in stochastic
networks with spatial correlation. Such reliable shortest paths can help travelers
make their route choice under travel time uncertainty with a given on-time
arrival certainty. The RSPP with spatial correlation is formulated and solved as
a multi-objective shortest path approach. A new A* algorithm is proposed to
exactly solve this problem. Computational results show that the proposed algorithm
can determine the reliable shortest path in large scale networks within
a very short computation time.
� FA-20
Friday, 9:00-10:30
Meeting Room 217
Decision Theory
Stream: Contributed Talks
Contributed session
Chair: Jae H. Min, Sogang Business School, Sogang University, #1,
Shinsu-dong, Mapo-ku, 121-742, Seoul, Korea, Republic Of,
jaemin@sogang.ac.kr
1 - Forming a Stable Multipartner Alliance when Priorities
Differ
Tom Blockmans, MOSI, Vrije Universiteit Brussel, Pleinlaan 2,
1050, Brussel, Belgium, tblockma@vub.ac.be, Frank Plastria
We extend a spatial alliance formation model by considering the relative importance
that individual partners may attribute to separate policy dimensions.
Both simultaneous and incremental negotiation procedures are used to determine
the alliance positions. The similarity in policy priorities is shown to have
a considerable impact on partners’ preferences in terms of alliance composition.
Demonstrated negotiating flexibility strongly influences the formation
process. The stability of an alliance structure is compared between different
formation procedures and distance functions.
2 - Sensitivity Analysis in PROMETHEE
Sándor Bozóki, Research Group of Operations Research and
Decision Systems, Computer and Automation Research Institute,
Hungarian Academy of Sciences, PO Box 63., H-1518,
Budapest, Hungary, bozoki@sztaki.hu
Sensitivity analysis in multi-attribute decision making is of both theoretical and
practical interest. In partial sensitivity analysis the weight of a given attribute is
modified and the weights of the other attributes are fixed or rescaled in order to
keep the sum of the weights. Changes of two weights have been also analysed.
However, a more general model for sensitivity analysis is at least as important,
especially when dealing with real-life decision situations, as partial one. In the
model proposed an arbitrary set of the weights can change independently from
each other.
3 - Multicriteria Model to Evaluate Indicators in Performance
Measurements Instruments
Edilson Giffhorn, Production Engineering, Santa Catarina
Federal University, Av. Iguaçú, 399, apt. 25, bairro Rebouças,
80230020, Curitiba, Paraná, Brazil,
edilson.giffhorn@gmail.com, Leonardo Ensslin, Sandra Ensslin,
William Vianna
This paper presents the construction of a Performance Indicators evaluation
model. From the model it was possible:(i) identify 58 criteria that evaluate the
performance of the indicators;(ii) to trace the impact profile of the indicators
of published applications of performance evaluation;(iii) to propose improvement
actions that increase the performance of the indicators; and (iv) to draw an
Impact Profile to the Case Study indicators after the improvement actions. The
results evidence the availability of a model that improves the operationalization
of Performance Measurement instruments.
4 - Another Bound on Rational Decision Making
Jae H. Min, Sogang Business School, Sogang University, #1,
Shinsu-dong, Mapo-ku, 121-742, Seoul, Korea, Republic Of,
jaemin@sogang.ac.kr
IFORS 2011 - Melbourne FA-21
Behavioral decision making deals with how ordinary people make decisions
and behave. Several bounds such as bounded rationality, bounded willpower,
bounded self-interest, bounded will-to-commit, bounded ethicality have provided
rationale for people’s irrational judgment and behavior. This paper suggest
another bound on rational decisions from the perspective of Asian values.
� FA-21
Friday, 9:00-10:30
Meeting Room 218
Deterministic Open Pit Mine Planning
Stream: Mining Applications
Invited session
Chair: Andrés Weintraub, University of Chile, Santiago, Chile,
aweintra@dii.uchile.cl
1 - A Library of Open Pit Block Sequencing Problems
Alexandra Newman, Division of Economics and Business,
Colorado School of Mines, 1500 Illinois Street, 80401, Golden,
CO, United States, newman@mines.edu, Daniel Espinoza,
Marcos Goycoolea, Eduardo Moreno, Thomas Prevost
The open pit block sequencing problem seeks to determine when if ever, a notional
three-dimensional block containing ore and/or waste material is extracted
from an open pit mine. A typical objective is to maximize the net present value
of the extracted ore; constraints include spatial precedence and lower and upper
bounds on resources. We present a description of this problem, briefly mention
some related literature, detail mathematical models for the problem, provide a
structured guide to corresponding data sets, and conclude with directions for
use of this newly established mining library.
2 - Cutting Planes, Separation and Experiments for the
Open-pit Planning Problem
Daniel Espinoza, Industrial Engineering, Universidad de Chile,
Av. Republica 701, 837-0439, Santiago, RM, Chile,
daespino@dii.uchile.cl
We consider the problem of separating valid inequalities arising from lifted
induced cover inequalities for the precedence constrained knapsack problem,
which essentially is a generalization of the long term planning problem for open
pit mining in the presence of capacity constraints. We study some complexity
issues regarding the separation problem, polynomial separation algorithms for
a sub-class of these inequalities, and extensive computational tests showing the
impact of the separated inequalities. The separation algorithms in this work
generalize and include results from previous works from Boyd 1993, Park and
Park 1997, van de Leensel et al. 1999 and Boland et al. 2005.
3 - A Heuristic Approach for Short-term Production Planning
in Open-pits
Michel Gamache, Mathematics and Industrial Engineering,
École Polytechnique de Montréal, P.O. Box 6079, Station
Centre-Ville, H3C 3A7, Montréal, Quebec, Canada,
michel.gamache@polymtl.ca, Gabriel L’Heureux, Francois
Soumis
This presentation focuses on solving the short-term (a horizon of 90 days)
scheduling problem in open-pit mines. This problem consists of finding the
mining sequence that will minimize production costs while taking into account
the precedence constraints for the extraction of the blocks, the grouping
of blocks for drilling and blasting, the blending constraints, the movement of
shovels, etc. A heuristic approach, based on a mixed integer linear programming
model, is presented.
4 - Tailoring a Lagrangian Relaxation to Reduce Solution
Time of the Open Pit Block Sequencing Problem
William Lambert, Division of Economics and Business,
Colorado School of Mines, 1500 Illinois St., 80401, Golden, CO,
United States, wlambert@mines.edu, Alexandra Newman
An open pit mine optimizes profits by maximizing the extracted orebody’s net
present value. Solving an integer program (IP) with time-indexed binary variables
for each block representing if, and when, the block is extracted, is an
exact method to determine the block extraction sequence. We solve the IP with
a modified Lagrangian relaxation, where constraints are dualized, and multipliers
are initialized, in different periods depending on the expected difficulty
of satisfying minimum and maximum resource constraints. To determine these
periods a priori, we develop heuristics that estimate how challenging it will be
to fulfill the resource requirements in each period.
115