TY - JOUR
T1 - Simulated annealing heuristic for the general share-a-ride problem
AU - Yu, Vincent F.
AU - Purwanti, Sesya Sri
AU - Redi, A. A.N.Perwira
AU - Lu, Chung-Cheng
AU - Suprayogi, Suprayogi
AU - Jewpanya, Parida
N1 - Publisher Copyright:
© 2018 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2018/7/3
Y1 - 2018/7/3
N2 - This research introduces an extension of the share-a-ride problem (SARP), called the general share-a-ride problem (G-SARP). Similarly to SARP. taxi in G-SARP can service passenger and package requests at the same time. However, G-SARP allows the taxi to transport more than one passenger at the same time, which is more beneficial in practical situations. In addition, G-SARP has no restrictions on the maximum riding time o. passenger, and the number of parcel requests that can be inserted between the pick-up and drop-off points o. passenger is limited only by vehicle capacity. simulated annealing (SA) algorithm is proposed to solve G-SARP. The proposed SA algorithm is compared with basic SA and tabu search (TS) algorithms. The results show that the proposed SA algorithm outperforms basic SA and TS algorithms. Moreover, further analysis shows that G-SARP solutions are better than those of SARP in most cases.
AB - This research introduces an extension of the share-a-ride problem (SARP), called the general share-a-ride problem (G-SARP). Similarly to SARP. taxi in G-SARP can service passenger and package requests at the same time. However, G-SARP allows the taxi to transport more than one passenger at the same time, which is more beneficial in practical situations. In addition, G-SARP has no restrictions on the maximum riding time o. passenger, and the number of parcel requests that can be inserted between the pick-up and drop-off points o. passenger is limited only by vehicle capacity. simulated annealing (SA) algorithm is proposed to solve G-SARP. The proposed SA algorithm is compared with basic SA and tabu search (TS) algorithms. The results show that the proposed SA algorithm outperforms basic SA and TS algorithms. Moreover, further analysis shows that G-SARP solutions are better than those of SARP in most cases.
KW - General share-a-ride problem
KW - ride sharing
KW - share-a-ride problem
KW - simulated annealing
UR - http://www.scopus.com/inward/record.url?scp=85042915622&partnerID=8YFLogxK
U2 - 10.1080/0305215X.2018.1437153
DO - 10.1080/0305215X.2018.1437153
M3 - Article
AN - SCOPUS:85042915622
SN - 0305-215X
VL - 50
SP - 1178
EP - 1197
JO - Engineering Optimization
JF - Engineering Optimization
IS - 7
ER -