A NEW TYPE OF MULTI-OBJECTIVE ROUTING PROBLEM
SANCHO, N. G. F.; SANCHO, N. G. F.; Department of Mathematics and Statistics, McGill University
Журнал:
Engineering Optimization
Дата:
1988
Аннотация:
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<sup>2</sup> which has certain significant advantages over a method previously examined by Sancho.<sup>1</sup>
81.39Кб