A Capacitated Heterogeneous Vehicle Routing Problem for Catering Service Delivery with Committed Scheduled Time

The heterogeneous vehicle routing problem (HVRP) is a well-known combinatorial optimization problem which describes a heterogeneous set of vehicles with different capacity, in which each vehicle starts from a central depot and traverses along a route in order to serve a set of customers with known geographical locations. This paper develops a model for the optimal management of service deliveries of meals of a catering company located in Medan City, Indonesia. The HVRP incorporates time windows, deliveries, fleet scheduling in the committed scheduled time planning.. The objective is to minimize the sum of the costs of travelling and elapsed time over the planning horizon. We model the problem as a linear mixed integer program and we propose a feasible neighbourhood direct search approach to solve the problem