메뉴 건너뛰기




Volumn 62, Issue 8, 2013, Pages 3551-3568

Proactive vehicular traffic rerouting for lower travel time

Author keywords

Proactive driver guidance; Traffic load balancing; Vehicular congestion avoidance; Vehicular networks

Indexed keywords

GRAPH THEORY; REMOTE CONTROL; TRAVEL TIME;

EID: 84886670312     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2013.2260422     Document Type: Article
Times cited : (134)

References (43)
  • 1
    • 84886706987 scopus 로고    scopus 로고
    • [Online]
    • [Online]. Available: http://www.google.com/mobile
  • 2
    • 84886657021 scopus 로고    scopus 로고
    • [Online]
    • [Online]. Available: http://www.tomtom.com/en-gb/products/mobile- navigation
  • 3
    • 84886679278 scopus 로고    scopus 로고
    • [Online]
    • [Online]. Available: http://www.inrix.com
  • 4
    • 84886692963 scopus 로고    scopus 로고
    • [Online]
    • [Online]. Available: http://www.autobahn.nrw.de
  • 5
    • 84886672993 scopus 로고    scopus 로고
    • [Online]
    • [Online]. Available: http://sumo.sourceforge.net/doc/current/docs/ userdoc/ Tools/Assign.html
  • 8
    • 84886646544 scopus 로고    scopus 로고
    • Comparing performance and quality of traffic assignment techniques for microscopic road traffic simulations
    • Leuven, Belgium
    • M. Behrisch, D. Krajzewicz, and Y. P. Wang, "Comparing performance and quality of traffic assignment techniques for microscopic road traffic simulations," in Proc. DTA, Leuven, Belgium, 2008.
    • (2008) Proc. DTA
    • Behrisch, M.1    Krajzewicz, D.2    Wang, Y.P.3
  • 12
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimization algorithms
    • Jul
    • M. L. Fredman and R. E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms," J. ACM, vol. 34, no. 3, pp. 596-615, Jul. 1987.
    • (1987) J. ACM , vol.34 , Issue.3 , pp. 596-615
    • Fredman, M.L.1    Tarjan, R.E.2
  • 13
    • 0027149988 scopus 로고
    • Variational inequality formulation of the dynamic network user equilibrium problem
    • T. L. Friesz, D. Bernstein, T. E. Smith, R. L. Tobin, and B. W. Wie, "A variational inequality formulation of the dynamic network user equilibrium problem," Oper. Res., vol. 41, no. 1, pp. 179-191, Jan./Feb. 1993. (Pubitemid 23710595)
    • (1993) Operations Research , vol.41 , Issue.1 , pp. 179-191
    • Friesz Terry, L.1    Bernstein David2    Smith Tony, E.3    Tobin Roger, L.4    Wie, B.W.5
  • 15
    • 37849030259 scopus 로고    scopus 로고
    • Spatio-temporal network databases and routing algorithms: A summary of results
    • B. George, S. Kim, and S. Shekhar, "Spatio-temporal network databases and routing algorithms: A summary of results," in Proc. Adv. Spatial Temporal Databases, 2007, pp. 460-477.
    • (2007) Proc. Adv. Spatial Temporal Databases , pp. 460-477
    • George, B.1    Kim, S.2    Shekhar, S.3
  • 16
    • 54849431370 scopus 로고    scopus 로고
    • Openstreetmap: User-generated street maps
    • Oct.-Dec
    • M. Haklay and P. Weber, "Openstreetmap: User-generated street maps," IEEE Pervasive Comput., vol. 7, no. 4, pp. 12-18, Oct.-Dec. 2008.
    • (2008) IEEE Pervasive Comput. , vol.7 , Issue.4 , pp. 12-18
    • Haklay, M.1    Weber, P.2
  • 17
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • Jul
    • P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cybern., vol. SSC-4, no. 2, pp. 100-107, Jul. 1968.
    • (1968) IEEE Trans. Syst. Sci. Cybern. , vol.SSC-4 , Issue.2 , pp. 100-107
    • Hart, P.E.1    Nilsson, N.J.2    Raphael, B.3
  • 19
    • 70350579633 scopus 로고    scopus 로고
    • Prediction, expectation, and surprise: Methods, designs, and study of a deployed traffic forecasting service
    • E. Horvitz, J. Apacible, R. Sarin, and L. Liao, "Prediction, expectation, and surprise: Methods, designs, and study of a deployed traffic forecasting service," in Proc. 21st Conf. UAI, 2005, pp. 275-283.
    • (2005) Proc. 21st Conf. UAI , pp. 275-283
    • Horvitz, E.1    Apacible, J.2    Sarin, R.3    Liao, L.4
  • 21
    • 79951821831 scopus 로고    scopus 로고
    • Optimum principle for a vehicular traffic network: Minimum probability of congestion
    • Mar.
    • B. S. Kerner, "Optimum principle for a vehicular traffic network: Minimum probability of congestion," J. Phys. A, Math. Theor., vol. 44, no. 9, p. 092001, Mar. 2011.
    • (2011) J. Phys. A, Math. Theor. , vol.44 , Issue.9 , pp. 092001
    • Kerner, B.S.1
  • 23
    • 0000685484 scopus 로고
    • A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem
    • Mar
    • E. L. Lawler, "A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem," Manage. Sci., vol. 18, no. 7, pp. 401-405, Mar. 1972.
    • (1972) Manage. Sci. , vol.18 , Issue.7 , pp. 401-405
    • Lawler, E.L.1
  • 26
    • 79957792202 scopus 로고    scopus 로고
    • A continuous query system for dynamic route planning
    • N. Malviya, S. Madden, and A. Bhattacharya, "A continuous query system for dynamic route planning," in Proc. IEEE 27th ICDE, 2011, pp. 792-803.
    • (2011) Proc. IEEE 27th ICDE , pp. 792-803
    • Malviya, N.1    Madden, S.2    Bhattacharya, A.3
  • 27
    • 0003693579 scopus 로고    scopus 로고
    • Transp. Res. Board, Washington, DC, USA
    • Highway Capacity Manual, Transp. Res. Board, Washington, DC, USA, 2000.
    • (2000) Highway Capacity Manual
  • 28
    • 0018002683 scopus 로고
    • A model and an algorithm for the dynamic traffic assignment problems
    • D. K. Merchant and G. L. Nemhauser, "A model and an algorithm for the dynamic traffic assignment problems," Transp. Sci., vol. 12, no. 3, pp. 183-199, 1978.
    • (1978) Transp. Sci. , vol.12 , Issue.3 , pp. 183-199
    • Merchant, D.K.1    Nemhauser, G.L.2
  • 29
    • 0018002555 scopus 로고
    • Optimality conditions for a dynamic traffic assignment model
    • Aug
    • D. K. Merchant and G. L. Nemhauser, "Optimality conditions for a dynamic traffic assignment model," Transp. Sci., vol. 12, no. 3, pp. 200-207, Aug. 1978.
    • (1978) Transp. Sci. , vol.12 , Issue.3 , pp. 200-207
    • Merchant, D.K.1    Nemhauser, G.L.2
  • 31
    • 70349653221 scopus 로고    scopus 로고
    • Trafficmodeler: A graphical tool for programming microscopic traffic simulators through high-level abstractions
    • L. G. Papaleondiou and M. D. Dikaiakos, "Trafficmodeler: A graphical tool for programming microscopic traffic simulators through high-level abstractions," in Proc. 69th IEEE VTC Spring, 2009, pp. 1-5.
    • (2009) Proc. 69th IEEE VTC Spring , pp. 1-5
    • Papaleondiou, L.G.1    Dikaiakos, M.D.2
  • 32
    • 0000230403 scopus 로고    scopus 로고
    • Foundations of dynamic traffic assignment: The past, the present and the future
    • Sep
    • S. Peeta and A. K. Ziliaskopoulos, "Foundations of dynamic traffic assignment: The past, the present and the future," Netw. Spatial Econ., vol. 1, no. 3/4, pp. 233-265, Sep. 2001.
    • (2001) Netw. Spatial Econ. , vol.1 , Issue.3-4 , pp. 233-265
    • Peeta, S.1    Ziliaskopoulos, A.K.2
  • 35
    • 45449092042 scopus 로고    scopus 로고
    • Ph.D. dissertation, Fakultät für Inf., Inst. für Theor. Inf., Algorithmik II, Univ. Karlsruhe (TH), Karlsruhe, Germany
    • D. Schultes, "Route planning in road networks," Ph.D. dissertation, Fakultät für Inf., Inst. für Theor. Inf., Algorithmik II, Univ. Karlsruhe (TH), Karlsruhe, Germany, 2008.
    • (2008) Route Planning in Road Networks
    • Schultes, D.1
  • 36
    • 85015471226 scopus 로고    scopus 로고
    • Bee inspired online vehicle routing in large traffic systems
    • S. Senge and H. Wedde, "Bee inspired online vehicle routing in large traffic systems," in Proc. 2nd Int. Conf. ADAPTIVE, 2010, pp. 78-83.
    • (2010) Proc. 2nd Int. Conf. ADAPTIVE , pp. 78-83
    • Senge, S.1    Wedde, H.2
  • 37
    • 0002947255 scopus 로고    scopus 로고
    • A mathematical theory of communication
    • Jan
    • C. E. Shannon, "A mathematical theory of communication," ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 5, no. 1, pp. 3-55, Jan. 2001.
    • (2001) ACM SIGMOBILE Mobile Comput. Commun. Rev. , vol.5 , Issue.1 , pp. 3-55
    • Shannon, C.E.1
  • 39
    • 0003889746 scopus 로고
    • CONTRAM 5, an enhanced traffic assignment model
    • Wokingham, U.K., Res. Rep.
    • N. B Taylor, "CONTRAM 5, an enhanced traffic assignment model," Transp. Road Res. Lab., Wokingham, U.K., Res. Rep., 1990.
    • (1990) Transp. Road Res. Lab.
    • Taylor, N.B.1
  • 40
    • 0003310913 scopus 로고
    • Some theoretical aspects of road traffic research
    • Part II, Jan
    • J. G. Wardrop, "Some theoretical aspects of road traffic research," Proc. Inst. Civil Eng., vol. 1, Part II, no. 36, pp. 252-378, Jan. 1952.
    • (1952) Proc. Inst. Civil Eng. , vol.1 , Issue.36 , pp. 252-378
    • Wardrop, J.G.1
  • 43
    • 74049157401 scopus 로고    scopus 로고
    • Feeling-based location privacy protection for locationbased services
    • T. Xu and Y. Cai, "Feeling-based location privacy protection for locationbased services," in Proc. 16th ACM Conf. Comput. Commun. Security, 2009, pp. 348-357.
    • (2009) Proc. 16th ACM Conf. Comput. Commun. Security , pp. 348-357
    • Xu, T.1    Cai, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.