零場站之車輛途程模式

Vehicle Routing with Nil Storehouse

俞錫強(Hsi-Chiang Yu)

指導教授 ： 劉俞志

元智大學/資訊學院/資訊管理學系/碩士(2006年)

https://doi.org/10.6838/YZU.2006.00191

摘要

在物流業中如何有效降低運輸成本，是企業提升競爭力的重要因素，因此車輛路線的安排就顯得相當重要，雖然目前車輛途程的問題已有相當多的研究，但講究速度的現今社會，客戶對服務品質的要求越來越高，如何能有效降低成本又能即時滿足顧客的需求，仍然是專家學者所致力挑戰的目標，除了相關演算法的開發與改良，不同角度的思維對問題探討也有幫助。

本研究提出了零場站的構想，讓車輛的收送貨上有更大的彈性，從客戶所接收的貨物直接送至其它的客戶，貨物不需要載回場站再運出，讓各個需求點的貨物收送可以在沒有場站的途程內完成，希望藉此免去倉儲管理的成本，對提升物流競爭有所助益。

實驗依零場站環境所衍生的條件限制，建構含時窗限制、可混合送收貨的車輛途程問題之啟發式解法，利用鄰近法或節省法產生初始途程後，再進行途程的改善，當車輛開始服務後產生新的需求點時，將其插入到行動中車輛的路線；實驗採學術上慣用的例題進行測試，藉由數據的結果分析比較，驗證零場站車輛途程的可行性。

關鍵字

零場站 ； 時窗限制 ； 車輛途程

並列摘要

How to decrease the cost of transportation is an essential factor to evaluate the industry competition. Thus, it becomes very critical issue for vehicle routing management. There are quiet a lot research for vehicle routing; however, speediness is what the relative industry asks for nowadays as well as high quality service. How to cost effectively and how to meet customer’s requirement are the main goals for scholar to investigate. Except to develop and improve the algorithm, it also helps a lot to study different aspect of it.

The research proposes the idea called nil storehouse, which makes the directly routing from customer to it’s customer without any transferring post, will provide a more flexible vehicle routing. Therefore, nil storehouse would effetely decrease the cost of warehouse management and highly encourage the competition of vehicle routing industry.

The limited condition produced by experiment is suggested to consist time window constraints, and the heuristics of vehicle routing problem with simultaneously deliveries and pickups. The vehicle routing is used the nearest algorithms and saving algorithms which will result in initial routing and then improve it. As a new demand is requested, it’ll be inserted into the vehicle routing, which is on duty. The experiment adopts the academic research as the reference subject so that it can analyze and compare the result to the feasibility of vehicle routing with nil storehouse.

並列關鍵字

nil storehouse ； time window constraint ； vehicle routing

參考文獻

[25]周蘇江，「含時窗限制的動態車輛途程問題之研究」，中原大學工業工程研究所，碩士論文，2001

[32]陳百傑，「以啟發式演算法求解時窗限制車輛途程問題」，中原大學工業工程研究所 碩士論文，2002

[4]Clarke, G. and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, Vol.12, No.4, pp.568-581, 1964.

[6]Dueck, G. and T. Scheuer, “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing,” Journal of Computational Physics, Vol.90, pp.161-175, 1990.

[7]Fish, M.L. and Jaikumar, R. " A generalized assignment heuristic for vehicle routing," Networks, Vol.11, pp.109-124, 1981.