Round Robin-Least Cost Combined Model in City Courier Scheduled Shipping Service

摘要

Nowadays, online motorcycle taxi based city courier service has arising. This provider serves faster delivery time rather than conventional courier service. Unfortunately, the existing motorcycle taxi based city courier service has not accommodated multi customer multi shipping order request. It means that customer must create order one by one if the he wants to send more than one package and each order will be executed by distinct driver. This condition is not efficient. In this research, we propose scheduled shipping model, so that, more than one package from more than one customer will be grouped and each package group will be delivered by distinct driver. The goal is reducing delivery distance, so that, cost that must be paid by sender will be reduced too. This model is developed by combining round robin and least cost method. In this research, we propose three models: non preferred sender maximum distance limitation, maximum number of non preferred sender limitation and weighted non preferred sender distance. In this research, we observe both financial and non financial aspects. Based on the simulation result, these proposed models can reduce total delivery distance and sender cost. The third model produces the highest efficiency while the first model produces the lowest efficiency.