Job Assignment Problem on Online Transportation Order Using Hungarian Algorithm

The more advanced a civilization is, the higher the mobility of its population. It
takes a means of transportation that can answer the needs of the community.
Currently, online transportation is an option in answering public transportation
needs. The uniqueness of the online transportation business is that passengers
can place orders anytime and anywhere. On the other hand, the driver can also
be active/available anytime and anywhere. This causes problems in fulfilling
orders, providers must consider various factors such as the time and distance
of the driver to get to the pick-up location in determining which driver is
assigned to fulfill the order. This study simulates order assignment using the
Hungarian method, Minimum Value of Selected Factor in Data Collection, and
random assignment. From the test results, it is known that the highest average
pick-up duration and pickup distance are obtained using the random method
and the lowest average using the Hungarian method. The highest average time
to determine the assignment is obtained by the Hungarian method, while the
smallest is the random method. Based on these results, it can be concluded
that the Hungarian method is better than the other two methods.