COMPARISON OF VEHICLE ROUTING PROBLEMS IN COLD CHAIN

Abstract

In this study, cold chain applications, which are a very important issue in the food industry, have been handled and exemplified by 2 different vehicle routing problem solutions considering certain vehicle and cost constraints. In addition to the costs in the food industry, food safety should be ensured and the products should be delivered to the final consumer in the best conditions. In this sense, by comparing vehicle routing methods used in food companies, company costs can be reduced and can be positioned as a factor increasing the quality of the company as it directly affects the end product. In this study, the closest neighbor and sweeping algorithm are used in 2 different methods for the solution of vehicle routing studies in order to reduce the costs