具工作負荷平衡之配送車輛途程問題研究

Two Methods for Solving Load-Balancing Vehicle Routing Problems

大多數有關配送車輛途程的研究報告皆注重運輸時間和成本在配送效率上單日標的探討，可是隨著經營理念的改變，企業界也已開始追求「企業一員工一顧客」的三贏策略，本研究有鑒於此，將車輛工作人員之負荷平街的因素也納入配送車輛途程問題考量範圍內，而規劃出一個同時追求最短距離與員工工作負荷最平衡的整數規劃模式與一啟發式演算法，以便可慮用於一般較廣泛的配送車輛途程問題上。本研究將所建立的啟發式演算法以VisualBasic軟體予以程式化，並將其結果與11個範例之最佳解比較。研究結果顯示，本研究建立的啟發式演算法，在範例的測試下，於所追求的兩目標方面都具有求解精確性與穩定性的表現，在電腦執行的速度方面，更表現其簡單性的特質。

In modern business environment, employee are key resources tocompanies. The competitive advantage of a transportation company can beestablished if the company treats drivers and driver assistants fairly. Itimplies load-balancing is important to them. Hence, we developed an integerprogramming model for vehicle routing problems with two objectives. One is tominimize the total distance. The other is to balance the load among drivers andtheir assistants as possible. The characteristic of an integer programming modelis NP-hard. Therefore, we also developed a heuristic algorithm to solve thistype of problems. Based on our II test problems, we found that the heuristicalgorithm behaves well.