Article thumbnail

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

By Zuhaimy Ismail and Muhamad Fadzli Ramli

Abstract

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

Topics: QC Physics
Publisher: 'Recent Science Publications'
Year: 2011
OAI identifier: oai:generic.eprints.org:44974/core392
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.utm.my/id/eprin... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.