| Автор | SANCHO, N. G. F. |
| Дата выпуска | 1988 |
| dc.description | 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> |
| Формат | application.pdf |
| Издатель | Taylor & Francis Group |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Тема | Dynamic programming |
| Тема | Pareto optimal solutions |
| Тема | routing problems |
| Тема | reliability |
| Тема | capacity |
| Название | A NEW TYPE OF MULTI-OBJECTIVE ROUTING PROBLEM |
| Тип | research-article |
| DOI | 10.1080/03052158808941204 |
| Electronic ISSN | 1029-0273 |
| Print ISSN | 0305-215X |
| Журнал | Engineering Optimization |
| Том | 14 |
| Первая страница | 115 |
| Последняя страница | 119 |
| Аффилиация | SANCHO, N. G. F.; Department of Mathematics and Statistics, McGill University |
| Выпуск | 2 |
