The Load Planning Problem of Freight Forwarders

• Main Authors: Jia-Liang Chen, 陳嘉良
• Other Authors: Chuen-Yih Chen
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/44440023317256079406

碩士 === 長榮大學 === 經營管理研究所 === 94 === Conventionally, freight forwarders make use of one consolidation and one break-bulk procedure to transport less-than-container-load cargoes. However, in order to have better customer service, their may offers various procedures, for example, multiple consolidations in the way of carrying cargoes to their destinations. Corresponding to these various procedures, freight forwarders need have a more flexible operation network. This paper makes an attempt to describe what kind of operation networks needed if freight forwarders offer various consolidations/break-bulk procedures. Furthermore, if freight forwarders transport less-than-container-load cargoes with a flexible operation network, their will face the load planning problem, simultaneously to decide what routes the cargoes should be transported and what kinds of containers should be choose to load these cargoes. This paper makes use of the multicommodity network flow problem to develop an optimization model for this load planning problem. This model is evaluated by a test case. The computation results seem promising. However, a real-world case should be tested in the future research.