Jurnal Teknik Industri
Vol 21, No 2 (2019): JTI Dec 2019

ON MODELLING AND SOLVING HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH MULTI-TRIPS AND MULTI-PRODUCTS

Setiawan, Fran (Unknown)
Masruroh, Nur Aini (Unknown)
Pramuditha, Zita Iga (Unknown)



Article Info

Publish Date
16 Dec 2019

Abstract

Vehicle routing problem (VRP) is a model to determine an optimal routing plan for a fleet of homogeneous vehicles to serve a set customer which some operational constraints are satisfied. In most practical distribution problems, customer demands are served using heterogeneous fleet of vehicles. This kind of VRP is called Heterogeneous Vehicle Routing Problem (HVRP). HVRP has evolved into a rich research area because of its practical. There were many studies of rich extensions of the standar HVRP. This research aims to enrich the extentions of HVRP which is motivated by real case in one of pharmacy distribution company in Indonesia which is delivered multi-products to its 55 customers by allowing some vehicles which has small capacity to perform multi-trips. This problem is called Heterogeneous Vehicle Routing Problem with Multi-Trips and Multi-Products (HVRPMTMP).The mixed integer linear programming is developed based on four-index vehicle flow formulation. The model can be used generally in the same context of distribution problem. HVRPMTMP is generally NP-Hard problem, so the computational time using branch and bound in LINGO 16.0 is increasing exponentially by increasing the number of customers. Genetic algorithm is proposed to solve the real case. The result of the proposed GA can reduce the total cost from Rp 352540.6,- to Rp 180555,- or 48.78% from the current company policy.

Copyrights © 2019