Multiple Objective Path Optimization for Time Dependent Objective Functions

The study of time dependent, non-monotone increasing objective functions is interesting for several applications of multiple objective path optimization. In this paper an algorithm which finds the set of non-dominated paths is derived and shown to converge. This algorithm does not reduce to dynamic programming, even for constant cost functions.

[1]  R. Bellman.  Dynamic programming. , 1957, Science.

[2]  Yacov Y. Haimes,et al.  MULTIOBJECTIVE DYNAMIC PROGRAMMING: THE STATE OF THE ART , 1989 .

[3]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

[4]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[5]  Thomas L. Magnanti,et al.  Applied Mathematical Programming , 1977 .

[6]  Michael R. Wilson.  A Time Dependent Vector Dynamic Programming Algorithm for the Path Planning Problem , 1992 .

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  T. A. Brown,et al.  Dynamic Programming in Multiplicative Lattices , 1965 .

[9]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[10]  Moshe Sniedovich,et al.  Dynamic programming and principles of optimality , 1978 .

[11]  A. I. Mees,et al.  Continuous-time shortest path problems with stopping and starting costs , 1992 .

[12]  D E Kaufman,et al.  FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION , 1993 .

[13]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[14]  Bernardo Villarreal,et al.  Multicriteria integer programming: A (hybrid) dynamic programming recursive approach , 1981, Math. Program..

[15]  H. Moskowitz,et al.  Generalized dynamic programming for multicriteria optimization , 1990 .

[16]  L. G. Mitten.  Preference Order Dynamic Programming , 1974 .

[17]  H. G. Daellenbach,et al.  Note on Multiple Objective Dynamic Programming , 1980 .

[18]  M. Kostreva,et al.  Time Dependency in Multiple Objective Dynamic Programming , 1993 .

[19]  David E. Kaufman,et al.  Minimum travel time paths in dynamic networks with application to intelligent vehicle/highway systems , 1990 .

[20]  Roger Hartley.  Vector Optimal Routing by Dynamic Programming , 1985 .

[21]  A. I. Mees,et al.  A FINITE-TIME ALGORITHM FOR SHORTEST PATH PROBLEMS WITH TIME-VARYING COSTS* , 1993 .

[22]  H. W. Corley,et al.  Shortest paths in networks with vector weights , 1985 .

[23]  George L. Nemhauser,et al.  Introduction To Dynamic Programming , 1966 .

[24]  Teodros Getachew.  A recursive algorithm for multi-objective network optimization with time-variant link-costs , 1992 .

[25]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[26]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..