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

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

Full description

Bibliographic Details
Main Author: Nafezi, Nima
Format: Dissertation (University of Nottingham only)
Language:English
Published: 2013
Online Access:https://eprints.nottingham.ac.uk/26253/
_version_ 1848793139451527168
author Nafezi, Nima
author_facet Nafezi, Nima
author_sort Nafezi, Nima
building Nottingham Research Data Repository
collection Online Access
description 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.
first_indexed 2025-11-14T18:55:33Z
format Dissertation (University of Nottingham only)
id nottingham-26253
institution University of Nottingham Malaysia Campus
institution_category Local University
language English
last_indexed 2025-11-14T18:55:33Z
publishDate 2013
recordtype eprints
repository_type Digital Repository
spelling nottingham-262532017-10-19T21:09:04Z https://eprints.nottingham.ac.uk/26253/ A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm Nafezi, Nima 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. 2013 Dissertation (University of Nottingham only) NonPeerReviewed application/pdf en https://eprints.nottingham.ac.uk/26253/1/Nima_Nafezi_-_MSc_Dissertation_-_Business_School.pdf Nafezi, Nima (2013) A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm. [Dissertation (University of Nottingham only)] (Unpublished)
spellingShingle Nafezi, Nima
A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm
title A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm
title_full A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm
title_fullStr A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm
title_full_unstemmed A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm
title_short A Node Routing Problem with Intermediate Facilities: A Managerial Approach Based on a Heuristic Algorithm
title_sort node routing problem with intermediate facilities: a managerial approach based on a heuristic algorithm
url https://eprints.nottingham.ac.uk/26253/