Fleet Size and Mix Vehicle Routing Problem (FSMVRP), Adapted Large Neighbourhood Search Heuristic Optimization ProposalWith a Plant-capacity and Multi-day Planning Algorithm: A Livestock Feed Industry Case Study

Authors : Alperen Ekrem ÇELİKDİN

Pages : 1-12

Doi:10.26650/JTL.2023.1101161

View : 36 | Download : 29

Publication Date : 2023-08-10

Article Type : Research Paper

Abstract :The vehicle routing problem insert ignore into journalissuearticles values(VRP); is of great importance for feed factories that do not work with the dealership system. This is especially important in the Central Anatolian region, where customers’ number of animals is low. Data used in the study came from the order data of a feed mill which operates in Turkey. Before selecting the most suitable VRP software vendor, the logistics manager of the plant was urged to analyse the results with the scope of percent fleet capacity used, service level insert ignore into journalissuearticles values(on-time deliveries);, and total transportation cost incurred. As a requirement of the enterprise strategy, a multi-day planning algorithm was developed to level the daily production capacity of the factory while maintaining minimum transportation costs and maximum service level. It has been determined that better results are achieved with the developed multi-day planning algorithm for both methods of Simulated Annealing insert ignore into journalissuearticles values(SA);, Genetic Algorithm insert ignore into journalissuearticles values(GA);, and our Adapted Large Neighbourhood Search insert ignore into journalissuearticles values(ALNS); heuristic. The data set of the real-life problem that was used was applied to those three methods, and 0.45%, 0.81%, and 1.39% improvements were achieved using the methods, respectively.
Keywords : Vehicle routing problem, fleet size mix with time windows, multi day planning, feed distribution, adapted large neighbourhood search