Wan Ibrahim, Wan Rohaizad and Norazam, Nurul Alyaa' (2018) Capacitated vehicle routing problem for goods delivery by using tabu search. In: Proceeding of Final Year Project Symposium 2018, 31 May 2018 through 1 June 2018, UTM Skudai.
Full text not available from this repository.
Abstract
The main purpose of this study is to optimize the route for two vehicles that start and end from central depot to each location as well as to compare the results between the greedy and Tabu Search methods. To solve this problem, C ++ programming has been used to solve the CVRP which involves large data sets. Hence, computer results indicate the nearest distance that should be passed by two vehicles for total of 63 locations.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Transportation, delivery |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Science |
| ID Code: | 83915 |
| Deposited By: | Widya Wahid |
| Deposited On: | 30 Sep 2019 13:55 |
| Last Modified: | 20 Nov 2019 03:11 |
Repository Staff Only: item control page
