透過您的圖書館登入
IP:18.218.61.16
  • 期刊

A HEURISTIC ALGORITHM OF VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND LESS-THAN-TRUCKLOAD CARRIER SELECTION

若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


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.

被引用紀錄


張翰(2016)。粒子群演算法應用於非相關平行機台問題最大完工時間最小化之研究〔碩士論文,逢甲大學〕。華藝線上圖書館。https://doi.org/10.6341/fcu.m0327583

延伸閱讀