Implementation weather-type models of capacitated are routing problem via heuristics

In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle's operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable nam...

Full description

Saved in:
Bibliographic Details
Main Authors: Ismail, Zuhaimy, Ramli, Muhamad Fadzli
Format: Article
Published: Science Publications 2011
Subjects:
Online Access:http://eprints.utm.my/id/eprint/44974/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.44974
record_format eprints
spelling my.utm.449742017-09-19T08:26:04Z http://eprints.utm.my/id/eprint/44974/ Implementation weather-type models of capacitated are routing problem via heuristics Ismail, Zuhaimy Ramli, Muhamad Fadzli QC Physics In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle's operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did not increase in volumes, but in weights due to rain drops. Consequently, this matter thus burdened vehicle's capacity and prolonged its operation time. This dynamic variable thus changes the initial CARP model where the existing model did not consider other external elements that have effected onto the model. Approach: Then we developed and enhanced CARP by integrating stochastic demand and time windows to suit the models with our specific case. Results: Objectively, CARP with stochastic demand (CARPSD) and CARP with time windows (CARPTW) were designed to minimize the total routing cost and number of trips for a vehicle. Our approach is to design CARP models in almost likely to road layout in residential area and graphically this model is called mesh network. We also developed a constructive heuristic that is called nearest procedure based on highest demand/cost (NPHDC) and work in conjunction with switching rules to search the feasible solution. Conclusion: Our preliminary results show a higher cost and more trips are needed when the vehicle operates in rainy day compared to normal day operation. Science Publications 2011 Article PeerReviewed Ismail, Zuhaimy and Ramli, Muhamad Fadzli (2011) Implementation weather-type models of capacitated are routing problem via heuristics. American Journal of Applied Sciences, 8 (4). pp. 382-392. ISSN 1546-9239
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 QC Physics
spellingShingle QC Physics
Ismail, Zuhaimy
Ramli, Muhamad Fadzli
Implementation weather-type models of capacitated are routing problem via heuristics
description In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP), a model that represents vehicle's operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did not increase in volumes, but in weights due to rain drops. Consequently, this matter thus burdened vehicle's capacity and prolonged its operation time. This dynamic variable thus changes the initial CARP model where the existing model did not consider other external elements that have effected onto the model. Approach: Then we developed and enhanced CARP by integrating stochastic demand and time windows to suit the models with our specific case. Results: Objectively, CARP with stochastic demand (CARPSD) and CARP with time windows (CARPTW) were designed to minimize the total routing cost and number of trips for a vehicle. Our approach is to design CARP models in almost likely to road layout in residential area and graphically this model is called mesh network. We also developed a constructive heuristic that is called nearest procedure based on highest demand/cost (NPHDC) and work in conjunction with switching rules to search the feasible solution. Conclusion: Our preliminary results show a higher cost and more trips are needed when the vehicle operates in rainy day compared to normal day operation.
format Article
author Ismail, Zuhaimy
Ramli, Muhamad Fadzli
author_facet Ismail, Zuhaimy
Ramli, Muhamad Fadzli
author_sort Ismail, Zuhaimy
title Implementation weather-type models of capacitated are routing problem via heuristics
title_short Implementation weather-type models of capacitated are routing problem via heuristics
title_full Implementation weather-type models of capacitated are routing problem via heuristics
title_fullStr Implementation weather-type models of capacitated are routing problem via heuristics
title_full_unstemmed Implementation weather-type models of capacitated are routing problem via heuristics
title_sort implementation weather-type models of capacitated are routing problem via heuristics
publisher Science Publications
publishDate 2011
url http://eprints.utm.my/id/eprint/44974/
_version_ 1643651603441385472
score 13.211869