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.
Highlights
Transportation cost can be reduced in several ways
In classical vehicle routing problem (VRP) which is called Capacitated Vehicle Routing Problem (CVRP), the fleet of a vehicle is homoge neous while in most practical distribution problems, customer demands are served by heterogeneous fleet of vehicles
We proposed a genetic algorithm to help in solving a real case
Summary
One of them is by optimizing the sequence of vehicle route. The classical vehicle routing problem (VRP) aims to design optimal delivery routes where each vehicle has the same characteristics (capacity), each vehicle only travels one route with only one depot (Braekers et al [1]). The VRP aims to determine routes of given vehicle fleet at minimum cost (Toth and Vigo [2]). The surveys are conducted by Cordeau et al [5]; Laporte [6]; Braekers et al [1]; and the books by Golden et al [7] and Toth and Vigo [2]. In classical VRP which is called Capacitated Vehicle Routing Problem (CVRP), the fleet of a vehicle is homoge neous (identical) while in most practical distribution problems, customer demands are served by heterogeneous fleet of vehicles
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
