Weitere Kapitel dieses Buchs durch Wischen aufrufen
Long haul transportation system operational planning implies to solve a capacitated dynamic network optimization problem, aiming to perform the freight movements in an efficient and effective way, utilizing the available transportation capacity. This work employs an approximate adaptive dynamic programming to solve this kind of problem, introducing a network modeling to manage demands not attended, with the payment of penalties, or the utilization of third parties transportation firms to avoid the payment of such penalties. The proposed methodology employs a dynamic programming model applied to each stage of the problem instead of a network global optimization procedure. A heuristic is used to estimate the value of future state functions transferred from a current stage to future ones. This technique greatly reduces the quantity of involved variables, allowing the utilization of more realistic mathematical models on a longer planning horizon. Results from a successful application of the model with the utilization of the Jensen Network Solver are presented.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Crainic, T.G. (2003) Long- haul freight transportation. In: Handbook of transportation science, Randolph W. Hall (ed.). 2nd. edition. Boston: Kluwer Academic Publishers.
Crainic, T., Roy J. (1992) Design of regular intercity driver routes for the LTL motor carrier industry. Transportation Science, Baltimore, v. 26, pp. 280–295.
Frantzeskakis, L.F., Powell, W.B. (1990) A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Science, Baltimore, v. 24 (1), pp. 40–57.
Godfrey, G.A., Powell, W.B. (2001) An adaptive, distribution free algorithm for the Newsvendor Problem with censored demands, with applications to inventory and distribution problems. Management Science, v. 47 (8).
Godfrey, G.A., Powell, W.B. (2002a) An adaptive dynamic programming algorithm for dynamic fleet management, I: single period travel times. Transportation Science, Baltimore, v. 36 (1), pp. 21–39.
Godfrey, G.A., Powell, W.B. (2002b) An adaptive dynamic programming algorithm for dynamic fleet management, II: multiperiod travel times. Transportation Science, Baltimore, v. 36 (1) pp. 40–54.
Gualda, Nicolau Dionísio Fares (1995) Terminais de transportes: contribuição ao planejamento e ao dimensionamento operacional. Tese (Livre-Docência) – Departamento de Engenharia de Transportes, Escola Politécnica da Universidade de São Paulo, São Paulo.
Haghani, A. (1989) Formulation and solution of a combined train routing and makeup, and empty car distribution model. Transportation Research, v. 23B (6), pp. 433–452.
Hane, C., Barnhart, C., Johnson, E., Marsten, R., Nemhauser, G., Sigismondi G. (1995) The fleet assignment problem: solving a large-scale integer program. Mathematical Programming, Amsterdan, v. 70, pp. 211–232.
Jensen, P.A. (2008) Operations Research Models and Methods. Internet: http://www.me.utexas.edu/~jensen/ORMM/. Acesso em 13 fev. 2008.
Pidd, M. (1999) Just modeling through: a rough guide to modeling. Interfaces, v. 29 (2), pp. 118–132.
Powell, W.B. (1986) A stochastic model of the dynamic vehicle allocation problem. Transportation Science, v. 20 (2), pp. 117–129.
Powell, W.B. (2003) Dynamic models of transportation operations. In: Handbooks in Operations Research and management science, 11: Supply Chain Management: design, coordination and operation. A.G. de Kok e Stephen C. Graves (eds.), Amsterdam; Boston: Elsevier.
Powell, W.B., Carvalho, T.A. (1998) Dynamic control of logistics queueing networks for large-scale fleet management. Transportation Science, v. 32 (2), pp. 90–109.
Powell, W.B., Sheffi, Y. (1989) Design and implementation of an interactive optimization system for network design in the motor carrier industry. Operations Research, v. 37 (1), pp. 12–29.
Powell, W.B., Carvalho, T.A., Godfrey, G.A., Simão. H.P. (1995a) Dynamic fleet management as a logistics queueing network. Annals of Operations Research, v. 61, pp. 165–168.
Powell, W.B., Jaillet, P., Odoni, A. (1995b) Stochastic and dynamic networks and routing. In: Handbook in Operations Research and Management Science, 8: Network Routing. M.O. Ball et al. (eds), Amsterdam; Boston: Elsevier, pp. 141–295.
Topaloglu, H., Powell, W.B. (2006) Dynamic programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS Journal on Computing, v. 18 (1), pp. 31–42.
- Long Haul Trucks Dynamic Assignment with Penalties
Antonio Martins Lima Filho
Nicolau D. F. Gualda
- Springer Berlin Heidelberg
Neuer Inhalt/© Stellmach, Neuer Inhalt/© Maturus, Pluta Logo/© Pluta, digitale Transformation/© Maksym Yemelyanov | Fotolia