Review of Taxi Cab Service Optimization in Petaling Jaya, Malaysia Based On Demand and Offer

In this paper, several approaches were evaluated to assign taxi cabs to passenger's demand in the Universiti Malaya Medical Centre (UMMC) vicinity area. UMMC located in the heart of Petaling Jaya, Selangor. The main purpose of this paper covers two aspects; to identify the efficient solution for taxi cab assignments to pick up the passengers by minimizing the travelling distance and time taken and taxi cab assignment strategy. The calculation method to measure the taxi cab distance to the passengers was based on two methods; Euclidean distance and shortest path algorithm based on GPS-based routing. For the taxi cab assignment strategy, two algorithms were used; the Greedy Algorithm and Hungarian Algorithm. The Greedy Algorithm is based on nearest vehicles to the passenger while the Hungarian Algorithm is based on matrix calculation of the requested calls and number of available taxi cabs. The combination of two distance calculation and two vehicles assignment produced four possible approaches. These four approaches were further evaluated in three different scenarios using a simulator.