Skip to main navigation Skip to search Skip to main content

A parallel simulated annealing enhancement of the optimal-matching heuristic for ridesharing

  • Stony Brook University
  • Dalian University of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

In this paper, we develop an efficient parallelheuristic method for solving the global optimization problemassociated with the ridesharing system. Based on the carefullyformalized problem and objective function, we fully utilize theheuristic characteristics of the algorithm for handling the real-lifeconstraints in ridesharing. Following the principles of simulatedannealing, our method is adaptive in handling the matchingand route optimization tasks. We develop an efficient parallelscheme with simulated annealing, named PCSA, for solving theglobal optimization problem for ridesharing. Our algorithm iscapable to efficiently address the potential of ridesharing byexploiting the mobility information of the ride requests. Basedon extensive experiments on large real-world data, we validatethe performance of our parallel heuristic algorithm. Our resultsconfirm the effectiveness and efficiency of the proposed methodand its superiority over all other benchmarks.

Original languageEnglish
Title of host publicationProceedings - 19th IEEE International Conference on Data Mining, ICDM 2019
EditorsJianyong Wang, Kyuseok Shim, Xindong Wu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages906-915
Number of pages10
ISBN (Electronic)9781728146034
DOIs
StatePublished - Nov 2019
Event19th IEEE International Conference on Data Mining, ICDM 2019 - Beijing, China
Duration: Nov 8 2019Nov 11 2019

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
Volume2019-November

Conference

Conference19th IEEE International Conference on Data Mining, ICDM 2019
Country/TerritoryChina
CityBeijing
Period11/8/1911/11/19

Keywords

  • Global-optimization
  • Heuristic-method
  • Parallel-Computing
  • Ridesharing
  • Simulated-Annealing

Fingerprint

Dive into the research topics of 'A parallel simulated annealing enhancement of the optimal-matching heuristic for ridesharing'. Together they form a unique fingerprint.

Cite this