Cargo fleet routing model with limited timeframe using honey bee algorithm (Case study: Pak Gostar Dairy Products)

Cargo fleet routing problem is part of the problems that arise and are used in the transportation industry. In this research, one of the specific types of this issue as the time fleet tracking with a limited time period which is the most common problem in operations research at the present time will be discussed. The aim of solving this problem is to provide service to many customers at different locations and different demands by a sufficient fleet. Considering these limitations each customer should set a period of time in service and delays in service are to a certain extent. In this study, reach sooner at the fleet to each of the destinations has given the delay in the service to a certain amount of the fines in accordance with the early and late is acceptable. In terms, they call it (period of application). According to surveys, in order to achieve the above objectives, the use of Bees Algorithm is used in this thesis. Using the Bee algorithm in this research is due to the evolutionary nature of this algorithm.

کلیدواژه ها:

Cargo fleet routing ، honey bee algorithms ، limited timeframe