Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection

In this thesis, a new problem of arc routing for a fleet of vehicles in waste collection is studied. Objectively, this study investigates the effect of external factor, precisely the rainy weightage to expect the optimum routing cost and the number of trips for a fleet of vehicles in domestic waste...

Full description

Saved in:
Bibliographic Details
Main Author: Ramli, Mohammad Fadzli
Format: Thesis
Language:English
Published: 2012
Subjects:
Online Access:http://eprints.utm.my/id/eprint/30693/5/MohammadFadzliRamliPFS2012.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-utm-ep.30693
record_format uketd_dc
spelling my-utm-ep.306932017-09-29T05:59:14Z Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection 2012-07 Ramli, Mohammad Fadzli Q Science (General) In this thesis, a new problem of arc routing for a fleet of vehicles in waste collection is studied. Objectively, this study investigates the effect of external factor, precisely the rainy weightage to expect the optimum routing cost and the number of trips for a fleet of vehicles in domestic waste collection. Although the rain is considered a crucial factor in Malaysia due to its ability to change the demand behaviour, consequently increased the quantity and trips, this factor has never been studied within the context of routing problems. Thus, two problems namely capacitated arc routing problem with stochastic demand (CARPSD) and capacitated arc routing problem with delivery time window (CARPDTW) were formulated to present the vehicle operations in waste collection. In general, conventional CARP in waste collection lies on undirected network graph, where a vehicle starts with empty capacity at a depot, performs pick-up of the customer demands on a set of required edges and ends at the depot without exceeding its capacity. In order to produce optimum or near-optimum solutions, constructive heuristics (CH) with several techniques such as modified path-scanning, switching rule, route compactness rule and shortest route rule are implemented. The performance of CH is tested on four real-life instances and a set of established benchmark dataset. In conclusion, the CH is able to produce optimum or near-optimum results in terms of routing cost and trips for a fleet of vehicles within a very fast computation time and is stable without any variation when compared to other methods, such as tabu search, reactive tabu search and column generation. 2012-07 Thesis http://eprints.utm.my/id/eprint/30693/ http://eprints.utm.my/id/eprint/30693/5/MohammadFadzliRamliPFS2012.pdf application/pdf en public phd doctoral Universiti Teknologi Malaysia, Faculty of Science Faculty of Science
institution Universiti Teknologi Malaysia
collection UTM Institutional Repository
language English
topic Q Science (General)
spellingShingle Q Science (General)
Ramli, Mohammad Fadzli
Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
description In this thesis, a new problem of arc routing for a fleet of vehicles in waste collection is studied. Objectively, this study investigates the effect of external factor, precisely the rainy weightage to expect the optimum routing cost and the number of trips for a fleet of vehicles in domestic waste collection. Although the rain is considered a crucial factor in Malaysia due to its ability to change the demand behaviour, consequently increased the quantity and trips, this factor has never been studied within the context of routing problems. Thus, two problems namely capacitated arc routing problem with stochastic demand (CARPSD) and capacitated arc routing problem with delivery time window (CARPDTW) were formulated to present the vehicle operations in waste collection. In general, conventional CARP in waste collection lies on undirected network graph, where a vehicle starts with empty capacity at a depot, performs pick-up of the customer demands on a set of required edges and ends at the depot without exceeding its capacity. In order to produce optimum or near-optimum solutions, constructive heuristics (CH) with several techniques such as modified path-scanning, switching rule, route compactness rule and shortest route rule are implemented. The performance of CH is tested on four real-life instances and a set of established benchmark dataset. In conclusion, the CH is able to produce optimum or near-optimum results in terms of routing cost and trips for a fleet of vehicles within a very fast computation time and is stable without any variation when compared to other methods, such as tabu search, reactive tabu search and column generation.
format Thesis
qualification_name Doctor of Philosophy (PhD.)
qualification_level Doctorate
author Ramli, Mohammad Fadzli
author_facet Ramli, Mohammad Fadzli
author_sort Ramli, Mohammad Fadzli
title Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
title_short Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
title_full Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
title_fullStr Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
title_full_unstemmed Constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
title_sort constructive heuristics for weather-type models of capacitated arc routing problems in waste collection
granting_institution Universiti Teknologi Malaysia, Faculty of Science
granting_department Faculty of Science
publishDate 2012
url http://eprints.utm.my/id/eprint/30693/5/MohammadFadzliRamliPFS2012.pdf
_version_ 1747815725389578240