Heuristic method for the modified model of capacitated arc routing problems

The management of waste collection in urban areas is a critical issue for some developing countries especially in Malaysia which requires immediate attention. This study attempts to make an analysis and assessment of the development of the Perlis state waste generation distribution and the optimiza...

Full description

Saved in:

Bibliographic Details
Format:	Thesis
Language:	English
Subjects:	Heuristic algorithms Routing protocols (Computer network protocols) Arc Routing Problem Capacitated Arc Routing Problem (MCARP)
Online Access:	http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/1/Page%201-24.pdf http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/2/Full%20text.pdf http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/4/Muhamad%20Hafiz%20Masran.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-unimap-72878
record_format	uketd_dc
spelling	my-unimap-728782022-11-17T07:22:46Z Heuristic method for the modified model of capacitated arc routing problems Wan Zuki Azman, Wan Muhamad The management of waste collection in urban areas is a critical issue for some developing countries especially in Malaysia which requires immediate attention. This study attempts to make an analysis and assessment of the development of the Perlis state waste generation distribution and the optimization of waste collection routes. This thesis describes the architecture design of the mathematical modeling for the mixed graph of Capacitated Arc Routing Problem (MCARP) extended from the Capacitated Arc Routing Problem (CARP). Furthermore, it provides a description of several equations that can be used to obtain efficient collection routes such as capacity vehicles constraint. To get the better result, this study used the existing heuristics method for solving MCARP mathematical modeling. The result shows that the total costs produced are considerably acceptable and are also reasonably improved, although the existing heuristics method do not obtain an optimal solution but in term of the computational time is good and better than other methods for small and intermediate networks especially in the mixed graph problem Universiti Malaysia Perlis (UniMAP) Thesis en http://dspace.unimap.edu.my:80/xmlui/handle/123456789/72878 http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/3/license.txt 8a4605be74aa9ea9d79846c1fba20a33 http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/1/Page%201-24.pdf 15026980224420924e935c4e0de5d155 http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/2/Full%20text.pdf b9011e6de7ac15dc693db4d3c50d64a5 http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/4/Muhamad%20Hafiz%20Masran.pdf c41e0019f69daeb7ef50cce38def1737 Universiti Malaysia Perlis (UniMAP) Heuristic algorithms Routing protocols (Computer network protocols) Salvage (Waste, etc.) Arc Routing Problem Capacitated Arc Routing Problem (MCARP) Institute of Engineering Mathematics
institution	Universiti Malaysia Perlis
collection	UniMAP Institutional Repository
language	English
advisor	Wan Zuki Azman, Wan Muhamad
topic	Heuristic algorithms Routing protocols (Computer network protocols) Heuristic algorithms Arc Routing Problem Capacitated Arc Routing Problem (MCARP)
spellingShingle	Heuristic algorithms Routing protocols (Computer network protocols) Heuristic algorithms Arc Routing Problem Capacitated Arc Routing Problem (MCARP) Heuristic method for the modified model of capacitated arc routing problems
description	The management of waste collection in urban areas is a critical issue for some developing countries especially in Malaysia which requires immediate attention. This study attempts to make an analysis and assessment of the development of the Perlis state waste generation distribution and the optimization of waste collection routes. This thesis describes the architecture design of the mathematical modeling for the mixed graph of Capacitated Arc Routing Problem (MCARP) extended from the Capacitated Arc Routing Problem (CARP). Furthermore, it provides a description of several equations that can be used to obtain efficient collection routes such as capacity vehicles constraint. To get the better result, this study used the existing heuristics method for solving MCARP mathematical modeling. The result shows that the total costs produced are considerably acceptable and are also reasonably improved, although the existing heuristics method do not obtain an optimal solution but in term of the computational time is good and better than other methods for small and intermediate networks especially in the mixed graph problem
format	Thesis
title	Heuristic method for the modified model of capacitated arc routing problems
title_short	Heuristic method for the modified model of capacitated arc routing problems
title_full	Heuristic method for the modified model of capacitated arc routing problems
title_fullStr	Heuristic method for the modified model of capacitated arc routing problems
title_full_unstemmed	Heuristic method for the modified model of capacitated arc routing problems
title_sort	heuristic method for the modified model of capacitated arc routing problems
granting_institution	Universiti Malaysia Perlis (UniMAP)
granting_department	Institute of Engineering Mathematics
url	http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/1/Page%201-24.pdf http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/2/Full%20text.pdf http://dspace.unimap.edu.my:80/xmlui/bitstream/123456789/72878/4/Muhamad%20Hafiz%20Masran.pdf
_version_	1776104228712873984

Heuristic method for the modified model of capacitated arc routing problems

Similar Items