Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 950876, 8 pages
http://dx.doi.org/10.1155/2013/950876
Research Article

Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

1State Key Laboratory of Automobile Simulation and Control, School of Traffic, Jilin University, Changchun 130025, China
2School of Traffic, Jilin University, Changchun 130025, China

Received 5 September 2013; Accepted 24 October 2013

Academic Editor: Wuhong Wang

Copyright © 2013 De-Xin Yu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Mesbah, M. Sarvi, I. Ouveysi, and G. Currie, “Optimization of transit priority in the transportation network using a decomposition methodology,” Transportation Research C, vol. 19, no. 2, pp. 363–373, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Cicerone, G. D'Angelo, G. di Stefano, D. Frigioni, and V. Maurizio, “Engineering a new algorithm for distributed shortest paths on dynamic networks,” Algorithmica, vol. 66, no. 1, pp. 51–86, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. M. R. Khouadjia, E. Talbi, L. Jourdan, B. Sarasola, and E. Alba, “Multi-environmental cooperative parallel metaheuristics for solving dynamic optimization problems,” The Journal of Supercomputing, vol. 63, no. 3, pp. 836–853, 2013. View at Publisher · View at Google Scholar
  4. C. Artigues, M.-J. Huguet, F. Gueye, F. Schettini, and L. Dezou, “State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths,” Transportation Research C, vol. 27, pp. 233–259, 2013. View at Google Scholar
  5. L. Fu, “An adaptive routing algorithm for in-vehicle route guidance systems with real-time information,” Transportation Research B, vol. 35, no. 8, pp. 749–765, 2001. View at Publisher · View at Google Scholar · View at Scopus
  6. Y. Nagasaka, K. Okada, A. Nakamura et al., “Method combining focus-shift and angle multiplexing method for holographic data storage,” Japanese Journal of Applied Physics, vol. 47, no. 7, pp. 5904–5908, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. M. A. A. Martínez, J. Cordeau, M. Dell'Amico, and M. Iori, “A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks,” INFORMS Journal on Computing, vol. 25, no. 1, pp. 41–55, 2013. View at Google Scholar
  8. H. Sundell and P. Tsigas, “Lock-free deques and doubly linked lists,” Journal of Parallel and Distributed Computing, vol. 68, no. 7, pp. 1008–1020, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. A. Arvind and C. P. Rangan, “Symmetric Min-Max heap: a simpler data structure for double-ended priority queue,” Information Processing Letters, vol. 69, no. 4, pp. 197–199, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. D. Luxen and P. Sanders, “Hierarchy decomposition for faster user equilibria on road networks,” in Experimental Algorithms, vol. 6630 of Lecture Notes in Computer Science, pp. 242–253, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Gilles and Y. Meyer, “Properties of BV-G structures + textures decomposition models. Application to road detection in satellite images,” IEEE Transactions on Image Processing, vol. 19, no. 11, pp. 2793–2800, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Rosas, J. Castro, and L. Montero, “Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem,” Computational Optimization and Applications, vol. 44, no. 2, pp. 289–313, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. M. Holzer, F. Schulz, and D. Wagner, “Engineering multilevel overlay graphs for shortest-path queries,” Journal of Experimental Algorithmics, vol. 13, article 5, pp. 1–26, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Yoshikawa and H. Terai, “Hardware-oriented ant colony optimization and its application to dynamic route guidance problem,” IEEJ Transactions on Electrical and Electronic Engineering, vol. 6, no. 3, pp. 221–228, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. C. Ren, “Study on improved tabu search algorithm for Min-Max vehicle routing problem,” Applied Mechanics and Materials, vol. 87, pp. 178–181, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. L. Roditty, “On the k shortest simple paths problem in weighted directed graphs,” SIAM Journal on Computing, vol. 39, no. 6, pp. 2363–2376, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. H. Meyerhenke, B. Monien, and T. Sauerwald, “A new diffusion-based multilevel algorithm for computing graph partitions,” Journal of Parallel and Distributed Computing, vol. 69, no. 9, pp. 750–761, 2009. View at Publisher · View at Google Scholar · View at Scopus