Modeling and Solving Heterogeneous Fleet Vehicle Routing Problems in Draft Beer Delivery
Chansiri Singhtaun1, Siwa Tapradub2
1Chansiri Singhtaun, Department of Industrial Engineering, Kasetsart University, Ngamwongwan Rd. Chatuchak, Bangkok Thailand.
2Siwa Tapradub, Department of Industrial Engineering, Kasetsart University, Ngamwongwan Rd. Chatuchak, Bangkok Thailand.
Manuscript received on 25 May 2019 | Revised Manuscript received on 03 June 2019 | Manuscript Published on 22 June 2019 | PP: 353-356 | Volume-8 Issue-3S, February 2019 | Retrieval Number: C10720283S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This article proposes a mathematical model and a solution method for a heterogeneous fleet vehicle routing problem (HFVRP), which is applied in a draft beer manufacturing company. The objective is to determine the optimal set of customers and delivery route for a fleet of vehicles so that the minimum delivery cost is acheived. There are 12 vehicles separated into 3 types provided to deliver draft beer to 14 customers. The delivery cost depends on the fuel consumption rate of the vehicle and the travel distance. The delivery planning program according to the model is developed using Microsoft Excel. Branch and bound algorithm in OpenSolver is used to solve the problem. The results show that the delivery cost can be reduced by 8.15% after implementation.
Keywords: Heterogeneous Fleet Vehicle Routing, Branch And Bound Algorithm, Transportation.
Scope of the Article: Heterogeneous Wireless Networks