In this paper, in case which it turns around to distribute the supplies to multiple customers of corporate activity, we describe how to specify an efficient transportation route and how to calculate the transportation time-schedule of supplies on it and the anticipation time of arrival to each customer. Now, in fact, the travel times between customers change at any time in same traveling route, so we allow minimization of the total round time, and also consider the specification of arrival time to a customer and the restrictions conditions of transportation order. By these conditions, a transportation route is determined by evaluating the fuzzy value indices for the total round time and the arrival times, which are defined by fuzzy numbers. In this decision, it is employed a genetic algorithm to search the best transportation route and to reduce the searching time. Furthermore, the information of the mesh map are used for calculations of moving-times of the transportations, that is, on the basis of the moving time between the mesh zones and the moving time in the mesh area, an extend-method of Dijkstra is employed to calculate the moving times which changes at every moment. Therefore, we introduced a genetic algorithm and a fuzzy theory to this scheduling, and also describe how to display the best route obtained by that. Finally, from the simulation results of the fuzzy scheduling, we discuss the usefulness of this method.
View full abstract