A dynamic programming model is proposed for finding all Pareto optimal solutions for a routing problem within a specified overall time, overall reliability and overall capacity. A method is also given for finding other solutions which are not Pareto optimal, but which satisfy the required constraints. This model uses the method proposed by Sniedovich² which has certain significant advantages over a method previously examined by Sancho.¹