Zarządzanie samochodowym taborem ciężarowym – metody

• Autorzy: Redmer A. , Kiciński M. , Rybak R.

Warianty tytułu

EN

Freight Fleet Management – the methods

• Języki publikacji: PL

Abstrakty

PL

Niniejszy artykuł jest drugim z cyklu trzech artykułów, jakie Autorzy pragną dedykować tematyce zarządzania samochodowym taborem ciężarowym. Artykuł ten prezentuje pięć ilościowych (optymalizacyjnych) metod rozwiązywania wybranych problemów zarządzania taborem wraz z definicjami każdego z owych problemów oraz opisem sposobów rozwiązywania. W artykule zaprezentowano szczegółowo liniowy model matematyczny problemu Make or Buy, nieliniowy model problemu liczebności/kompozycji taboru, liniowy model problemu wymiany taboru z dyskontowaniem, liniowy model problemu przydziału kierowców/pojazdów do zadań oraz liniowy, oparty o teorię grafów, model problemu marszrutyzacji (VRP). Niniejszy artykuł będzie kontynuowany w kolejnym, poświęconym kwestii praktycznych przykładów zastosowania zaprezentowanych metod.

EN

The paper is the second one from the series of three papers that the Authors dedicate to the freight fleet management topic. The paper presents five quantitative (optimization) methods of solving selected fleet management problems. All the selected management problems are carefully defined and dedicated to them solution methods are roughly characterized, as well. Mathematical models of the selected problems are presented in details, including: the linear model of a Make or Buy problem, the non-linear model of a fleet sizing / composition problem, the linear model of a replacement problem including discounting aspect, the linear model of an assignment of drivers / vehicles to transportation tusks, and the linear, graph theory based model of a VRP problem. The paper will be continued in a next one dedicated to fleet management case studies.

Słowa kluczowe

PL

tabor; make or buy; transport; liczebność; wymiana

EN

transport; fleet; make or buy; fleet sizing; replacement

• Wydawca: Polskie Wydawnictwo Ekonomiczne SA
• Czasopismo: Gospodarka Materiałowa i Logistyka
• Rocznik: 2014
• Tom: nr 4
• Strony: 11--18
• Opis fizyczny: Bibliogr. 73 poz.

Twórcy

autor

Redmer A.

• Politechnika Poznańska, Wydział Maszyn Roboczych i Transportu

autor

Kiciński M.

• Politechnika Poznańska, Wydział Maszyn Roboczych i Transportu

autor

Rybak R.

• Politechnika Poznańska, Wydział Maszyn Roboczych i Transportu

Bibliografia

