English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27287/39131
Visitors : 2444712      Online Users : 34
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/41829

Title: Modeling and solution for yard truck dispatch planning at container terminal
Authors: Hua-An Lu
Jing-Yi Jeng
Contributors: 國立臺灣海洋大學:航運管理學系
Keywords: min-max nonlinear integer programming model
yard trucks
quay crane
yard area
Date: 2005
Issue Date: 2017-03-29T07:22:58Z
Abstract: Abstract: This research addresses the dispatch planning of yard trucks to support transferring tasks of containers between shipside and yard areas. With considering the fundamental operations of fixed number of trucks serving one quay crane, we discuss the possible serving status of yard trucks in the connection of task by task. Upon these limited connection patterns, we formulate a min-max nonlinear integer programming model for dispatching yard trucks to efficiently complete the system works. A heuristic approach with two phases of selecting locations for stored or picked containers then assigning served trucks is suggested. We apply it with four proposed principles of location assignment on the analysis of the real-world cases from a dedicated terminal. The results show that the closest position assignment principle is better in the larger scale problems. However, more trucks than the critical number can not increase the performance.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41829
Appears in Collections:[航運管理學系] 演講及研討會

Files in This Item:

File Description SizeFormat
index.html0KbHTML48View/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