A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm

Nafezi, Nima (2013) A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm. [Dissertation (University of Nottingham only)] (Unpublished)

[img] PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (3MB)

Abstract

In this dissertation, we discussed a type of vehicle routing problem called vehicle routing problem with intermediate facilities with consideration of the impact of adding intermediate facilities to the problem. To study how IFs change the result of the problem, we firstly present a simple model based on clustering algorithm along with finding the shortest route between clusters, implementing Clarke and Wright’s algorithm within each cluster. Then we determine a set of design of experiments which allows us to study different characteristics of the problem. Generating graphs and tables from the results, we analyse them by considering two concepts; radial routing and local routing distances. The outcomes show the more important role of radial routing distance which has often significantly higher impact compared to the local routing distance.

Item Type: Dissertation (University of Nottingham only)
Depositing User: EP, Services
Date Deposited: 30 Apr 2014 09:40
Last Modified: 24 Oct 2016 17:54
URI: http://eprints.nottingham.ac.uk/id/eprint/26253

Actions (Archive Staff Only)

Edit View Edit View