透過您的圖書館登入
IP:13.59.34.87
  • 學位論文

公司車最佳租賃與私人車補貼方案研究

Optimal Company Car Rental and Private Car Subsidization Policy

指導教授 : 孔令傑

摘要


本研究中,我們將針對一家屬於到府服務類型的IT解決方案提供商來探討其運輸策略的制定與管理議題,而該類型服務的公司往往需要將其員工派遣到目標客戶端以提供顧客所需之服務,像是自家設備產品的定期性保養及臨時性維修等售後服務。我們將考慮三種實務上常見的交通方式:公司租賃的公司車、員工擁有的私人車及大眾運輸的計程車,而此三種交通方式背後運作的成本考量與定位也不盡相同。每輛「公司車」皆需要支付固定的車輛年租賃費用,但將根據車輛實際行駛距離多寡而有最小的單位運輸成本(實際油耗),車輛供應有限;反之,每輛「私人車」不需要支付固定的車輛年租賃費用,但其單位運輸成本較高,因為除了實際油耗外,公司仍必須補貼員工駕駛自家私人車出勤的個人估算之車輛耗損成本來增進私人車的供應量,因此,車輛供應也將有所限制;計程車,其搭乘補助費用將依據各地區計程車費率來計算,單位運輸成本極高,但其供應量無上限。考量上述可能運作,我們將依序討論「私人車補貼措施決策」及「公司車租賃數量決策」兩大運輸議題。首先,透過「私人車補貼措施決策」下所討論之私人車單位補貼定價來檢視分段式補貼手法的必要性,以及不同的補貼定價模式將如何影響私人車的整體供應。此外,我們將在「公司車租賃數量決策」下建構一個最佳化模型,幫助我們了解據點日常工作分配情形,獲得每天所有工作與交通工具的最佳分派,透過運作成本的計算與評估可以協助找尋據點公司車的最佳配置模式。最後,我們使用台灣案例公司所提供的實際服務數據集來檢驗兩種決策模型的適用性和有效性,結果表明,透過我們的最佳化模型,該年度整體可以為案例公司節省高達7.37%的總運輸成本。

並列摘要


In this study, we focus on the development of transportation strategies for a door-to-door IT solution provider which dispatches its employees to the client side to provide services. Three major types of transportation options are considered: company cars rent by the company, private cars owned by employees, and taxis. Each company car requires a fixed amount of annual rental fee but has the minimum variable cost based on the traveling distance. A private car requires no fixed annual fee but has a higher variable cost because the company must subsidize employees for them to provide their cars. Private cars are thus of limited supply. A taxi has the highest variable cost with unlimited supply. Therefore, we discuss two major transportation-related decisions: “Private car subsidy” and “company car rental”. First, we discuss the necessity of segmented subsidy through the pricing of marginal subsidy for the private cars, and how different subsidy prices will affect the overall supply of private cars. In addition, we construct an optimization model, which can help us understand the daily job assignment and obtain the best way to dispatch company and private cars. We examine the applicability and effectiveness of the two decision models using a real data set provided by a Taiwanese company. It is shown that our models may save up to 7.37% of annual transportation-related cost for the case company.

參考文獻


Blazwicz, J., W. Domschke, E. Pesch. 1996. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research 93(1) 1–33.
Christofides, A.M., P. Toth. 1981. Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations, Mathematical Programming 20 255-282.
Clarke G., J.W. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12(4) 568-581.
Éric T., P.B., G. Michel, G. François, P. Jean-Yves. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31(2) 170-186.
Fisher, M.L., R. Jaikumar. 1981. A Generalized Assignment Heuristic for Vehicle Routing. Networks, 11 109-124.

延伸閱讀