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

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

Title: A heuristic algorithm for multiple trip vehicle routing problem with time window constraint and outside carrier selection
Authors: Chao-Sheng Wu
Ching-Wu Chu
Hsiu-Li Hsu
Contributors: 國立臺灣海洋大學:航運管理學系
Keywords: less-thantruckload
vehicle routing problem with time windows
0-1 integer programming.
Date: 2017
Issue Date: 2018-06-13T03:46:44Z
Publisher: Journal of Marine Science and Technology
Abstract: Abstract: The Vehicle Routing Problem with time windows is an important and practical problem for logistics managers. In reality, when facing fluctuations of demand, logistics managers may consider using an outside carrier to satisfy partial customer demand during the peak season. That is, the logistics managers must make a selection between a truckload (a private truck) and a less-than-truckload carrier (an outside carrier). Selecting the right mode to transport a shipment may bring significant cost savings to the company. In this paper, we address the problem of routing a fixed number of trucks from a central warehouse to customers with known demand and time windows. A heuristic algorithm is developed
for routing the private trucks with time windows and for selecting of less-than-truckload carriers by minimizing the total cost function. Computational results are encouraging and some suggestions for future research are presented.
Relation: 25(2) pp.129-141
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/46932
Appears in Collections:[航運管理學系] 期刊論文

Files in This Item:

File Description SizeFormat

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