Changes between Version 4 and Version 5 of Documentation/Reference/ProbabilisticTravelingSalesmanProblem
 Timestamp:
 07/02/15 23:09:16 (8 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Documentation/Reference/ProbabilisticTravelingSalesmanProblem
v4 v5 4 4 5 5 The Probabilistic Traveling Salesman Problem (PTSP) models situations in a delivery context where a set of customers have to be visited on a regular basis (e.g. daily), but all customers do not always require a visit (they have \probabilities" of being visited). In general, every day only a subset of customers requires a visit, and this subset is only known the same day as the required deliveries so reoptimizing vehicle routes from scratch every day is unfeasible. In this situation, the delivery man would follow a standard route skipping the customers that do not require a visit on that day. Therefore, the goal is to find a standard route of least expected length. 6 7 Based on the way the solutions are evaluated, we can distinguish between an analytical PTSP and a estimated PTSP. Currently, one the second one is fully functional in HeuristicLab. 6 8 7 9 '''Problem Parameters:''' … … 11 13  Coordinates  The x and yCoordinates of the cities.  12 14  !DistanceMatrix  The matrix which contains the distances between the cities.  13  Evaluator  [#Evaluator TSPRoundedEuclideanPathEvaluator]:The operator which should be used to evaluate PTSP solutions. 15  Evaluator  The operator which should be used to evaluate PTSP solutions.  14 16  ProbablityMatrix  The matrix which contains the probabilities of the cities.  15 17  Realizations  The list which contains the realizations of the Monte Carlo sampling. 