IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Transporter Scheduling Based on a Network Flow Model for Dynamic Block Transportation Environment

동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획

  • Lee, Woon-Seek (Systems Management and Engineering, Pukyong National University) ;
  • Lim, Won-Il (CS2 Team, DK UNC Co., Ltd.) ;
  • Koo, Pyung-Hoi (Systems Management and Engineering, Pukyong National University)
  • 이운식 (부경대학교 시스템경영공학과) ;
  • 임원일 (DK유엔씨(주) CS2팀) ;
  • 구평회 (부경대학교 시스템경영공학과)
  • Received : 2008.09.24
  • Accepted : 2008.12.22
  • Published : 2009.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

Keywords

References

  1. Baker, E. K. (1983), An Exact Algorithm for the Time-Constrained Traveling Salesman Problem,Opns. Res., 31, 939-945 https://doi.org/10.1287/opre.31.5.938
  2. Bard, J. F.,Kontoravdis,G., andYu,G. (2002),ABranch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows, Transportation Sci., 36, 250-269 https://doi.org/10.1287/trsc.36.2.250.565
  3. Bianco, L., Mingozzi, A., and Sicciardelli, S. (1998), Dynamic Programming Strategies for the Traveling Salesman Problem with Time Windows and Precedence Constraints,Opns. Res., 45, 365-378 https://doi.org/10.1287/opre.45.3.365
  4. Calvo, R.W. (2000), ANewHeuristic for the Traveling Salesman Problemwith TimeWindows, Transportation Sci., 34, 113-124 https://doi.org/10.1287/trsc.34.1.113.12284
  5. Chao, I. M. (2002), A Tabu Search Method for Truck and Trailer Routing Problem,Computers andO.R., 29, 33-51 https://doi.org/10.1016/S0305-0548(00)00056-3
  6. Crainic, T. G. and Laporte, G. (1998), Fleet Management and Logistics, Kluwer Academic Publishers
  7. Desrosiers, J., Sauve,M., and Soumis, F. (1988), Lagrangian RelaxationMethods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with TimeWindows,Management Sci., 34, 1005-1022 https://doi.org/10.1287/mnsc.34.8.1005
  8. Dumas, Y., Desrosiers, J., Gelinas, E., and Solomon,M.M. (1995), AnOptimal Algorithm for the Traveling Salesman Problem with TimeWindows,Opns. Res., 45, 367-371 https://doi.org/10.1287/opre.43.2.367
  9. Gendreau, M., Hertz, A., Laporte, G., and Stan, M. (1998), A Generalized InsertionHeuristic for the Traveling Salesman ProblemwithTimeWindows, Opns. Res., 46, 330-335 https://doi.org/10.1287/opre.46.3.330
  10. Joo, C.M., Lee,W. S.,Koo, P.H., and Lee,K. B. (2006), Transporter Scheduling for Block Transportation in Shipbuilding, J. of theKoreaManagementEngineers Society, 11(3), 169-179
  11. Ko, C. S., Jung,K.H., and Shin, J.Y. (2000),Determination ofVehicle Fleet Size for Container Shuttle Service,Management Science, 17(2), 87-95
  12. Koo, P.H., Lee,W. S., and Jang,D.W. (2004), Fleet Sizing andVehicle Routing for Container Transportation in a Static Environment, OR Spectrum, 26, 193-209 https://doi.org/10.1007/s00291-003-0152-4
  13. Langevin, A., Desrochers, M., Kesrosiers, J., and Foumis, F. (1993), A Two Commodity Flow Formulation for the Traveling Salesman and Makespan Problems with TimeWindows,Network, 23, 631-640 https://doi.org/10.1002/net.3230230706
  14. Laporte, G. andOsman,H. (1995), Routing Problems : a Bibliography,Annal of OR., 61, 227-262
  15. Lee,W. S., Lim,W. I.,Koo, P.H., and Joo, C.M. (2008), Transporter Scheduling for Dynamic Block Transportation Environment, IE Interfaces, 21(3), 274-282
  16. Lim, W. I., Lee, W. S., Koo, P. H., and Kim, D. J. (2008), A Transporter Scheduling SystemforDynamic Block Transportation Environment, J. of the Korea Management Engineers Society, 13(2), 55-71
  17. Maxwell, W. L. and Muckstadt, J. A. (1982), Design of Automated Guided Vehicle Systems, IIE Trans., 14, 114-124 https://doi.org/10.1080/05695558208974590
  18. Pesant, G., Gendreau, M., Potvin, J.-Y., and Rousseau, J.-M. (1998), An Exact Constraint Logic Programming Algorithmfor the TSPwith TimeWindows, Transportation Sci., 32, 12-29 https://doi.org/10.1287/trsc.32.1.12
  19. Savelsbergh, M. W. P. (1985), Local Search in Routing Problems with Time Windows,Ann. Opns. Res., 4, 285-305 https://doi.org/10.1007/BF02022044
  20. The Korea Shipbuilder’s Association, www.koshipa.or.kr