Driver-Passenger Matching Problem on Online Transportation Using Goal Programming

Handojo, Andreas and Pujawan, I Nyoman and Santosa, Budi and Singgih, Moses L. (2024) Driver-Passenger Matching Problem on Online Transportation Using Goal Programming. [UNSPECIFIED]

	PDF Download (228Kb)
	PDF Download (1704Kb)

Abstract

Currently, online transportation is one of the choices for public transportation. The uniqueness of this online transportation business is that both passengers and drivers can appear anywhere and anytime. This creates difficulties for online transportation service providers in matching drivers and passengers in order to continue to increase service user satisfaction. The service provider must consider factors such as the duration of the pickup, the distance of the pickup, and the rating of the driver. This study aims to include these various factors in the decision-making process to match drivers and passengers using the goal programming method. The test was carried out by comparing the maximum distance limitation of the pick-up duration to 10 and 15 minutes. From the test results, it was found that the number of matches obtained increased by 11.6%, but with the consequence that the average pickup duration increased by 58.8%, and the average pick-up distance increased by 81.8%. Meanwhile, the driver rating obtained decreased by 5%. This needs to be considered because the greater the duration, the longer the passengers wait for pickup. The farther the distance traveled, the greater the costs incurred by the driver in picking him up. This will affect the loyalty of passengers and drivers to the service. It can be concluded that the goal programming method is capable of carrying out the matching process between drivers and passengers by considering various factors.

Actions (login required)