A privacy design problem for sharing transport service tour data

Yueshuai He, Joseph Ying Jun Chow, Mehdi Nourinejad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Despite the increasing relevance of private transport operators as Mobility-as-a-Service in the success of smart cities, desire for privacy in data sharing limits collaborations with public agencies. We propose an original model that circumvents this limitation, by designing a diffusion of the data - in this case, service tour data - such that passenger travel times remain reliable to the recipient agency. The Tour Sharing Privacy Design Problem is formulated as a nonlinear programming problem that maximizes entropy. We investigate properties of the model and iterative tour generation algorithms, and conduct a series of numerical experiments on an instance that has 90 feasible tours. The experimental results show that a k-best shortest tour approach of generating tours iteratively initially increases the gap to a lower bound before decreasing toward a final constraint gap. The model is shown to recognize the trade-offs between more reliability in data and more anonymity. Comparisons between the true and diffused travel times and OD matrices are made.

Original languageEnglish (US)
Title of host publication2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
Volume2018-March
ISBN (Electronic)9781538615256
DOIs
StatePublished - Mar 14 2018
Event20th IEEE International Conference on Intelligent Transportation Systems, ITSC 2017 - Yokohama, Kanagawa, Japan
Duration: Oct 16 2017Oct 19 2017

Other

Other20th IEEE International Conference on Intelligent Transportation Systems, ITSC 2017
CountryJapan
CityYokohama, Kanagawa
Period10/16/1710/19/17

Fingerprint

Travel time
Nonlinear programming
Entropy
Experiments
Smart city

Keywords

  • k-best traveling salesman problem
  • Mobility-as-a-Service
  • privacy design problem
  • Public-Private Partnership
  • Shannon entropy
  • vehicle tours

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Cite this

He, Y., Chow, J. Y. J., & Nourinejad, M. (2018). A privacy design problem for sharing transport service tour data. In 2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017 (Vol. 2018-March, pp. 1-6). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITSC.2017.8317692

A privacy design problem for sharing transport service tour data. / He, Yueshuai; Chow, Joseph Ying Jun; Nourinejad, Mehdi.

2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017. Vol. 2018-March Institute of Electrical and Electronics Engineers Inc., 2018. p. 1-6.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

He, Y, Chow, JYJ & Nourinejad, M 2018, A privacy design problem for sharing transport service tour data. in 2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017. vol. 2018-March, Institute of Electrical and Electronics Engineers Inc., pp. 1-6, 20th IEEE International Conference on Intelligent Transportation Systems, ITSC 2017, Yokohama, Kanagawa, Japan, 10/16/17. https://doi.org/10.1109/ITSC.2017.8317692
He Y, Chow JYJ, Nourinejad M. A privacy design problem for sharing transport service tour data. In 2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017. Vol. 2018-March. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1-6 https://doi.org/10.1109/ITSC.2017.8317692
He, Yueshuai ; Chow, Joseph Ying Jun ; Nourinejad, Mehdi. / A privacy design problem for sharing transport service tour data. 2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017. Vol. 2018-March Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1-6
@inproceedings{50e908f68e23487ba4737ea0b709633c,
title = "A privacy design problem for sharing transport service tour data",
abstract = "Despite the increasing relevance of private transport operators as Mobility-as-a-Service in the success of smart cities, desire for privacy in data sharing limits collaborations with public agencies. We propose an original model that circumvents this limitation, by designing a diffusion of the data - in this case, service tour data - such that passenger travel times remain reliable to the recipient agency. The Tour Sharing Privacy Design Problem is formulated as a nonlinear programming problem that maximizes entropy. We investigate properties of the model and iterative tour generation algorithms, and conduct a series of numerical experiments on an instance that has 90 feasible tours. The experimental results show that a k-best shortest tour approach of generating tours iteratively initially increases the gap to a lower bound before decreasing toward a final constraint gap. The model is shown to recognize the trade-offs between more reliability in data and more anonymity. Comparisons between the true and diffused travel times and OD matrices are made.",
keywords = "k-best traveling salesman problem, Mobility-as-a-Service, privacy design problem, Public-Private Partnership, Shannon entropy, vehicle tours",
author = "Yueshuai He and Chow, {Joseph Ying Jun} and Mehdi Nourinejad",
year = "2018",
month = "3",
day = "14",
doi = "10.1109/ITSC.2017.8317692",
language = "English (US)",
volume = "2018-March",
pages = "1--6",
booktitle = "2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A privacy design problem for sharing transport service tour data

AU - He, Yueshuai

AU - Chow, Joseph Ying Jun

AU - Nourinejad, Mehdi

PY - 2018/3/14

Y1 - 2018/3/14

N2 - Despite the increasing relevance of private transport operators as Mobility-as-a-Service in the success of smart cities, desire for privacy in data sharing limits collaborations with public agencies. We propose an original model that circumvents this limitation, by designing a diffusion of the data - in this case, service tour data - such that passenger travel times remain reliable to the recipient agency. The Tour Sharing Privacy Design Problem is formulated as a nonlinear programming problem that maximizes entropy. We investigate properties of the model and iterative tour generation algorithms, and conduct a series of numerical experiments on an instance that has 90 feasible tours. The experimental results show that a k-best shortest tour approach of generating tours iteratively initially increases the gap to a lower bound before decreasing toward a final constraint gap. The model is shown to recognize the trade-offs between more reliability in data and more anonymity. Comparisons between the true and diffused travel times and OD matrices are made.

AB - Despite the increasing relevance of private transport operators as Mobility-as-a-Service in the success of smart cities, desire for privacy in data sharing limits collaborations with public agencies. We propose an original model that circumvents this limitation, by designing a diffusion of the data - in this case, service tour data - such that passenger travel times remain reliable to the recipient agency. The Tour Sharing Privacy Design Problem is formulated as a nonlinear programming problem that maximizes entropy. We investigate properties of the model and iterative tour generation algorithms, and conduct a series of numerical experiments on an instance that has 90 feasible tours. The experimental results show that a k-best shortest tour approach of generating tours iteratively initially increases the gap to a lower bound before decreasing toward a final constraint gap. The model is shown to recognize the trade-offs between more reliability in data and more anonymity. Comparisons between the true and diffused travel times and OD matrices are made.

KW - k-best traveling salesman problem

KW - Mobility-as-a-Service

KW - privacy design problem

KW - Public-Private Partnership

KW - Shannon entropy

KW - vehicle tours

UR - http://www.scopus.com/inward/record.url?scp=85046277403&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046277403&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2017.8317692

DO - 10.1109/ITSC.2017.8317692

M3 - Conference contribution

VL - 2018-March

SP - 1

EP - 6

BT - 2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -