Please use this identifier to cite or link to this item:
|Title: ||A Heuristic Algorithm for the Truckload VS Less-Than-Truckload Problem|
|Authors: ||Ching-Wu Chu|
|Keywords: ||Vehicle routing;Heuristics;0–1 integer programming;Logistics|
|Issue Date: ||2017-05-01T08:20:02Z
|Publisher: ||European Journal of Operational Research|
|Abstract: ||The delivery of goods from a warehouse to local customers is an important and practical problem of a logistics manager. In reality, we are facing the fluctuation of demand. When the total demand is greater than the whole capacity of owned trucks, the logistics managers may consider using an outsider carrier.
Logistics managers can make a selection between a truckload (a private truck) and a less-than-truckload carrier (an outsider 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 with limited capacity from a central warehouse to customers with known demand. The objective of this paper is developing a heuristic algorithm to route the private trucks and to make a selection of less-than-truckload carriers by minimizing a total cost function. Both the mathematical model and the heuristic algorithm are developed. Finally, some computational results and suggestions for future research are presented.
|Relation: ||165(3) pp.657-667|
|Appears in Collections:||[航運管理學系] 演講及研討會|
Files in This Item:
There are no files associated with this item.
All items in NTOUR are protected by copyright, with all rights reserved.