A Service Network Design Model for Rail Freight Transportation with Hub-and-spoke Strategy

Hub-and-spoke 운송전략을 고려한 철도화물서비스 네트워크디자인모형의 개발

  • Published : 2004.06.30

Abstract

The Hub-and-spoke strategy is widely used in the field of transportation. According to containerization and the development of transshipment technology, it is also introduced into European rail freight transportation. The objective of this article is to develop a service network design model for rail freight transportation based on the Hub-and-spoke strategy and efficient algorithms that can be applied to large-scale network. Although this model is for strategic decision, it includes not only general operational cost but also time-delay cost. The non-linearity of objective function due to time-delay factor is transformed into linearity by establishing train service variables by frequency. To solve large scale problem, this model used a heuristic method based on decomposition and three newly-developed algorithms. The new algorithms were examined with respect to four test problems base on the actual network of European rail freight and discussed the accuracy of solutions and the efficiency of proposed algorithms.

Hub-and-spoke운송은 교통분야에서 널리 이용되고 있는 운송전략의 대표적 개념이다. 화물의 컨테이너화와 환적기술의 발달로 최근 유럽을 중심으로 철도화물운송부문에서도 이 운송전략의 적용사례가 나타나고 있다. 이에 본 연구는 Hub-and-spoke운송전략을 구현하는 철도화물서비스네트워크 디자인모형을 제시하고, 대규모 운송망에도 적용이 가능한 효율적 알고리즘을 개발하였다. 개발되는 모형이 전략적 수준의 계획모형임에도 불구하고 모형에서는 일반화된 운영비용 외에 열차속도, 서비스빈도, 터미널에서의 화물처리속도 등에 따른 시간지체비용도 고려되었다. 시간지체비용의 고려에 따라 야기되는 목적함수의 비선형성은 빈도별 서비스결정변수의 설정을 통해 선형최적화문제로 표현되었다. 규모가 큰 네트워크의 경우 해도출의 어려움 때문에 본 논문은 전체문제의 분할(decomposition)에 기초한 휴리스틱방법((heuristic method)으로 문제를 해결하고자 하였다. 해도출의 효율성을 높이기 위해 서비스빈도개선과 관련하여 3개의 알고리즘이 개발되었고, 개발된 알고리즘은 유럽의 실제네트워크를 기초로 도출한 4개의 테스트문제를 대상으로 해의 정확도와 해 도출의 효율성이 비교 평가되었다.

Keywords

References

  1. Assad, A.A. (1980), 'Modelling of rail networks: toward a routing/makeup model', Transportation Research-B, vol.14B, pp.101-114
  2. Bodin. L.D., Golden. B.L. and Schuster, A.D., et al. (1980), 'A model for the blocking of trains', Transportation Research-B, vol.14B, pp.115-120
  3. Cranic, T.G., Ferland, J.A. and Rousseau, J.M. (1984), 'A tactical planning model for rail freight transportation', Transportation Science, vol.18, No.2, pp.165-184 https://doi.org/10.1287/trsc.18.2.165
  4. Cranic, T.G. and Rousseau, J.M. (1986), 'Multicommodity, multimode freight transportation: a general modeling and algorithmic framework for the service network design problem', Transportation Research-B, vol.20B, No.3, pp.225-242
  5. Haghani, A.E. (1989), 'Formulation and solution of a combined train routing and makeup, and empty car distribution model', Transportation Research-B, vol.23B, No.6, pp.433-452
  6. INRETS(Coordinator, 2000), 'Intermodal Quality: SIMIQ', Project funded by the European Commission. deliverable 6, 67p
  7. Keaton, M.H. (1989), 'Designing optimal rairoad operating plans: Lagrangian relaxation and heuristic approaches', Transportation Research-B, vol.23B, No.6, pp.415-431
  8. Keaton, M.B. (1992), 'Designing rairoad operating plans: a dual adiustment method for implementing Lagrangian relaxation', Transportation Science, vol.26, No.4, pp.263-279 https://doi.org/10.1287/trsc.26.4.263
  9. Magnanti, T.L. and Wong, R.T. (1984), 'Network design and transportation planning: model and algorithms', Transportation Science, vol.18, pp.1-55 https://doi.org/10.1287/trsc.18.1.1
  10. Marin, A and Salmeron, J. (1996a), 'Tactical design of rail freight networks. Part I: Exact and heuristic methods', European Journal of Operational Research, vol.90, pp.26-44 https://doi.org/10.1016/0377-2217(94)00334-3
  11. Marin, A. and Salmeron, J. (1996b), 'Tactical design of rail freight networks. Part II: Local search methods with statistical analysis', European Journal of Operational Research, vol.94, pp.43-53 https://doi.org/10.1016/0377-2217(95)00193-X
  12. Nierat, P. (1998), 'Anatomie d'un reseau intermodal Hub-and-spoke', Rapport INRETS $N\circ$220, Arcueil, p.75
  13. Touati, N. (1996), 'Modeles et algorithmes pour loptimisation de loffre de transport combine dans un reseau de services avec demande elastique', These a l Ecole Central de Paris