Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2019, Article ID 8728245, 13 pages
https://doi.org/10.1155/2019/8728245
Research Article

Finding the Shortest Path with Vertex Constraint over Large Graphs

1College of Intelligence and Computing, Tianjin University, China
2State Key Laboratory of Digital Publishing Technology, Beijing, China

Correspondence should be addressed to Xin Wang; nc.ude.ujt@xgnaw

Received 30 November 2018; Accepted 31 January 2019; Published 19 February 2019

Guest Editor: Xin Huang

Copyright © 2019 Yajun Yang 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. Z. Tan, X. Zhao, Y. Fang, and W. Xiao, “GTrans: generic knowledge graph embedding via multi-state entities and dynamic relation spaces,” IEEE Access, vol. 6, no. 99, pp. 8232–8244, 2018. View at Publisher · View at Google Scholar · View at Scopus
  2. W. Yuan, K. He, D. Guan, and G. Han, “Edge-dual graph preserving sign prediction for signed social networks,” IEEE Access, vol. PP, no. 99, pp. 1–1, 2017. View at Google Scholar
  3. J. Zhang, H. Yang, H. Song, and Y. Zhang, “An improved archaeology algorithm based on integrated multi-source biological information for yeast protein interaction network,” IEEE Access, vol. 5, no. 99, pp. 15893–15900, 2017. View at Publisher · View at Google Scholar · View at Scopus
  4. Y.-C. Chen and C. Lee, “Skyline path queries with aggregate attributes,” IEEE Access, vol. 4, pp. 4690–4706, 2016. View at Publisher · View at Google Scholar · View at Scopus
  5. Y. Yuan, L. Chen, and G. Wang, “Efficiently answering probability threshold-based shortest path queries over uncertain graphs,” International Conference on Database Systems for Advanced Applications, pp. 155–170, 2010. View at Google Scholar
  6. Y. Yuan, X. Lian, L. Chen, Y. Sun, and G. Wang, “RSkNN: kNN search on road networks by incorporating social influence,” IEEE Transactions on Knowledge & Data Engineering, vol. 28, no. 6, pp. 1575–1588, 2016. View at Publisher · View at Google Scholar
  7. X. Cao, L. Chen, C. Gao, and X. Xiao, “Keyword-aware optimal route search,” Proceedings of the Vldb Endowment, vol. 5, no. 11, pp. 1136–1147, 2012. View at Google Scholar
  8. M. N. Rice and V. J. Tsotras, “Exact graph search algorithms for generalized traveling salesman path problems,” in International Symposium on Experimental Algorithms, pp. 344–355, Springer, 2012.
  9. R. Geisberger, P. Sanders, D. Schultes, and D. Delling, “Contraction hierarchies: Faster and simpler hierarchical routing in road networks,” in International Workshop on Experimental and Efficient Algorithms, pp. 319–333, Springer, 2008.
  10. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. R. C. Prim, “Shortest connection networks and some generalizations,” Bell Labs Technical Journal, vol. 36, no. 6, pp. 1389–1401, 1957. View at Publisher · View at Google Scholar
  12. F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, and S. Teng, “On trip planning queries in spatial databases,” in International Symposium on Spatial and Temporal Databases, pp. 273–290, Springer, 2005.
  13. H. Vardhan, S. Billenahalli, W. Huang et al., “Finding a simple path with multiple must-include nodes,” in Modeling, Analysis & Simulation of Computer and Telecommunication Systems MASCOTS’09, pp. 1–3, IEEE International Symposium on. IEEE, 2009.
  14. Y. Lu, U. Benlic, and Q. Wu, “A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection,” Computers & Operations Research, vol. 90, pp. 193–207, 2018. View at Publisher · View at Google Scholar · View at Scopus
  15. C. Chekuri and K. Quanrud, Fast Approximations for Metric-Tsp via Linear Programming, 2018.
  16. M. Diaby and M. H. Karwan, “Advances in combinatorial optimization: Linear programming formulations of the traveling salesman and other hard combinatorial optimization problems,” World Scientific, 2016. View at Google Scholar
  17. A. Chaudhuri and K. De, “Fuzzy multi-objective linear programming for traveling salesman problem,” African Journal of Mathematics Computer Science Research, vol. 4, pp. 64–70, 2011. View at Google Scholar
  18. M. Mahi, Ö. K. Baykan, and H. Kodaz, “A new hybrid method based on particle swarm optimization, ant colony optimization and 3-Opt algorithms for traveling salesman problem,” Applied Soft Computing, vol. 30, pp. 484–490, 2015. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Wang and P. Y. Yin, “An approximate algorithm for triangle tsp with a four-vertex-three-line inequality,” International Journal of Applied Metaheuristic Computing, vol. 6, no. 1, pp. 35–46, 2015. View at Google Scholar
  20. S. Deb, S. Fong, Z. Tian, R. K. Wong, S. Mohammed, and J. Fiaidhi, “Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm,” The Journal of Supercomputing, vol. 72, no. 10, pp. 1–33, 2016. View at Publisher · View at Google Scholar · View at Scopus
  21. G. Zhang, M. Gheorghe, and J. Cheng, “An approximate algorithm combining p systems and ant colony optimization for taraveling salesman problems,” Miguel Angel Martłnez Del Amor, pp. 321–340, 2010. View at Google Scholar
  22. S. S. S. Srivastava, S. Kumar, R. C. Garg, and P. Sen, “Generalized traveling salesman problem through n sets of nodes,” Cors Journal, 1969. View at Google Scholar
  23. M. F. Tasgetiren, P. N. Suganthan, and Q. K. Pan, “An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem,” Applied Mathematics and Computation, vol. 215, no. 9, pp. 3356–3368, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. M. F. Tasgetiren, P. N. Suganthan, and Q. Pan, “A discrete particle swarm optimization algorithm for the generalized traveling salesman problem,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 158–167, New York, NY, USA, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  25. M. N. Rice and V. J. Tsotras, “Engineering generalized shortest path queries,” in Proceedings of the 2013 29th IEEE International Conference on Data Engineering (ICDE 2013), pp. 949–960, April 2013. View at Publisher · View at Google Scholar
  26. N. Ascheuer, M. Jünger, and G. Reinelt, “A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints,” Computational Optimization and Applications, vol. 17, no. 1, pp. 61–84, 2000. View at Google Scholar · View at Scopus
  27. C. Moon, J. Kim, G. Choi, and Y. Seo, “An efficient genetic algorithm for the traveling salesman problem with precedence constraints,” European Journal of Operational Research, vol. 140, no. 3, pp. 606–617, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. X. Wang and A. C. Regan, “The traveling salesman problem with separation requirements,” European Journal of Operational Research, vol. 140, no. 5, 2002. View at Google Scholar
  29. M. Karan and N. Skorin-Kapov, “A branch and bound algorithm for the sequential ordering problem,” in MIPRO, 2011 Proceedings of the 34th International Convention, pp. 452–457, IEEE, 2011.
  30. X. Cao, L. Chen, G. Cong, J. Guan, N. Phan, and X. Xiao, “KORS: Keyword-aware optimal route search system,” in 29th IEEE International Conference on Data Engineering, ICDE 2013, pp. 1340–1343, Brisbane, Australia, April 2013.
  31. S. Shang, L. Chen, Z.-W. Wei, D.-H. Guo, and J.-R. Wen, “Dynamic shortest path monitoring in spatial networks,” Journal of Computer Science and Technology, vol. 31, no. 4, pp. 637–648, 2016. View at Publisher · View at Google Scholar · View at Scopus
  32. S. Shang, L. Chen, Z. Wei, C. S. Jensen, J.-R. Wen, and P. Kalnis, “Collective travel planning in spatial networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 5, pp. 1132–1146, 2016. View at Publisher · View at Google Scholar · View at Scopus