Please use this identifier to cite or link to this item:
Title: Solving optimisation problems using computer software
Authors: Wong, Sarah Elita Shi Yuan
Keywords: DRNTU::Engineering::Mechanical engineering
Issue Date: 2018
Abstract: This report contains a summary and comparison of some of the different approaches which have been used to formulate and solve single-depot Vehicle Routing Problems (VRPs). The approaches studied in this report consist of exact approaches (Transformation of VRP to TSP and Branch-and-bound method), some of the more popular heuristic approaches (Clarke and Wright Savings Algorithm, Holmes and Parker, Fisher and Jaikumar), and a metaheuristic (Genetic Algorithm). In this project, we test out the applications of the combination of “Transformation of VRP to TSP” with Genetic Algorithm and to Microsoft Excel Solver, and “Vehicle Flow Formulation combined with Simplex Method” to obtain solutions for a single-depot VRP.
Schools: School of Mechanical and Aerospace Engineering 
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP Final Report.pdf
  Restricted Access
3.78 MBAdobe PDFView/Open

Page view(s)

Updated on Jun 14, 2024

Download(s) 50

Updated on Jun 14, 2024

Google ScholarTM


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