Cover Image

Capacitated vehicle routing problem for goods delivery by using tabu search

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 d...

Full description

Saved in:
Bibliographic Details
Main Authors: Wan Ibrahim, Wan Rohaizad, Norazam, Nurul Alyaa'
Format: Conference or Workshop Item
Published: 2018
Subjects:
QA Mathematics
Online Access:http://eprints.utm.my/id/eprint/83915/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.83915
record_format eprints
spelling my.utm.839152019-11-20T03:11:28Z http://eprints.utm.my/id/eprint/83915/ Capacitated vehicle routing problem for goods delivery by using tabu search Wan Ibrahim, Wan Rohaizad Norazam, Nurul Alyaa' QA Mathematics 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. 2018-10 Conference or Workshop Item PeerReviewed 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.
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA Mathematics
spellingShingle QA Mathematics
Wan Ibrahim, Wan Rohaizad
Norazam, Nurul Alyaa'
Capacitated vehicle routing problem for goods delivery by using tabu search
description 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.
format Conference or Workshop Item
author Wan Ibrahim, Wan Rohaizad
Norazam, Nurul Alyaa'
author_facet Wan Ibrahim, Wan Rohaizad
Norazam, Nurul Alyaa'
author_sort Wan Ibrahim, Wan Rohaizad
title Capacitated vehicle routing problem for goods delivery by using tabu search
title_short Capacitated vehicle routing problem for goods delivery by using tabu search
title_full Capacitated vehicle routing problem for goods delivery by using tabu search
title_fullStr Capacitated vehicle routing problem for goods delivery by using tabu search
title_full_unstemmed Capacitated vehicle routing problem for goods delivery by using tabu search
title_sort capacitated vehicle routing problem for goods delivery by using tabu search
publishDate 2018
url http://eprints.utm.my/id/eprint/83915/
_version_ 1654960033874575360
score 13.211869

Similar Items