TY  - JOUR
T1  - Comparison Between Least Effort and Random Walk in Combined
Shipping Service
AU - Kusuma, Purba Daru 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 1
SP  - 130
EP  - 138
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.130.138
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.130.138
KW  - cost reduction
KW  -random walk
KW  -least effort
KW  -Courier service
KW  -revenue
KW  -produces
AB  - Now a days, city courier service is very popular, especially in Indonesia. This popularity is also
boosted by the rise of online motorcycle taxi service. By using city courier service, local shipment can be
delivered faster rather than regular courier service. One problem in this service is the combined shipping method
has not implemented yet. So, for customer who sends more than one package to more than one destination, the
cost is still calculated in regular price without any reduction. The other problem is even there is more than one
shipment, customer has to create order one by one and the packages will be delivered by different driver. So,
developing combined shipping system will benefit the customer and the driver. In this research, we propose
combined shipping model for city courier service by comparing two methods: least effort and random walk
algorithm. In this study, we compare the performance of combined shipping that uses least effort or random
walk method and conventional one to one shipping model. In this research, we found that combined shipping
that implements least effort algorithm produces the best performance both in non financial aspect and financial
aspect. By using least effort algorithm, system generates lowest total driver travel distance and highest average
driver’s travel distance. The financial consequence is lowest total cost that must be paid by customer and
highest average driver’s revenue.
ER  -