Vehicle routing problem is a well-known optimization problem in the logistics area. A special case of the vehicle routing problem is the station replenishment problem in which different types of fuel types have to be transported from the depots to the customers. In this paper we study the replenishment problem of a European petrol company. The problem contains several additional constraints such as time windows, different sized compartment vehicles, and restrictions on the vehicles that can serve a customer. We introduce a mixed integer linear programming model of the problem. To reduce the size complexity of the MILP model the customers are clustered and, based on the clusters, additional constraints are added to the MILP model. The resulting MILP model is tested on real problems of the company. The results show that combining the MILP model with clustering improves the effectiveness of the model.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.