The Traveling Path Determination for Customers having Probabilistic Request

The Solution Matching the Problem

Abstract

In this study, we illustrate a new practical approach to schedule the visiting routes for given stores having probabilistic maintenance demands. There are so many real situations like that. This problem is defined as the probabilistic TSP(PTSP). We solve the PTSP by some meta-heuristic algorithms. We apply the local clustering organization using a priori tour strategy to several problems to verify efficiency of optimization.