A comparison of algorithms for origin-destination matrix generation on real road networks and an approximation approach

Computers and Industrial Engineering

Volumn 56, Issue 1, 2009, Pages 70-76

  Kim, Byung In ^a   Jeong, Sangwon ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Approximation algorithm; Origin destination matrix; Real road networks; Shortest path algorithms

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MOTOR TRANSPORTATION; ROADS AND STREETS; TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING; WIRELESS SENSOR NETWORKS;

APPROXIMATION ALGORITHM; APPROXIMATION APPROACHES; BUCKET DATA STRUCTURES; COMPUTATION TIME; DIJKSTRA'S ALGORITHMS; DISTANCE VALUES; MATRIXES; O-D MATRIXES; OD PAIRS; ORIGIN DESTINATIONS; ORIGIN-DESTINATION MATRIX; REAL ROAD NETWORKS; SHORTEST DISTANCES; SHORTEST PATH ALGORITHMS; SHORTEST PATHS; TRAVELING SALESMAN;

APPROXIMATION ALGORITHMS;

EID: 59049103198     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.03.016     Document Type: Article

References (18)

1. Carre B.A. An algebra for network routing problems. IMA Journal of Applied Mathematics 7 (1971) 273-294
2. Cherkassky B.V., Goldberg A.V., and Radzik T. Shortest paths algorithms: Theory and experimental evaluations. Mathematical Programming 73 (1996) 129-174
3. Dijkstra E.W. A note on two problems in connexion with graphs. Numeriche Mathematik 1 (1959) 269-271
4. Floyd Jr. L.R. Algorithm 97, shortest path. Communications of the ACM 5 6 (1962) 345
5. * search meets graph theory. Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (2005), Vancouver, British Columbia 156-165
6. Holzer M., Schulz F., and Willhalm T. Combining speed-up techniques for shortest-path computations. Lecture Notes in Computer Science 3059 (2004) 269-284
7. Ikeda, T., Hsu, M. & Imai, H. (1994). A fast algorithm for finding better routes by AI search techniques. In Proceeding of the vehicle navigation and information systems conference (pp. 291-296).
8. Kim B., Kim S., and Sahoo S. Waste collection vehicle routing problem with time windows. Computers and Operations Research 33 12 (2006) 3624-3642
9. Pallottino S. Shortest-path methods: Complexity, interrelations, and new propositions. Networks 14 (1984) 257-267
10. Sahoo S., Kim S., Kim B., Kraas B., and Popov Jr. A. Routing optimization for waste management. Interfaces 35 1 (2005) 24-36
11. Sanders P., and Schultes D. Highway hierarchies hasten exact shortest path queries. Lecture Notes in Computer Science 3669 (2005) 568-579
12. Schulz F., Wagner D., and Zaroliagis C. Using multi-level graphs for timetable information in railway systems. Lecture Notes in Computer Science 2409 (2002) 43-59
13. Wagner D., and Willhalm T. Geometric speed-up techniques for finding shortest paths in large sparse graphs. Lecture Notes in Computer Science 2832 (2003) 776-787
14. Wang I.L., Johnson E.L., and Sokol J.S. A multiple pairs shortest path algorithm. Transportation Science 39 4 (2005) 465-476
15. Weigel D., and Cao B. Applying GIS and OR techniques to solve Sears technician-dispatching and home-delivery problems. Interfaces 29 1 (1999) 112-130
16. Zhan F.B. Three fastest shortest path algorithms on real road networks: Data structures and procedures. Journal of Geographic Information and Decision Analysis 1 (1997) 69-82
17. Zhan F.B., and Noon C.E. Shortest path algorithms: An evaluation using real road networks. Transportation Science 32 1 (1998) 65-73
18. Zhan F.B., and Noon C.E. A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths. Journal of Geographic Information and Decision Analysis 4 2 (2000) 1-13