On Transportation System with Deterministic Service Time
Abstract
Most of transportation systems behave as MIMI1 queuingtype which is widely explored throughout scientific literature.On the other hand, there are a few real life examples of transportationsystems with deterministic service time. In this paperwe explore one of such systems and propose solution finding fortactical port operational problem by queuing model and heuristicmethod. A heuristic approach is developed as an alternativeto mathematical model solution finding. Between these twomethods, good SQlutions of known quality are provided quickly.Through simple example of bulk loading terminal, defined asMIDI1 system, comparison of the heuristic solutions to themathematical model indicates that the corresponding resultsmatch closely. On the basis of the experiment, we assume thatthe same heuristic with a slight modification would give acceptablesolution for a real life MIDIS problem where search for feasiblesolution by mathematical model is a tough and unacceptabletask in practical use.References
E. van Asperen, R. Dekker, M. Polman, H. deS. Arons:
'Modeling Ship Arrivals in Ports', Proceedings of the
Winter Simulation Conference, Rotterdam, 2003
F. Baita, W. Ukovich, R. Pesanti, D. Favaretto: 'Dynamic
routing-and-inventory problems: a review', Transportation
Research A 32, 1998, pp. 585-598
D. Barkovic: 'Operacijska istraiivanja', Ekonomski fakultet
Osijek, Osijek, 2001
J. F. Bard, L. Huang, P. Jaillet, M. Dror: '~ decomposition
approach to the inventory routing problem with
satellite facilities', Transportation Science 32, 1998, pp.
-203
J.P. C. Blanc: '~Numerical Approach to Cyclic-Server
Queueing Models', Queueing Systems, No. 6, 1990, pp.
-188.
S. J. Bose: '~n Introduction to Queuing Systems', Chapter
, Kluwer/Plenum Publishers, 2002
J. Boyer. F. Guillemin. P. Robert. B. Zwart: 'Heavy
tailed M/G/1-PS queues with impatience and admission
control in packet networks', IEEE INFOCOM New
York, USA, 2003
J. C. S. Brandao, A. Mercer: 'The multi-trip vehicle
routing problem', Journal of Operational Research Society
, 1998, pp. 799-805
J.D. Camm, J. R. Evans: 'Management Science: Modeling,
Analysis and Interpretation', South-Western College
Publishing, Cincinnatti, OH, 1996
C. D. Crommelin: 'Delay probability formulas when the
holding times are constant', P. 0. Electr. Engr. J., 25,
, pp. 41-50
K. Cullinane, D. W. Song, T. Wang: 'The Application of
Mathematical Programming Approaches to Estimating
Container Port Production Efficiency', Journal of Productivity
Analysis, Springer Netherlands, Vol. 24, No.
, 2005, pp. 73-92
K. Cullinane: 'The Productivity and Efficiency of Ports
and Terminals: Methods and Applications', Grammenos.
C. T. eds., The Handbook of Maritime Economics
and Business, LLP, London, 2003
D. J. Daley: 'The busy period of the MIG! queue', Queueing
Systems Theory and Applications, Vol. 38, No.2,
,pp. 195-204
W. Fendick, W. Whitt: 'Measurements and Approximations
to Describe the Offered Traffic and Predict the Average
Workload in a Single-Server Queue', Proceedings of
IEEE, Vol. 77, No.1, 1989, pp. 171-194
G. J. Frame '~ Simple Solution for the M/D/c Waiting
Time Distribution',
http://www.cs.vu.nl/-franx/Mdctranll.pdf, 1998
W. Gong, J. Hu: 'The Maclaurin series for the GI/G/1
queue', Journal of Applied Probability, No. 29, 1992,
pp. 176-184
Z. lvkovic: 'Uvod u teoriju verovatnoce, slucajne procese
i matematicku statistiku ', Gradevinska knjiga, Beograd,
J. A. Lawrence, B. A. Pasternack: '~pplied Management
Science, a Computer-Integrated Approach for Decision
Making', John Wiley and Sons, New York, 1998
M. Lazic: 'Primena metoda teorije masovnog opsluiivanja
u analizi vremena zadriavanja brodova u luci Koper',
Saobracaj, Vol. 28, No.3, 1981, pp. 493-499
T. Morimoto, Y. Yoshida: 'Discrete Approximation of
M/D/s/N Queuing Models', Electronics and Communications
in Japan, Part 1, Vol. 82, No.6, 1999
R. Nelson: 'Probability, Stochastic Processes and Queueing Theory', Springer-Verlag, 1995
N. U. Prabhu: 'Elementary methods for some waiting
time problems', Operations Research 10, 1962, pp. 559-
-566
A. Riska, E. Smirni: 'Exact Aggregate Solutions for
M/G/1-type Markov Processes',
http://parapet.ee.princeton.edu/-sigm2002/papers/
p86-riska. pdf
D. Ronen: 'Ship scheduling: the last decade', European
Journal of Operational Research 71, 1993, pp. 325-333
S. Salhi, G. Nagy: '~ cluster insertion heuristic for single
and multiple depot vehicle routing problems with backhauling',
Journal of Operational Research Society 50,
,pp. 1034-1042
S. A. E. Sassen, H. C. Tijms, R. D. Nobel: '~ heuristic
rule for routing customers to parallel servers', Statistica
Neerlandica, No. 51, 1997, pp. 107-121
D. Sariklis, S. Powell: '~ heuristic method for the open
vehicle routing problem', Journal of Operational Research
Society 51, 2000, pp. 564-573
D. Stoyan: 'Comparison Methods for Queueing and
Other Stochastic Models', John Wiley and Sons, 1983
H. C. Tijms: 'Stochastic Models. an Algorithmic Approach',
John Wiley and Sons. New York, 1994
E. Wentzel. L. Ovcharov: '~pplied Problems in Probability
Theory', Mir Publishers, English translation, 1986
W. Whitt, P. W. Glynn, B. Melamed: 'Estimating Customer
and Time Averages', Operations Research, Vol. 41,
No. 2, 1993, pp. 400-408
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
