Cite Article

Vehicle Routing Problem with Simultaneous Pickup and Delivery

Choose citation format

BibTeX

@article{IJASEIT10234,
   author = {San Nah Sze and Siaw Ying Doreen Sek and Jeeu Fong Sze and Wai Shiang Cheah and Kang Leng Chiew},
   title = {Vehicle Routing Problem with Simultaneous Pickup and Delivery},
   journal = {International Journal on Advanced Science, Engineering and Information Technology},
   volume = {10},
   number = {4},
   year = {2020},
   pages = {1360--1366},
   keywords = {Vehicle Routing Problem; Heuristic Algorithm; Delivery and Pickup Customers; Variable Neighbourhood Search; Benchmark Data},
   abstract = {

This paper focuses on the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) issue. VRPSPD is one of the extended problems related to the usual Vehicle Routing Problem (VRP). VRPSPD consists of both linehaul customers and backhaul customers with a known demand. In VPRSPD, only a single depot can receive and supply the loads. The vehicles can only visit each customer once and can serve all customers simultaneously by delivering or picking up the loads within a limited capacity. VPRSPD is a NP-hard problem. The huge data size has increased the difficulty for it to be solved by using mathematical programming or combinatorial optimisation. A heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. Heuristic based solutions offer feasible solutions that are approximately accurate to the exact solution. It is one of the most popular solutions to solve a complex problem. In this research, the algorithm solution consists of two main phases. A simple heuristic is used to generate the initial solution in the first phase. Then, the feasible solution obtained in the first phase will become the initial input for the improvement phase which applied the VNS algorithm. The proposed algorithm is tested using a list of benchmark dataset. The result obtained is compared with the best solution that can be found from the literature research. The comparison result shows that the heuristic algorithm is favourable to be used for this kind of vehicle routing problem.

},    issn = {2088-5334},    publisher = {INSIGHT - Indonesian Society for Knowledge and Human Development},    url = {http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10234},    doi = {10.18517/ijaseit.10.4.10234} }

EndNote

%A Sze, San Nah
%A Sek, Siaw Ying Doreen
%A Sze, Jeeu Fong
%A Cheah, Wai Shiang
%A Chiew, Kang Leng
%D 2020
%T Vehicle Routing Problem with Simultaneous Pickup and Delivery
%B 2020
%9 Vehicle Routing Problem; Heuristic Algorithm; Delivery and Pickup Customers; Variable Neighbourhood Search; Benchmark Data
%! Vehicle Routing Problem with Simultaneous Pickup and Delivery
%K Vehicle Routing Problem; Heuristic Algorithm; Delivery and Pickup Customers; Variable Neighbourhood Search; Benchmark Data
%X 

This paper focuses on the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) issue. VRPSPD is one of the extended problems related to the usual Vehicle Routing Problem (VRP). VRPSPD consists of both linehaul customers and backhaul customers with a known demand. In VPRSPD, only a single depot can receive and supply the loads. The vehicles can only visit each customer once and can serve all customers simultaneously by delivering or picking up the loads within a limited capacity. VPRSPD is a NP-hard problem. The huge data size has increased the difficulty for it to be solved by using mathematical programming or combinatorial optimisation. A heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. Heuristic based solutions offer feasible solutions that are approximately accurate to the exact solution. It is one of the most popular solutions to solve a complex problem. In this research, the algorithm solution consists of two main phases. A simple heuristic is used to generate the initial solution in the first phase. Then, the feasible solution obtained in the first phase will become the initial input for the improvement phase which applied the VNS algorithm. The proposed algorithm is tested using a list of benchmark dataset. The result obtained is compared with the best solution that can be found from the literature research. The comparison result shows that the heuristic algorithm is favourable to be used for this kind of vehicle routing problem.

%U http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10234 %R doi:10.18517/ijaseit.10.4.10234 %J International Journal on Advanced Science, Engineering and Information Technology %V 10 %N 4 %@ 2088-5334

IEEE

San Nah Sze,Siaw Ying Doreen Sek,Jeeu Fong Sze,Wai Shiang Cheah and Kang Leng Chiew,"Vehicle Routing Problem with Simultaneous Pickup and Delivery," International Journal on Advanced Science, Engineering and Information Technology, vol. 10, no. 4, pp. 1360-1366, 2020. [Online]. Available: http://dx.doi.org/10.18517/ijaseit.10.4.10234.

RefMan/ProCite (RIS)

TY  - JOUR
AU  - Sze, San Nah
AU  - Sek, Siaw Ying Doreen
AU  - Sze, Jeeu Fong
AU  - Cheah, Wai Shiang
AU  - Chiew, Kang Leng
PY  - 2020
TI  - Vehicle Routing Problem with Simultaneous Pickup and Delivery
JF  - International Journal on Advanced Science, Engineering and Information Technology; Vol. 10 (2020) No. 4
Y2  - 2020
SP  - 1360
EP  - 1366
SN  - 2088-5334
PB  - INSIGHT - Indonesian Society for Knowledge and Human Development
KW  - Vehicle Routing Problem; Heuristic Algorithm; Delivery and Pickup Customers; Variable Neighbourhood Search; Benchmark Data
N2  - 

This paper focuses on the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) issue. VRPSPD is one of the extended problems related to the usual Vehicle Routing Problem (VRP). VRPSPD consists of both linehaul customers and backhaul customers with a known demand. In VPRSPD, only a single depot can receive and supply the loads. The vehicles can only visit each customer once and can serve all customers simultaneously by delivering or picking up the loads within a limited capacity. VPRSPD is a NP-hard problem. The huge data size has increased the difficulty for it to be solved by using mathematical programming or combinatorial optimisation. A heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. Heuristic based solutions offer feasible solutions that are approximately accurate to the exact solution. It is one of the most popular solutions to solve a complex problem. In this research, the algorithm solution consists of two main phases. A simple heuristic is used to generate the initial solution in the first phase. Then, the feasible solution obtained in the first phase will become the initial input for the improvement phase which applied the VNS algorithm. The proposed algorithm is tested using a list of benchmark dataset. The result obtained is compared with the best solution that can be found from the literature research. The comparison result shows that the heuristic algorithm is favourable to be used for this kind of vehicle routing problem.

UR - http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10234 DO - 10.18517/ijaseit.10.4.10234

RefWorks

RT Journal Article
ID 10234
A1 Sze, San Nah
A1 Sek, Siaw Ying Doreen
A1 Sze, Jeeu Fong
A1 Cheah, Wai Shiang
A1 Chiew, Kang Leng
T1 Vehicle Routing Problem with Simultaneous Pickup and Delivery
JF International Journal on Advanced Science, Engineering and Information Technology
VO 10
IS 4
YR 2020
SP 1360
OP 1366
SN 2088-5334
PB INSIGHT - Indonesian Society for Knowledge and Human Development
K1 Vehicle Routing Problem; Heuristic Algorithm; Delivery and Pickup Customers; Variable Neighbourhood Search; Benchmark Data
AB 

This paper focuses on the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) issue. VRPSPD is one of the extended problems related to the usual Vehicle Routing Problem (VRP). VRPSPD consists of both linehaul customers and backhaul customers with a known demand. In VPRSPD, only a single depot can receive and supply the loads. The vehicles can only visit each customer once and can serve all customers simultaneously by delivering or picking up the loads within a limited capacity. VPRSPD is a NP-hard problem. The huge data size has increased the difficulty for it to be solved by using mathematical programming or combinatorial optimisation. A heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. Heuristic based solutions offer feasible solutions that are approximately accurate to the exact solution. It is one of the most popular solutions to solve a complex problem. In this research, the algorithm solution consists of two main phases. A simple heuristic is used to generate the initial solution in the first phase. Then, the feasible solution obtained in the first phase will become the initial input for the improvement phase which applied the VNS algorithm. The proposed algorithm is tested using a list of benchmark dataset. The result obtained is compared with the best solution that can be found from the literature research. The comparison result shows that the heuristic algorithm is favourable to be used for this kind of vehicle routing problem.

LK http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=10234 DO - 10.18517/ijaseit.10.4.10234