• English
    • Deutsch
  • English 
    • English
    • Deutsch
  • Login
View Item 
  •   Home
  • Universität Ulm
  • Publikationen
  • View Item
  •   Home
  • Universität Ulm
  • Publikationen
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Solving the ridematching problem in dynamic ridesharing

Thumbnail
vts_8370_12322.pdf (10.86Mb)
161 S.
Veröffentlichung
2013-01-29
Authors
Herbawi, Wesam M. A.
Dissertation


Faculties
Fakultät für Ingenieurwissenschaften und Informatik
Abstract
Among the transportation demand management strategies that can be used to reduce the power consumption, air pollution and traffic congestion is the ridesharing. A flexible form of ridesharing in which a rideshare can be arranged on a very short notice is called dynamic ridesharing. Recently there are many active research areas in dynamic ridesharing including but not limited to security, privacy protection, payment and ridematching. This work is mainly focused on solving the ridematching problem. The ridematching problem is to match riders and drivers, who wish to take part in ridesharing, in the best possible way taking into account the timing and end points of their trips and other constraints that can be imposed by the participants. Computerized ridematching that requires the minimal effort from the ridesharing participants is the heart of any dynamic ridesharing system. The ridematching problem in realistic dynamic ridesharing scenarios could be an extremely complex optimization problem that becomes intractable for larger problem instances. To attack the ridematching problem, we consider different variants of it and attack them by going from the more restricted to the more general variants. For each ridematching variant, we provide a model for the ridematching problem and propose an algorithm to solve it. All of the proposed algorithms are meta-heuristics as even the restricted variants of the ridematching problem are hard optimization problems in their own. The proposed algorithms are tested on artificial and realistic ridematching. Our experimentation indicates that our proposed algorithms can efficiently solve the ridematching problem by providing good quality solutions in reasonable time. In addition, a reasonable number of ridematches can be found in real world scenarios and a considerable amount of travel distances can be saved which in turn could reduce power consumption, air pollution and traffic congestion.
Date created
2012
Subject headings
[GND]: Fahrgemeinschaft
[LCSH]: Ridesharing
[Free subject headings]: Meta-heuristics | Multiobjective optimization | Ridematching | Route planning
[DDC subject group]: DDC 004 / Data processing & computer science
License
Standard
https://oparu.uni-ulm.de/xmlui/license_v3

Metadata
Show full item record

DOI & citation

Please use this identifier to cite or link to this item: http://dx.doi.org/10.18725/OPARU-2460

Herbawi, Wesam M. A. (2013): Solving the ridematching problem in dynamic ridesharing. Open Access Repositorium der Universität Ulm und Technischen Hochschule Ulm. Dissertation. http://dx.doi.org/10.18725/OPARU-2460
Citation formatter >



Policy | kiz service OPARU | Contact Us
Impressum | Privacy statement
 

 

Advanced Search

Browse

All of OPARUCommunities & CollectionsPersonsInstitutionsPublication typesUlm SerialsDewey Decimal ClassesEU projects UlmDFG projects UlmOther projects Ulm

My Account

LoginRegister

Statistics

View Usage Statistics

Policy | kiz service OPARU | Contact Us
Impressum | Privacy statement