A CAPACITATED HETEROGENEOUS VEHICLE ROUTING PROBLEM FOR PHARMACEUTICAL PRODUCTS DELIVERY

Abstract

Asrin Lubis, Herman Mawengkang

This paper describes an optimal way for retail pharmacies to deliver medical products for customers. Heterogeneous vehicle routing problem (HVRP) is one of the options for the optimal solution of the problem. This is a well-established question of combinatorial optimisation, in which a sequence in cars with varying capabilities departs from a central warehouse to satisfy a variety of customers with specific locations. The study sets out a model for the optimal transportation of medicinal products by a private company based in Medan City, Indonesia. The HVRP has time slots, delivery and allocation of fleets over a short period of time. The objective is to minimize the overall cost of transport moving across the planning horizon. The method is formulated as a linear mixed integer system, and an appropriate response requires a feasible search approach.