An efficient learning-based approach to multi-objective route planning in a smart city

Yuan Yao, Zhe Peng, Bin Xiao, Jichang Guan

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

11 Citations (Scopus)

Abstract

Route planning is an important service in the map navigation. However, most of commercial map applications provide an optimal path that only minimize a single metric such as distance, time or other costs, while ignoring a critical criterion: safety. When citizens or travellers walk in a city, they may prefer to find a safe walking route to avoid the potential crime risk and to have a short distance, which can be formulated as a multi-objective optimization problem. Many previous methods are proposed to solve the multi-objective route planning, however, most of them are not efficient or optimized in a large-scale road network. In this paper, we propose a reinforcement learning based Multi-Objective Hyper-Heuristic (MOHH) approach to route planning in a smart city. We conduct experiments on the safety index map constructed based on the historical urban data of the New York city. Comprehensive experimental results show that the proposed approach is almost 34 and 1.4 times faster than the exact multi-objective optimization algorithm and the NSGA-II algorithm respectively. Moreover, it can obtain more than 80% Pareto optimal solutions in a large-scale road network.
Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
PublisherIEEE
ISBN (Electronic)9781467389990
DOIs
Publication statusPublished - 28 Jul 2017
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 21 May 201725 May 2017

Conference

Conference2017 IEEE International Conference on Communications, ICC 2017
Country/TerritoryFrance
CityParis
Period21/05/1725/05/17

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this