Smart collection & delivery routing problem
Vehicle Routing Problem with Backhaul and Mixed load (VRPBM) extends the classical Vehicle Routing Problem (VRP), where a single vehicle can handle both delivery and collection. Both backhaul and linehaul addresses are treated the same in this solution version. Similar addresses are grouped and are...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2022
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/156656 |
| _version_ | 1811684491728519168 |
|---|---|
| author | Yap, Aaron Jia Cheng |
| author2 | Huang Shell Ying |
| author_facet | Huang Shell Ying Yap, Aaron Jia Cheng |
| author_sort | Yap, Aaron Jia Cheng |
| collection | NTU |
| description | Vehicle Routing Problem with Backhaul and Mixed load (VRPBM) extends the classical Vehicle Routing Problem (VRP), where a single vehicle can handle both delivery and collection. Both backhaul and linehaul addresses are treated the same in this solution version. Similar addresses are grouped and are considered as one unique location. A basic VRP route for these unique locations is generated using Google OR-Tools. The route is then checked to ensure the sequence fulfil all VRPBM requirements. A swapping method is used to swap locations if the current sequence fails. This version of VRPBM is compared against the classic VRP, and the improvement in number of vehicles, distance, duration and other matrices are reported. |
| first_indexed | 2024-10-01T04:29:29Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/156656 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:29:29Z |
| publishDate | 2022 |
| publisher | Nanyang Technological University |
| record_format | dspace |
| spelling | ntu-10356/1566562022-04-22T02:09:15Z Smart collection & delivery routing problem Yap, Aaron Jia Cheng Huang Shell Ying School of Computer Science and Engineering ASSYHUANG@ntu.edu.sg Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence Vehicle Routing Problem with Backhaul and Mixed load (VRPBM) extends the classical Vehicle Routing Problem (VRP), where a single vehicle can handle both delivery and collection. Both backhaul and linehaul addresses are treated the same in this solution version. Similar addresses are grouped and are considered as one unique location. A basic VRP route for these unique locations is generated using Google OR-Tools. The route is then checked to ensure the sequence fulfil all VRPBM requirements. A swapping method is used to swap locations if the current sequence fails. This version of VRPBM is compared against the classic VRP, and the improvement in number of vehicles, distance, duration and other matrices are reported. Bachelor of Engineering (Computer Science) 2022-04-22T02:09:15Z 2022-04-22T02:09:15Z 2022 Final Year Project (FYP) Yap, A. J. C. (2022). Smart collection & delivery routing problem. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/156656 https://hdl.handle.net/10356/156656 en SCSE21_0501 application/pdf Nanyang Technological University |
| spellingShingle | Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence Yap, Aaron Jia Cheng Smart collection & delivery routing problem |
| title | Smart collection & delivery routing problem |
| title_full | Smart collection & delivery routing problem |
| title_fullStr | Smart collection & delivery routing problem |
| title_full_unstemmed | Smart collection & delivery routing problem |
| title_short | Smart collection & delivery routing problem |
| title_sort | smart collection delivery routing problem |
| topic | Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence |
| url | https://hdl.handle.net/10356/156656 |
| work_keys_str_mv | AT yapaaronjiacheng smartcollectiondeliveryroutingproblem |