A class of multicriteria shortest path problems for real-time in-vehicle routing

In-route guidance systems fastest path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this paper is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e., Pareto optimal) paths for real-time in-vehicle routing. The basic notion of the proposed approach is that (i) enumerating all nondominated paths is computationally too expensive, (ii) obtaining a stable mathematical representation of the driver's utility function is theoretically difficult and impractical, and (iii) identifying the optimal path given a nonlinear utility function is a nondeterministic polynomial time (NP)-hard problem. Consequently, a heuristic two-stage strategy that identifies multiple routes and then selects the near-optimal path may be effective and practical. As the first stage, we relax the uniqueness of the utility function by ...

[1]  M. I. Henig.  Efficient interactive methods for a class of multiattribute shortest path problems , 1994 .

[2]  Martin Weber.  Decision Making with Incomplete Information , 1987 .

[3]  Mordechai I. Henig,et al.  Applicability of the Functional Equation in Multi Criteria Dynamic Programming , 1985 .

[4]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[5]  A. R Warburton.  Exact and approximate solution of multiple objective shortest path problems , 1983 .

[6]  Dongjoo Park,et al.  Identifying Multiple and Reasonable Paths in Transportation Networks: A Heuristic Approach , 1997 .

[7]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[8]  N. Sancho.  A new type of multi-objective routing problem , 1988 .

[9]  P. Vincke,et al.  Multicriteria analysis: survey and new directions , 1981 .

[10]  Genevieve Giuliano,et al.  A MULTICRITERIA METHOD FOR TRANSPORTATION INVESTMENT PLANNING , 1985 .

[11]  Behnam Malakooti.  Ranking multiple criteria alternatives with half-space, convex, and non-convex dominating cones: quasi-concave and quasi-convex multiple attribute utility functions , 1989, Comput. Oper. Res..

[12]  Donald R. Lehmann,et al.  The Importance of Differential Weights in Multiple Attribute Models of Consumer Attitude , 1973 .

[13]  David Bernstein,et al.  The Traffic Equilibrium Problem with Nonadditive Path Costs , 1995, Transp. Sci..

[14]  D. J. White,et al.  The set of efficient solutions for multiple objective shortest path problems , 1982, Comput. Oper. Res..

[15]  P. Mirchandani,et al.  Routing with nonlinear multiattribute cost functions , 1993 .

[16]  Frank S. Koppelman,et al.  Perspectives on Driver Preferences for Dynamic Route Guidance Systems , 1997 .

[17]  Milan Zeleny,et al.  The Attribute-Dynamic Attitude Model Adam , 1976 .

[18]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[19]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[20]  Dongjoo Park,et al.  Forecasting Multiple-Period Freeway Link Travel Times Using Modular Neural Networks , 1998 .

[21]  Laurence R. Rilett,et al.  Incorporating Uncertainty and Multiple Objectives in Real-Time Route Selection , 2001 .

[22]  D Bernstein,et al.  SOLVING A BEST PATH PROBLEM WHEN THE VALUE OF TIME FUNCTION IS NONLINEAR , 1997 .

[23]  Laurence R. Rilett,et al.  Spectral Basis Neural Networks for Real-Time Travel Time Forecasting , 1999 .

[24]  Dongjoo Park,et al.  Multiple path-based vehicle routing in dynamic and stochastic transportation networks , 1998 .

[25]  David Bernstein,et al.  FINDING ALTERNATIVES TO THE BEST PATH , 1997 .

[26]  Jared L. Cohon,et al.  An interactive approach to identify the best compromise solution for two objective shortest path problems , 1990, Comput. Oper. Res..

[27]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[28]  Y. P. Aneja,et al.  Shortest chain subject to side constraints , 1983, Networks.