Dynamic car-passenger matching based on Tabu search using global optimization with time windows

Marvin Erdmann, Florian Dandl, Klaus Bogenberger

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

5 Scopus citations

Abstract

On-Demand Mobility is an increasingly popular concept especially in urban areas, which has the potential to reduce congestion and the space needed by privately owned vehicles due to shared car fleets. To avoid a decline of flexibility and convenience for the customers and to minimize the costs for the service provider, a fleet management algorithm matches the requests and the vehicles in order to quickly find a reliable and time efficient solution for the whole system. The focus of this work is to introduce a new approach to find solutions periodically using a Tabu Search metaheuristic, called Global Optimization with Time Windows. It is shown that this method allows significantly better solutions compared to those found by the Nearest Neighbor Policy, without losing the ability to quickly inform customers about their pick-up time.

Original languageEnglish
Title of host publication2019 8th International Conference on Modeling Simulation and Applied Optimization, ICMSAO 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538676844
DOIs
StatePublished - Apr 2019
Externally publishedYes
Event8th International Conference on Modeling Simulation and Applied Optimization, ICMSAO 2019 - Manama, Bahrain
Duration: 15 Apr 201917 Apr 2019

Publication series

Name2019 8th International Conference on Modeling Simulation and Applied Optimization, ICMSAO 2019

Conference

Conference8th International Conference on Modeling Simulation and Applied Optimization, ICMSAO 2019
Country/TerritoryBahrain
CityManama
Period15/04/1917/04/19

Keywords

  • Dial-a-Ride-Problem
  • Discrete Optimization
  • Metaheuristics
  • Tabu Search

Fingerprint

Dive into the research topics of 'Dynamic car-passenger matching based on Tabu search using global optimization with time windows'. Together they form a unique fingerprint.

Cite this