A generalization of dynamic programming for pareto optimization in dynamic networks

RAIRO - Operations Research

Volumn 34, Issue 1, 2000, Pages 27-47

  Getachew, Teodros ^a   Kostreva, Michael ^a   Lancaster, Laura ^a  

^a CLEMSON UNIVERSITY   (United States)

Author keywords

Dynamic network; Dynamic programming; Pareto optimization; Shortest path; Time dependent cost function

Indexed keywords

ALGORITHMS; COSTS; DECISION THEORY; DYNAMIC PROGRAMMING; PARETO PRINCIPLE; PROBLEM SOLVING;

BACKWARD MULTI-OBJECTIVE DYNAMIC PROGRAMMING; DYNAMIC NETWORKS; PARETO OPTIMIZATION; TIME-DEPENDENT COST FUNCTIONS;

OPERATIONS RESEARCH;

EID: 0033880280     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2000100     Document Type: Article

References (18)

1. R. E. BELLMAN, On a Routing Problem, Quarterly Appl. Math., 1958, 16, p. 87-90.
2. T. A. BROWN and R. E. STRAUCH, Dynamic Programming in Multiplicative Lattices, J. Math. Anal. Appl., 1965, 12, p. 364-370.
3. J. BRUMBAUGH-SMITH and D. SHIER, An empirical investigation of some bicriterion shortest path algorithms, European J. Op. Res., 1989, 43, p. 216-224.
4. R. L. CARRAWAY and T. L. MORIN, Generalized Dynamic Programming for Multicriteria Optimization, European J. Op. Res., 1990, 44, p. 95-104.
5. K. L. COOKE and E. HALSEY, The Shortest Route Through a Network with Time-Dependent Internodal Transit Times, J. Math. Anal. Appl., 1966, 14, p. 493-498.
6. H. W. CORLEY and I. D. MOON, Shortest Paths in Networks with Vector Weights, J. Opt. Theory Appl., 1985, 46, p. 79-86.
7. 7. H. G. DAELLENBACH and C. A. DEKLUYVER, Note on Multiple Objective Dynamic Programming, J. Op. Res. Soc., 1980, 31, p. 591-594.
8. E. W. DIJSTRA, A Note on Two Problems in Connection with Graphs, Num. Math., 1959, 1, p. 269-271.
9. S. E. DREYFUS, An Appraisal of Some Shortest Path Algorithms, Ops. Res., 1969, 17, p. 395-412.
10. T. GETACHEW, An Algorithm for Multiple-Objective Network Optimization with Time Variant Link-Costs, Ph.D. dissertation, Clemson Univ., Clemson, South Carolina, USA, 1992.
11. T. GETACHEW, Optimization over Stratified Posets, in preparation.
12. J. HALPERN, Shortest Route with Time-dependent Length of Edges and Limited Delay Possibilities in Nodes, J. Ops. Res., 1977, 21, p. 117-124.
13. M. I. HENIG, The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets, Math. Ops. Res., 1985, 10, p. 462-470.
14. D. E. KAUFMANN and R. L. SMITH, Minimum Travel Time Paths in Dynamic Networks with Application to Intelligent Vehicle-highway Systems, University of Michigan, Transportation Research Institute, Ann Arbor, Michigan, USA, IVHS Tech. Rpt. 90-11, 1990.
15. M. M. KOSTREVA and M. M. WIECEK, Time Dependency in Multiple Objective Dynamic Programming, J. Math. Anal. Appl., 1993, 173, p. 289-308.
16. A. ORDA and R. ROM, Shortest-path and Minimum-delay Algorithms in Networks with Time-dependent Edge-length, J. Assoc. Comp. Mach., 1990, 37, p. 607-625.
17. A. B. PHILPOTT, Continuous-time Shortest Path Problems and Linear Programming, SIAM J. Cont. Opt., 1994, 32, p. 538-552.
18. S. VERDU and H. V. POOR, Abstract Dynamic Programming Models under Commutativity Conditions, SIAM J. Cont. Opt., 1987, 25, p. 990-1006.