Publication Date

Fall 2018

Degree Type

Master's Project

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Robert Chun

Second Advisor

Teng Moh

Third Advisor

Ahmad Yazdankhah

Keywords

Ridesharing algorithms

Abstract

The use of vehicles other than ones containing combustion engines have been adopted significantly over the past few years and the direction it’s taking seems to be the future of urban transportation. The hottest vehicle of choice currently is the electric scooter. They are small and portable, fast, and less costly compared to getting in a cab from Lyft or Uber to get around town. The goal of this paper is to make a proposal to drive the creation of a safe, efficient system for these scooters’ management. This must be beneficial to all parties involved; the rider, non-riders, and the service provider. My optimization method is an algorithm that demonstrates how a larger fleet of scooters can be collected for charging or maintenance in less distance traveled. This would be possible if small hub locations are introduced for storage. These hubs not only have a great chance of being spotted, but also placed in safer areas, well-lit, and pleasing to make a stop at. It will also help pedestrians to not be obstructed by these vehicles in sidewalks. In my example, I will look at the distance traveled to collect a finite amount of scooters to charge as a charger, often called the hunter. I then compare it to the proposed system’s output and see if it can provide an improvement. This will be beneficial for the rider since they can have confidence in charge level at checkout. It can provide the charger a chance to make more income, and if at last, the service provider chooses to take on the responsibility, the benefits are evident.

Download

Share

COinS