Heuristic method for the modified model of capacitated arc routing problems

Master of Science in Engineering Mathematics

Saved in:
Bibliographic Details
Main Author: Muhamad Hafiz, Masran
Other Authors: Wan Zuki Azman, Wan Muhamad
Format: Thesis
Language:English
Published: Universiti Malaysia Perlis (UniMAP) 2015
Subjects:
Online Access:http://dspace.unimap.edu.my:80/xmlui/handle/123456789/72878
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Malaysia Perlis
Language: English
id my.unimap-72878
record_format dspace
spelling my.unimap-728782022-11-17T07:22:46Z Heuristic method for the modified model of capacitated arc routing problems Muhamad Hafiz, Masran Wan Zuki Azman, Wan Muhamad Heuristic algorithms Routing protocols (Computer network protocols) Salvage (Waste, etc.) Arc Routing Problem Capacitated Arc Routing Problem (MCARP) Master of Science in Engineering Mathematics 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 2015 2021-12-03T02:31:36Z 2021-12-03T02:31:36Z Thesis http://dspace.unimap.edu.my:80/xmlui/handle/123456789/72878 en Universiti Malaysia Perlis (UniMAP) Universiti Malaysia Perlis (UniMAP) Institute of Engineering Mathematics
institution Universiti Malaysia Perlis
building UniMAP Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaysia Perlis
content_source UniMAP Library Digital Repository
url_provider http://dspace.unimap.edu.my/
language English
topic Heuristic algorithms
Routing protocols (Computer network protocols)
Salvage (Waste, etc.)
Arc Routing Problem
Capacitated Arc Routing Problem (MCARP)
spellingShingle Heuristic algorithms
Routing protocols (Computer network protocols)
Salvage (Waste, etc.)
Arc Routing Problem
Capacitated Arc Routing Problem (MCARP)
Muhamad Hafiz, Masran
Heuristic method for the modified model of capacitated arc routing problems
description Master of Science in Engineering Mathematics
author2 Wan Zuki Azman, Wan Muhamad
author_facet Wan Zuki Azman, Wan Muhamad
Muhamad Hafiz, Masran
format Thesis
author Muhamad Hafiz, Masran
author_sort Muhamad Hafiz, Masran
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
publisher Universiti Malaysia Perlis (UniMAP)
publishDate 2015
url http://dspace.unimap.edu.my:80/xmlui/handle/123456789/72878
_version_ 1751537826967584768