VEHICLE ROUTING PROBLEM WHICH IS MINIMIZED TOTAL IDLE TIME

In this study, a new VRP problem is to be introduced. This problem was realized according to manage the route operations of a company carrying long-distance passengers by bus in Turkey. The differences of the problem from the other VRP firstly comes from its objective function. It suggests that vehicles should work more because they could make profit during they work. So the objective function of the problem should be defined as to minimize the sum of idle time of those vehicles. To the contrary of VRP problems which are examined for now, vehicles should work more and sometimes they should prefer long distance route also. Other two differences are related with constraints: Some locations should be visited more than once for different time points and sub-tours could be allowed to occur in some situations. This problem can be observed in many transport companies, Autonomous unmanned vehicles for future drives and to route automatic controlled vehicles. The solutions developed for the problem may lead directly or indirectly to reduce the number of vehicles, carbon emissions, ticket prices, wastes, the cost of fleet management, service-maintenance, and to increase prosperity for the world