An Optimization Model of Vehicle Routing Problem for Food Catering Delivery with Heterogeneous Fleet
MetadataShow full item record
One of the variant of the vehicle routing problem (VRP) called heterogeneous VRP is a well-known logistic optimization problem which describes a set of vehicles with different capacity starts from a central depot and traverses along a route in order to serve a set of customers with known geographical locations. The research under study for this paper was carried out for a catering company located in Medan city, Indonesia. The company deals with delivering meals to its customers around Medan city, and it has heterogeneous fleet of vehicles. This paper develops a model for the optimal management of service deliveries of meals for the company. The heterogeneous VRP incorporates time windows, deliveries, fleet scheduling in the scheduled time planning. The objective is to minimize the total costs incurred in the deliveries process of meals such that the customers’ demand are fully satisfied over the planning horizon. Mathematically, we formulated the problem as a linear mixed integer program model and we propose a direct search approach based on active set constraints to solve the problem.