Vehicle Routing Problem with Simultaneous Pickup and Delivery
| Main Authors: | Sze, San Nah, Sek, Siaw Ying Doreen, Sze, Jeeu Fong, Cheah, Wai Shiang, Chiew, Kang Leng |
|---|---|
| Other Authors: | Ministry of Education Malaysia under grant of FGRS/ICT07(03)/1202/2014(03) |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
International Journal on Advanced Science, Engineering and Information Technology
, 2020
|
| Subjects: | |
| Online Access: |
http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10234 http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10234/pdf_1479 |
| ctrlnum |
article-10234 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><title lang="en-US">Vehicle Routing Problem with Simultaneous Pickup and Delivery</title><creator>Sze, San Nah</creator><creator>Sek, Siaw Ying Doreen</creator><creator>Sze, Jeeu Fong</creator><creator>Cheah, Wai Shiang</creator><creator>Chiew, Kang Leng</creator><subject lang="en-US">Vehicle Routing Problem; Heuristic Algorithm; Delivery and Pickup Customers; Variable Neighbourhood Search; Benchmark Data</subject><description lang="en-US">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.</description><publisher lang="en-US">International Journal on Advanced Science, Engineering and Information Technology</publisher><contributor lang="en-US">Ministry of Education Malaysia under grant of FGRS/ICT07(03)/1202/2014(03)</contributor><date>2020-08-06</date><type>Journal:Article</type><type>Other:info:eu-repo/semantics/publishedVersion</type><type>Other:</type><type>File:application/pdf</type><identifier>http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10234</identifier><identifier>10.18517/ijaseit.10.2.10234</identifier><source lang="en-US">International Journal on Advanced Science, Engineering and Information Technology; Vol 10, No 4 (2020); 1360-1366</source><source>2460-6952</source><source>2088-5334</source><language>eng</language><relation>http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10234/pdf_1479</relation><rights lang="en-US">Authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).</rights><recordID>article-10234</recordID></dc>
|
| language |
eng |
| format |
Journal:Article Journal Other:info:eu-repo/semantics/publishedVersion Other Other: File:application/pdf File Journal:eJournal |
| author |
Sze, San Nah Sek, Siaw Ying Doreen Sze, Jeeu Fong Cheah, Wai Shiang Chiew, Kang Leng |
| author2 |
Ministry of Education Malaysia under grant of FGRS/ICT07(03)/1202/2014(03) |
| title |
Vehicle Routing Problem with Simultaneous Pickup and Delivery |
| publisher |
International Journal on Advanced Science, Engineering and Information Technology |
| publishDate |
2020 |
| topic |
Vehicle Routing Problem Heuristic Algorithm Delivery and Pickup Customers Variable Neighbourhood Search Benchmark Data |
| url |
http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10234 http://insightsociety.org/ojaseit/index.php/ijaseit/article/view/10234/pdf_1479 |
| contents |
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. |
| id |
IOS1116.article-10234 |
| institution |
Indonesian Society for Knowledge and Human Development |
| institution_id |
204 |
| institution_type |
library:special library |
| library |
Indonesian Society for Knowledge and Human Development |
| library_id |
78 |
| collection |
International Journal on Advanced Science, Engineering and Information Technology |
| repository_id |
1116 |
| subject_area |
Program Komputer dan Teknologi Informasi |
| city |
- |
| province |
DKI JAKARTA |
| repoId |
IOS1116 |
| first_indexed |
2020-08-20T16:14:18Z |
| last_indexed |
2020-10-10T18:50:25Z |
| recordtype |
dc |
| _version_ |
1722528169635872768 |
| score |
17.610468 |