A MULTI-OBJECTIVE ROUTING PROBLEM
- 1 January 1986
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 10 (2) , 71-76
- https://doi.org/10.1080/03052158608902528
Abstract
A dynamic programming formulation is proposed for finding all Pareto optimal solutions for a routing problem within a specified overall cost, overall time and overall distance. A method is also proposed for finding other solutions which are not Pareto optimal solutions but which lie within the specified overall cost, overall time and overall distance.Keywords
This publication has 3 references indexed in Scilit:
- REDUCING THE PARETO OPTIMAL SET IN MULTICRITERIA OPTIMIZATION(With Applications to Pareto Optimal Dynamic Programming)Engineering Optimization, 1985
- PARETO OPTIMAL SERIAL DYNAMIC PROGRAMMINGEngineering Optimization, 1983
- Multiobjective dynamic programing: A classic problem redressedWater Resources Research, 1979