在物流系統中具優先次序之車輛路徑指派問題探討

Vehicle Routing Problem with Precedence Constraint for Distribution System

林瑞明(Ruey-Ming Lin)

指導教授 ： 張百棧

元智大學/工程學院/工業工程與管理學系/碩士(1994年)

摘要

在多層次產配銷系統裡，生產者將生產產品運送至配銷中心儲放，配銷中
心再按零售商需求，把貨品運送至零售商，終端客戶依所需至零售商店購
買。本研究所研討的問題以配銷中心的觀點看車輛路線指派問題，假設某
些物品須先至製造商處搬取，再送給零售商。一來可加強顧客服務水準，
二來降低配銷中心庫存成本。本問題應用類神經網路解題方式尋求解答，
藉類神經網路平行運算的優點幫助我們在短時間內得到可行解，甚至最佳
解。並以電腦程式模擬結果，分析類神經網路對問題的解答效果。

關鍵字

配銷中心 ； 車輛路線指派 ； 類神經網路

並列摘要

The Vehicle Routing Problem（VRP）is a very important operation
within a multiechelon warehousing and chains stores system﹒The
problem of VRP is to transport aecessing stocks or pre-odering
from the warehouse to the retailer with a minimum
transportation cost（or minimum transportation distance）and
satisfying some restrictive constraints﹒ The problem that we
are dealing with is to add a new constraint which will retrict
the vehicle to pickup certain merchandise for the manufacture
before delivery﹒In other words,there are some precedent
constraints in these cities﹒The problem is very often
confronted by the dispatch of the warehouse﹒In this research,
we use neural network technique to formulate the problem,then
the constraint satisfactory approach also is proposed to solve
the problems﹒By combining the heuristic in TSP and technique
in the neural network，we will develop neural network technique
which will quickly find a feasible tour（satisfactory
precedence constraints）with the transportation cost does to
optimal﹒The solution quality will be verified by the
experimental tests and further application of this model will
be discussed﹒

並列關鍵字

Warehouse ； Vehicle Routing ； Neural Network