Please use this identifier to cite or link to this item:
Title: Smart collection & delivery routing problem
Authors: Yap, Aaron Jia Cheng
Keywords: Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Yap, A. J. C. (2022). Smart collection & delivery routing problem. Final Year Project (FYP), Nanyang Technological University, Singapore.
Project: SCSE21_0501
Abstract: 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.
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
1.09 MBAdobe PDFView/Open

Page view(s)

Updated on May 21, 2022


Updated on May 21, 2022

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.