Calculating Empty Moves in Transportation Networks

수송 네트워크에서 빈 장비 흐름의 계산법

  • Kim, Kap Hwan (Department of Industrial Engineering, Pusan National University)
  • Published : 2005.09.30

Abstract

Empty moves are necessary when there are imbalances among transportation demands from source locations to destination locations and the transportation demands require empty equipment that must be supplied to source locations. When the amount of the inflow exceeds that of the outflow or the amount of the outflow exceeds that of the inflow, repositioning empty equipment is necessary. Examples of the empty equipment are containers, chassis, and pallets. This paper addresses how to estimate the empty moves on several typical transportation networks. Types of transportation networks considered are chain, tree, cycle, tree of cycles, and hybrid networks. Simple procedures are suggested for determining the optimal empty flows. Numerical examples are provided to illustrate procedures in this paper.

Keywords

Acknowledgement

Supported by : 한국과학재단

References

  1. Abrache, J., Crainic, T. G., Gendreau, M. (2001), A New Decomposition Algorithm for the Deterministic Dynamic Allocation of Empty Containers, http://www.crt.umontreal.ca/-theo/articles.html
  2. Crainic, T. G., Dejax, P., and Delorme, L. (1989), Models for Multimode Multicommodity Location Problems with Interdepot Balancing Requirements, Annals of Operations Research, 18, 279-302
  3. Crainic, T. G. and Gendreau, M. (1990), Modelling the Container Fleet management Problem using a Stochastic Dynamic Approach, CRT-685, Centre de recherche sur les transports
  4. Crainic, T. G., Gendreau, M., Soriano, P., Toulouse M. (1993a), A Tabu Search Procedure for Multicommidity Location/Allocation with Balancing Requirements, Annals of Operations research, 41, 359-383 https://doi.org/10.1007/BF02023001
  5. Crainic, T. G., Gendreau, M., and Dejax, P. (1993b), Dynamic and Stochastic Models for the Allocationof Empty Containers, Operations Research. 41(1), 105-125 https://doi.org/10.1051/ro:2007007
  6. Crainic, T. G. and Delorme, L. (1993c), Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirement, Transportation Science 27, 90-101 https://doi.org/10.1287/trsc.27.2.90
  7. Crainic, T. G. and Laporte, G. (1997), Planning Models for Freight Transportation, European Journal of Operational Research 97, 409-438 https://doi.org/10.1016/S0377-2217(96)00298-6
  8. Daganzo, C. F. and Smilowitz, K. R. (2000), Asymptotic Approximation for the Transportation LP and Other Scalable Network Problems, Working paper, Institute of Transportation Studies, University of California, Berkeley
  9. Dejax, P. J. and Crainic, T. G. (1987), A Review of Empty Flows and Fleet Management Models on Freight Transportation, Transportation Science 21, 227-247 https://doi.org/10.1287/trsc.21.4.227
  10. Du, Y. and Hall, R. (1997), Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation Networks, Management Science, 43(2), 145-157 https://doi.org/10.1287/mnsc.43.2.145
  11. Gen, M. and Cheng, R. (1997), Genetic Algorithms and Engineering Design, John Wiley& Sons,New York
  12. Gedron, B. andCrainic, T. G. (1997), A Parallel Branch-and Bound Algorithm for Multi-commodity Location with Balancing Requirements, Computers & Operations Research, 24(9), 829-847 https://doi.org/10.1016/S0305-0548(96)00094-9
  13. Hall, R. W. (1999), Stochastic Freight Flow Patterns: Implications for Fleet Optimization, Transportation Research A 33, 449-465
  14. Lai, K. K., Lam, K. K. and Chan, D. (1995), Shipping Container Logistics and Allocation, Journal of the Operational Research Society 46, 687-697 https://doi.org/10.1057/jors.1995.98
  15. Shen, W. S. and Khoong, C. M. (1995), A DSS for Empty Container Distribution Planning, Decision Support Systems 15, 75-82 https://doi.org/10.1016/0167-9236(94)00037-S