Solving optimisation problems using computer software
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), so...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/75772 |
| _version_ | 1811687640146116608 |
|---|---|
| author | Wong, Sarah Elita Shi Yuan |
| author2 | Tai Kang |
| author_facet | Tai Kang Wong, Sarah Elita Shi Yuan |
| author_sort | Wong, Sarah Elita Shi Yuan |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T05:19:31Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/75772 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:19:31Z |
| publishDate | 2018 |
| record_format | dspace |
| spelling | ntu-10356/757722023-03-04T19:11:52Z Solving optimisation problems using computer software Wong, Sarah Elita Shi Yuan Tai Kang School of Mechanical and Aerospace Engineering DRNTU::Engineering::Mechanical engineering 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. Bachelor of Engineering (Mechanical Engineering) 2018-06-14T04:14:50Z 2018-06-14T04:14:50Z 2018 Final Year Project (FYP) http://hdl.handle.net/10356/75772 en Nanyang Technological University 53 p. application/pdf |
| spellingShingle | DRNTU::Engineering::Mechanical engineering Wong, Sarah Elita Shi Yuan Solving optimisation problems using computer software |
| title | Solving optimisation problems using computer software |
| title_full | Solving optimisation problems using computer software |
| title_fullStr | Solving optimisation problems using computer software |
| title_full_unstemmed | Solving optimisation problems using computer software |
| title_short | Solving optimisation problems using computer software |
| title_sort | solving optimisation problems using computer software |
| topic | DRNTU::Engineering::Mechanical engineering |
| url | http://hdl.handle.net/10356/75772 |
| work_keys_str_mv | AT wongsarahelitashiyuan solvingoptimisationproblemsusingcomputersoftware |