A NEW TYPE OF MULTI-OBJECTIVE ROUTING PROBLEM

Publisher Website
Google Scholar
Abstract
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 Sniedovich2 which has certain significant advantages over a method previously examined by Sancho.1

This publication has 3 references indexed in Scilit: