Vehicle Routing Problem with Fuzzy Due-time Using Genetic Algorithms

スポンサーリンク

概要

• 論文の詳細を見る

• In the paper, the concept of fuzzy die-time is defined in the vehicle routing and scheduling context. Usually customers' preferences for service can be classified into two kind of types : the tolerable interval of service time and the desirable time for service. Conventional approaches just consider the tolerable interval of service time and do not care for customers' desired time. The proposed fuzzy approach can handle both kind of customers' preferences simultaneously.Fuzzy due-time for each customers is given as a triangular fuzzy number and the membership function is corresponding to the grade of satisfaction of service time. Fuzzy vehicle routing problem is formulated with the concept of fuzzy due-time. The objectives considered here are to minimize the fleet size of vehicles, maximize the average grade of satisfaction over customers, minimize total travel distance, and total waiting time for vehicles.Genetic algorithm is investigated for solving the fuzzy vehicle routing problem. An insertion heuristic based crossover is designed towards to generate improved offspring. A push-bump-throw heuristic procedure is proposed to handle the fuzzy feature of the problem.Preliminary computational experiments on several randomly generated test problems have been executed and the results demonstrate that genetic algorithms and fuzziness approach can be a promising way for vehicle routing and scheduling problems.

• 日本知能情報ファジィ学会の論文
• 1995-10-15

著者

• Gen Mitsuo

  足利工業大学工学部

• CHENG Runwei

  宇都宮大学大学院

• TOZAWA Tatsumi

  宇都宮大学工学部

• Cheng R

  宇都宮大学大学院

• Tozawa T

  Utsunomiya Univ.

関連論文

• Vehicle Routing Problem with Fuzzy Due-time Using Genetic Algorithms

スポンサーリンク