Monte Carlo Simulation Applied to the Logistics of Ceramics

• Authors: Eloy Hontoria , Victoria de la Fuente Aragon , Lorenzo Ros-McDonnell , Marija Bogataj
• Languages of publication: EN

Abstracts

EN

The article offers information on the Monte Carlo simulation method applied to logistics in ceramic industries. It mentions that the aim of the study is to improve an approximate algorithm for optimal logistics of heavy and variable size items and to find a new, well-organized vehicle assignment solution with lower costs. The topics discussed includes capacitated vehicle routing problem, strategies of logistics operator and Monte Carlo simulation solution.

Keywords

EN

Logistics; Monte Carlo method; Monte Carlo simulation; Motor transport; Transport logistics

PL

Logistyka; Logistyka transportu; Metoda Monte Carlo; Symulacja Monte Carlo; Transport samochodowy; Wyroby ceramiczne

• Publisher: Uniwersytet Ekonomiczny w Katowicach
• Journal: Journal of Economics and Management
• Year: 2013
• Volume: 11
• Pages: 5-16

Contributors

author

Eloy Hontoria

author

Victoria de la Fuente Aragon

author

Lorenzo Ros-McDonnell

author

Marija Bogataj

References

• Bachelet B., Yon L. (2007): Model Enhancement: Improving Theoretical Optimization with Simulation. Simul Model Pract Th 15, pp. 703-715.
• Fernandez de Cordoba P., Garcia Rafi L.M., Sanchis J.M. (1998): A Heuristic Algorithm Based on Monte Carlo Methods for the Rural Postman Problem. "Computers and Operation Research" 25(12), pp. 1097-1106.
• Fischetti M., Toth P., Vigo D. (1994): A Branch-and-bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs. Oper. Res., 42, pp. 846-859.
• Fishman G.S. (1996): Monte Carlo. Concepts, Algorithms, and Applications. Springer, New York.
• Jackel P. (2002): Monte Carlo Methods in Finance. John Wiley & Sons, New Jersey.
• Juan A.A., Adelantado F., Faulin J., Grasman S.E., Montoya-Torres J.R (2009): Solving the Capacitated Vehicle Routing Problem with Maximum Travelling Distance and Service Time Requirements: An Approach Based on Monte Carlo Simulation. Proceedings - Winter Simulation Conference, art. no. 5429663, pp. 2467-2475.
• Laporte G. (1992): The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms. Eur J Oper Res 59, pp. 345-358.
• Laporte G., Gendreau M., Potvin J.Y., Semet F. (2000): Classical and Modern Heuristics for the Vehicle Routing Problem. Int Tra Oper Res 7, pp. 285-300.
• Toth P., Vigo D. (2002): Models, Relaxations and Exact Approaches for the Capacitated Vehicle Routing Problem. Discrete Appl Math 123, pp. 487-512.
• Ralphs T.K., Kopman L., Pulleyblank W.R., Trotter L.E. (2003): On the Capacitated Vehicle Routing Problem. Math Program 94, pp. 343-359.
• Ros-McDonnell L., de-la-Fuente Aragon M.V., Bogataj M. (2010): An Approximate Algorithm for Optimal Logistics of Heavy and Variable Size Items. Cent Eur J Oper Res doi: 10.1007/s10100-010-0155-6.
• Vrugt J.A.ab, Ter Braak C.J.F. (2011): DREAM(D): An Adaptive Markov Chain Monte Carlo Simulation Algorithm to Solve Discrete, Noncontinuous, and Combinatorial Posterior Parameter Estimation Problems. "Hydrology and Earth System Sciences", Vol. 15, Iss. 12, pp. 3701-3713.
• (WWW1): http://rd.springer.com/article/10/1007/s10100-010-0155-.

Identifiers

ISSN

1732-1948