English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26988/38789
Visitors : 2348053      Online Users : 35
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43267

Title: A network model for solving the yard truck routing and scheduling problem
Authors: Feng-Ming Tsai;Chung-Cheng Lu;Yu-Ming Chang
Contributors: 國立臺灣海洋大學:航運管理學系
Keywords: Transportation decisions;Transportation management
Date: 2016
Issue Date: 2017-06-12T08:36:20Z
Publisher: The International Journal of Logistics Management
Abstract: Purpose
– The purpose of this paper is to improve the efficiency of loading and discharging operations in container terminals. Accounting for an increase in the size of ships, the yard truck (YT) routing and scheduling problem has become an important issue to terminal operators.

Design/methodology/approach
– A (binary) integer programming model is developed using the time-space network technique to optimally move YTs between quay cranes (QC) and yard cranes (YC) in the time and space dimensions. The objective of the model is to minimize the total operating cost, and the model employs the M/M/S model in the queuing theory to determine the waiting time of YTs. The developed model can obtain the optimal number of YTs and their scheduling and routing plans simultaneously, as shown by the computational results.

Findings
– The results also show that the model can be applied to practical operations. In this research, an experimental design of the QC and YC operation networks was considered with the import and export containers carried by YTs. The model can be used to tackle a real world problem in an international port, and the analysis results could be useful references for port operators in actual practice.

Research limitations/implications
– The purpose of this research only focusses on YTs routing and scheduling problem, however, the container terminal operation problems are interrelated with berth allocation and yard stacking plan. The managerial application of this study is to analyze the trade-off between truck numbers and truck waiting time can be used for terminal operators to adjust the truck assignment. This research can assist an operator to determine the optimal fleet size and schedule in advance to avoid wasted costs and congestion in the quayside and yard block.

Originality/value
– This research solves the YT scheduling and routing problem for container discharging and loading processes with a time-space network model, which has not been previously reported, through an empirical research.
Relation: 27(2) pp.353-370
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43267
Appears in Collections:[航運管理學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML34View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback