A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems

References

• Carraway R.L., Morin T.L., Moskowitz H. Generalized dynamic programming for multicriteria optimization. Eur. J. Oper. Res. (1990) 44:95–104Crossref, Google Scholar
• Current J., Marsh M. Multiobjective transportation network design and routing problems: Taxonomy and annotation. Eur. J. Oper. Res. (1993) 65:4–19Crossref, Google Scholar
• FHWA (1992) . TRAF–NETSIM User's Manual. U.S. Dept. of Transportation, Federal Highway Administration, Washington, D.CGoogle Scholar
• Glover F., Glover R., Klingman D. Computational study of an improved shortest path algorithm. Networks. (1984) 14:25–36Google Scholar
• Hall R. The fastest path through a network with random time-dependent travel times. Transportation Sci. (1986) 20:182–188Link, Google Scholar
• Jeffery D.J.K., Russam K., Robertson D.I. Electronic route guidance by AUTOGUIDE: The research background. Traffic Engrg. Control (1987) 28(10Google Scholar
• Jones E.G., Mahmassani H.S., Herman R., Walton C.M. Travel time variability in a commuting corridor: Implications for electronic route guidance. AATT Conference. (1989) Google Scholar
• Kobayashi F. Feasibility study of route guidance system. Transportation Res. Record (1979) 737:107–112Google Scholar
• Miller-Hooks E.D., Mahmassani H.S. On the generation of nondominated paths in stochastic, time–varying transportation networks. Tristan III Conference(San Juan, Puerto Rico) Google Scholar
• Mirchandani P.B., Soroosh H. Generalized traffic equilibrium with probabilistic travel times and perceptions. Transportation Sci. (1987) 21:133–152Link, Google Scholar
• Mirchandani P.B., Wiecel M.M. Routing with nonlinear multiattribute cost functions. Appl. Math. Comput. (1993) 54:215–239Crossref, Google Scholar
• Mote J., Murthy I., Olson D.L. A parametric approach to solving bicriteria shortest path problems. Eur. J. Oper. Res. (1991) 53:81–92Crossref, Google Scholar
• Murthy K.G.Network Flow Programming (1994) (John Wiley and Sons, New York) Google Scholar
• Murthy K.G.Linear programming (1983) (John Wiley and Sons, New York) Google Scholar
• Nash S.G., Sofer A.Linear and Nonlinear Programming (1996) (McGraw-Hill)Google Scholar
• Nemhauser G.L., Wolsey L.A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Scott K., Bernstein D. Solving a minimum cost path problem when the value of time is nonlinear. Tristan III Conference (1998) (San Juan, Puerto Rico) Google Scholar
• Sherali H.D., Adams W.P. A hierarchy of relaxations between the continuous and convex hull representations for zero–one programming problems. SIAM J. Discrete Math. (1990) 3:411–430Crossref, Google Scholar
• Sivakumar R.A., Batta R. The variance-constrained shortest path problem. Transportation Sci. (1994) 28:309–316Link, Google Scholar
• Tsuji H., Takahashi R., Kawashima H., Yamamoto Y. A stochastic approach for estimating the effectiveness of a route guidance system and its related parameters. Transportation Sci. (1985) 19:333–351Link, Google Scholar
• Wijeratne A.B., Turnquist M.A., Mirchandani and P.B. Multiobjective routing of hazardous materials in stochastinetworks. Eur. J. Oper. Res. (1993) 65:33–43Crossref, Google Scholar
• Ziliaskopoulos A., Mahmassani H. Time–dependent shortest path algorithm for real–time intelligent vehicle highway systems applications. Transportation Res. Record. (1993) 1408:94–109Google Scholar