A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder

碩士 === 國立臺灣海洋大學 === 商船學系所 === 98 === Because the increasingly competitions among international shipping industry, a consignor requires more, faster, and cheaper services. The most important operation of freight forwarder is to allocate the space of container and to determine quantity and type of con...

Full description

Bibliographic Details
Main Authors: Dian-chian Wu, 吳典樵
Other Authors: Wei-kuo Tseng
Format: Others
Language:zh-TW
Published: 2010
Online Access:http://ndltd.ncl.edu.tw/handle/32903154531603324836
id ndltd-TW-098NTOU5728006
record_format oai_dc
spelling ndltd-TW-098NTOU57280062015-10-13T19:35:32Z http://ndltd.ncl.edu.tw/handle/32903154531603324836 A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder 多場站海運貨物承攬運送業配櫃作業數學規劃模式之研究 Dian-chian Wu 吳典樵 碩士 國立臺灣海洋大學 商船學系所 98 Because the increasingly competitions among international shipping industry, a consignor requires more, faster, and cheaper services. The most important operation of freight forwarder is to allocate the space of container and to determine quantity and type of containers. The operations are frequent and complex. If the operators process the job intuitively, it will cost economic loss and deteriorate the operational efficiency and service standard. The consolidators need to assign the cargoes to specific containers, the optimization problems of allocation is to find the minimum cost considering capacity, weight, dimensions of each cargo of shipping order. The consistence of shipping order relating to the others and the sequence of terminals of loading and discharge are also considered. The main method is to transform the limitations of loading cargoes into the constrain of integer programming. The programming is divided into two stages: the first stage is to minimize the cost of objective function. Then utilizing this integer programming obtains the quantity of each container type in each container freight station. However, as the total cost attains minimum, the multiple solutions exist. Therefore, it’s advantageous to the loading operation by adjusting the more remaining quantity in the first container freight station at the approximately minimum cost. The second stage is to assign the specific cargoes to the specific containers using binary programming. After calculating, we can obtain shipping order’s number in each container and the remaining space of container. It’s useful to exchange cargoes with other consolidators in the container freight station. In this study, the data acquired from the industry transform into the corresponding format applying into the programming model. These results given by our own developing Excel add-in not only give practical and efficient solutions of cargoes allocation but also meet the needs of operators and managers. Wei-kuo Tseng 曾維國 2010 學位論文 ; thesis 65 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立臺灣海洋大學 === 商船學系所 === 98 === Because the increasingly competitions among international shipping industry, a consignor requires more, faster, and cheaper services. The most important operation of freight forwarder is to allocate the space of container and to determine quantity and type of containers. The operations are frequent and complex. If the operators process the job intuitively, it will cost economic loss and deteriorate the operational efficiency and service standard. The consolidators need to assign the cargoes to specific containers, the optimization problems of allocation is to find the minimum cost considering capacity, weight, dimensions of each cargo of shipping order. The consistence of shipping order relating to the others and the sequence of terminals of loading and discharge are also considered. The main method is to transform the limitations of loading cargoes into the constrain of integer programming. The programming is divided into two stages: the first stage is to minimize the cost of objective function. Then utilizing this integer programming obtains the quantity of each container type in each container freight station. However, as the total cost attains minimum, the multiple solutions exist. Therefore, it’s advantageous to the loading operation by adjusting the more remaining quantity in the first container freight station at the approximately minimum cost. The second stage is to assign the specific cargoes to the specific containers using binary programming. After calculating, we can obtain shipping order’s number in each container and the remaining space of container. It’s useful to exchange cargoes with other consolidators in the container freight station. In this study, the data acquired from the industry transform into the corresponding format applying into the programming model. These results given by our own developing Excel add-in not only give practical and efficient solutions of cargoes allocation but also meet the needs of operators and managers.
author2 Wei-kuo Tseng
author_facet Wei-kuo Tseng
Dian-chian Wu
吳典樵
author Dian-chian Wu
吳典樵
spellingShingle Dian-chian Wu
吳典樵
A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder
author_sort Dian-chian Wu
title A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder
title_short A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder
title_full A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder
title_fullStr A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder
title_full_unstemmed A Study of the Mathematical Programming Model for Multiple-Depot Container Load Planning of Freight Forwarder
title_sort study of the mathematical programming model for multiple-depot container load planning of freight forwarder
publishDate 2010
url http://ndltd.ncl.edu.tw/handle/32903154531603324836
work_keys_str_mv AT dianchianwu astudyofthemathematicalprogrammingmodelformultipledepotcontainerloadplanningoffreightforwarder
AT wúdiǎnqiáo astudyofthemathematicalprogrammingmodelformultipledepotcontainerloadplanningoffreightforwarder
AT dianchianwu duōchǎngzhànhǎiyùnhuòwùchénglǎnyùnsòngyèpèiguìzuòyèshùxuéguīhuàmóshìzhīyánjiū
AT wúdiǎnqiáo duōchǎngzhànhǎiyùnhuòwùchénglǎnyùnsòngyèpèiguìzuòyèshùxuéguīhuàmóshìzhīyánjiū
AT dianchianwu studyofthemathematicalprogrammingmodelformultipledepotcontainerloadplanningoffreightforwarder
AT wúdiǎnqiáo studyofthemathematicalprogrammingmodelformultipledepotcontainerloadplanningoffreightforwarder
_version_ 1718042855854833664