• Alba, E., Dorronsoro, B. (2004). Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms. Referat wygłoszony na: Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP'04, LNCS 3004. Portugalia: Springer-Verlag, 11-20).
• Altinkemer, K., Gavish, B. (1991). Parallel Savings Based Heuristic for the Delivery' Problem. Operations Research, (39), 456-469.
• Ball, M.O., Golden, B.L., Assad, A.A., Bodin, L.D. (1983). Planning for truck fleet size in the presence of common-carrier option. Decision Science, (14), 103-120.
• Barnhart, C, Laporte, G. (red.). (2007). Handbook in Operation Research and Management Science (14). Elsevier.
• Beaujon, G.J., Turnquist, M.J. (1991). A model for fleet sizing and vehicle allocation. Transportation Science, (25) (1), 19-45.
• Berger, J., Barkaoui, M. (2003). A hybrid genetic algorithm for the capacitated vehicle routing problem. W: E. Cantû-Paz (red.), GECCO- 03. LNCS 2723 (646-656). Chicago: Springer-Verlag.
• Bodin, L.D., Golden, B.L., Assad, A.A., Ball, M. (1983). Routing and Scheduling of Vehicle and Crews, the State of the Art. Computers and Operations Research, (10), 69-211.
• Britten, A. A. (1971). Decision making in vehicle management. United Kingdom: Local Government Operational Research Unit of the Royal Institute of Public Administration (Raport nr S. 15).
• Bullnheimer, B., Hartl, R.F., Strauss, C. (1997). Applying the Ant System to the Vehicle Routing Problem. Referat wygłoszony na: 2nd International Conference on Metaheuristics, Sophia-Antipolis.
• Burkard, R., DellAmico, M., Martello, S. (2009). Assignment problems. Philadelphia: Society for Industrial and Applied Mathematics.
• Carie, T., Gold, H. (2008). Vehicle routing problem. Vienna: In-Teh, Croatian branch of I-Tech Education and Publishing KG.
• Cela, E. (1998). The Quadratic Assignment Problem. Theory and Algorithms. Dordrecht: Springer Science and Business Media.
• Christer, A.H., Goodbody, W. (1980). Equipment replacement in an unsteady economy. Journal of the Operational Research Society, 31 (6), 497-506.
• Clarke, G., Wright, J.W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12 (4), 568-581.
• Cordeau, J.-F., Laporte, G., Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, (52), 928-936.
• Czarnas, P., Czech, Z.J., Gocyla, P. (2004). Parallel Simulated Annealing for Bicriterion Optimization Problems. W: R. Wyrzykowski, J. Dongarra, M. Paprzycki, J. Waśniewski (red.), Parallel Processing and Applied Mathematics LNCS 3019 (233-240). Springer-Verlags.
• Dantzig, G., Fulkerson, R. (1954). Minimizing the number of tankers to meet a fixed schedule. Naval Research Logistics Quarterly, (1), 217-222.
• Desrochers, M., Verhoog, T.W. (1989). A Matching Based Savings Algorithm for the Vehicle Routing Problem. Montréal: Ecole des Hautes Études Commerciales de Montréal (Les Cahiers du GERAD G-89-04).
• Dębińska-Cyran, I. Gubała, M. (2005). Podstawy zarządzania transportem w przykładach. Poznań: Wydawnictwo ILiM.
• Du, Y. Hall, R. (1997). Fleet sizing and empty equipment redistribution for center-terminal transportation networks. Management Science, 43 (2), 145-157.
• Eilon, S., King, J.R., Hutchinson, D.E. (1966). A study in equipment replacement. Operational Research Quarterly, 17 (1), 59-71.
• Etezadi, T. Beasley, J.E. (1983). Vehicle fleet composition. Journal of Operational Research Society, (34), 87-91.
• Fagerholt, K. (1999). Optimal fleet design in a ship routing problem. International Transactions in Operational Research, (6), 453-464.
• Fisher, M.L. (1994). Optimal Solution of Vehicle Routing Problems Using Minimum K-trees. Operations Research, (42), 626-642.
• Fisher, M.L. Jaikumar, R. (1981). A Generalized Assignment Heuristic for Vehicle Routing. Networks, (11), 109-124.
• Fukasawa, R., Lysgaard, J., de Aragao, M.P. Reis, M. Uchoa, E. Werneck, R.F. (2004). Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. W: D. Bienstock, G. Nemhauser (red.): IPCO 2004, LNCS 3064 (1-15). Springer-Verlag.
• Gendreau, M., Laporte, G., Musaraganyi, Ch., Taillard, E.D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research, (26), 1153-1173.
• Glasser, G.J. (1969). Planned replacement: Some theory and its application. Journal of Quality Technology, 1 (2), 110-119.
• Golden, B. Raghavan, S. Wasil E. (red.). (2008). The vehicle routing problem: Latest advances and new challenges. New York: Springer Science and Business Media.
• Golden, B., Assad, A.A., Levy, L., Gheysens, F.J. (1984). The fleet size and mix vehicle routing problem. Computers Operations Research, (11), 49-65.
• Golden, B.L. (1975). Vehicle routing problems: formulations and heuristic solution techniques. Massachusetts: Operations Research Center, Massachusetts Institute of Technology (Raport nr 113).
• Gould, J. (1969). The size and composition of a road transport fleet. Operational Research Quarterly, (20), 81-92.
• Hall, N.G., Sriskandarajah, C., Genesharajah, T. (2001). Operational decisions in AGV-served flowshop loops: fleet sizing and decomposition. Annals of Operations Research, 107 (1-4), 189-209.
• Hillier, F., Lieberman, G. (2010). Introduction to operations research. New York: McGraw-Hill.
• Hines, T. (2004). Supply Chain Strategies. Oxford: Elsevier Butterworth-Heinemann.
• Jacobs, F.R., Chase, R.B. (2010). Operations and Supply Management. The Core. New York: McGraw-Hill/Irwin.
• Jardine, A.K.S. (1973). Maintenance, replacement and reliability. London: Pitman Publishing.
• Kacprzak, M. (2012). Wpływ wybranych czynników na wykorzystanie intuicji w procesie decyzyjnym. W: A. Grzegorczyk (red.), Procesy decyzyjne w warunkach niepewności (49-65). Warszawa: Wyższa Szkoła Promocji.
• Kara, I. Bektas, T. (2003). Integer linear programming formulation of the generalized vehicle routing problem. Referat wygłoszony na: 5th EURO/INFORMS Joint International Meeting. Istanbul.
• Koo, P-H., Jang, J., Suh. J. (2005). Estimation of part waiting time and fleet sizing in AGV systems. The International Journal of Flexible Manufacturing Systems, 16 (3), 211-228.
• Laporte, G. (1992). The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of Operational Research, (59), 345-358.
• Laporte, G., Nobert, Y., Desrochers, M. (1985). Optimal routing under capacity and distance restrictions. Operations Research, (33), 1050-1073.
• Milosavljevic, N., Teodorovic, D., Papie, V., Pavkovic, G. (1996). A Fuzzy Approach to the Vehicle Assignment Problem. Transportation Planning and Technology, 20 (1), 33-7.
• Min, H. (1998). A personal-computer assisted decision support system for private versus common carrier selection. Transportation Research Part E, 34 (3), 229-241.
• Nakagawa, T. (1984). A summary of discrete replacement policies. European Journal of Operational Research, (17), 382-392.
• Osman, I., Salhi, S. (1996). Local search strategies for the vehicle fleet mix problem. W: V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, G.D. Smith (red.), Modem Heuristic Search Methods. (131-153), New York: Wiley.
• Parikh, S.C. (1977). On a fleet sizing and allocation problem. Management Science, 23 (9), 972-977.
• Petering, M.E.H. (2011). Decision support for yard capacity, fleet composition, truck substitutability, and scalability issues at seaport container terminals. Transportation Research Part E, (47), 85-103.
• Pilot, C., Pilot, S. (1999). A model for allocated versus actual costs in assignment and transportation problems. European Journal of Operational Research, 112 (3), 570-581.
• Redmer, A. (2009). Optimisation of the exploitation period of individual vehicles in freight transportation companies. Transportation Research Part E, 45 (6), 978-987 (DOI number: 10.1016/j. tre. 2009.04.015).
• Redmer, A. (w druku). Zarządzanie strategiczne taborem samochodowym — tabor własny czy obcy? LogForum.
• Redmer, A., Kiciński, M., Rybak, R. (2013). Zarządzanie samochodowym taborem ciężarowym — istota i zakres. Gospodarka Materiałowa i Logistyka, 7,13-20.
• Rego, C. (2001). Node Ejection Chains for the Vehicle Routing Problem: Sequential and Parallel Algorithms. Parallel-Computing, (27), 201-222.
• Renaud, J., Boctor, F.F. (2002). A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research, (140), 618-628.
• Romanow, P. (2003). Zarządzanie transportem przedsiębiorstw przemysłowych. Poznań: Wydawnictwo WSL.
• Ropke, S., Pisinger, D. (2005). A generał heuristics for vehicle routing problems. Copenhagen: Department of Computer Science, University of Copenhagen.
• Ryan, D.M., Hjorring, C., Glover, F. (1993). Extensions of the Petal Method for Vehicle Routing. Journal of the Operational Research Society, (44), 289-296.
• Sikora, S. (red.). (2008). Badania operacyjne. Warszawa: PWE.
• Szaban, J.M. (2012). Problemy współczesnego zarządzania. Współczesne Zarządzanie, (4), 11-20.
• T'kindt, V., Billaut, J.-C. (2006). Multicriteria Scheduling. Theory. Models and Algorithms. Berlin, Heidelberg: Springer-Verlag.
• Taillard, E.D. (1993). Parallel Iterative Search Methods for Vehicle Routing Problems. Networks, (23), 661-673.
• Thompson, P.M., Psaraftis, H.N. (1993). Cyclic Transfer Algorithms for the Multivehicle Routing and Scheduling Problems. Operations Research, (41), 935-946.
• Toth, P. Vigo, D. (2002). The vehicle routing problem. Philadelphia: Society for Industrial and Applied Mathematics.
• Trocki, M. (2001). Outsourcing. Warszawa: PWE.
• Twaróg, J. (2004). Logistyczne wskaźniki oceny transportu w przedsiębiorstwie produkcyjnym. Logistyka, (2), 27-30.
• Vukadinovic, K., Teodorovic, D., Pavkovic, G. (1999). An Application of Neurofuzzy Modeling: The Vehicle Assignment Problem. European Journal of Operational Research, 114 (3), 474-488.
• Wu, P., Hartmann, J.C., Wilson, G.R. (2005). An integrated model and solution approach for fleet sizing with heterogeneous assets. Transportation Science, (39), 87-103.
• Yang, J., Jaillet, P., Mahmassani, H.S. (1999). On-Line Algorithms for Truck Fleet Assignment and Scheduling under Real-Time Information. Transportation Research Record, 1667 (1), 107-113.
• Yepes, V., Medina, J. (2006). Economic Heuristic Optimization for Heterogeneous Fleet VRPHESTW. Journal of Transportation Engineering, 132 (4), 303-311.
• Zwierzchowski, S., Żak, J., Kiciński, M. (2003). Opracowanie metody zarządzania obsługiwaniem pojazdów ciężarowych. Poznań: Instytut Maszyn Roboczych i Pojazdów Samochodowych, Politechnika Poznańska (Raport nr 51-977/2003).
• Żak, J., Redmer, A., Sawicki, P. (2001). Optymalizacja wielokryterialna liczebności pracowników w przedsiębiorstwie transportowym. Zeszyty Naukowe Wydziału Mechanicznego Politechniki Koszalińskiej, (28), 445-54.
• Żak, J., Sawicki, P., Redmer, A. (1999). Multiobjective optimization of the fleet size in the freight transportation company. Refeerat wygłoszony na: Conference proceedings of 15th Triennial Conference IFORS'99, Beijing (China).
• http://www.businessdictionary.com (01.09.2013).