Applying Simulated Annealing and Parallel Computing to the Mobile Sequential Recommendation

Zeyang Ye, Keli Xiao, Yong Ge, Yuefan Deng

Research output: Contribution to journalArticlepeer-review


We speed up the solution of the mobile sequential recommendation (MSR) problem that requires searching optimal routes for empty taxi cabs through mining massive taxi GPS data. We develop new methods that combine parallel computing and the simulated annealing with novel global and local searches. While existing approaches usually involve costly offline algorithms and methodical pruning of the search space, our new methods provide direct real-time search for the optimal route without the offline preprocessing. Our methods significantly reduce computational time for the high dimensional MSR problems from days to seconds based on the real-world data as well as the synthetic ones. We efficiently provide solutions to MSR problems with thousands of pick-up points without offline training, compared to the published record of 25 pick-up points.

Original languageEnglish (US)
Article number8338062
Pages (from-to)243-256
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Issue number2
StatePublished - Feb 1 2019


  • Mobile sequential recommendation
  • parallel computing
  • potential travel distance
  • simulated annealing

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Applying Simulated Annealing and Parallel Computing to the Mobile Sequential Recommendation'. Together they form a unique fingerprint.

Cite this