Cover Image

Solving mesh network of capacitated arc routing problem via reactive tabu search

1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang.

Saved in:
Bibliographic Details
Main Authors: Zuhaimy, Ismail, Mohammad Fadzli, Ramli, Irhamah, Nurhadi, Norhazwani, Md. Yunos
Other Authors: zuhaimy@math.fs.utm.my
Format: Working Paper
Language:English
Published: Universiti Malaysia Perlis (UniMAP) 2010
Subjects:
Capacitated arc routing problem
Waste collection
Tabu search
Regional Conference on Applied and Engineering Mathematics (RCAEM)
Online Access:http://dspace.unimap.edu.my/xmlui/handle/123456789/10283
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.unimap-10283
record_format dspace
spelling my.unimap-102832010-11-24T08:29:48Z Solving mesh network of capacitated arc routing problem via reactive tabu search Zuhaimy, Ismail Mohammad Fadzli, Ramli Irhamah, Nurhadi Norhazwani, Md. Yunos zuhaimy@math.fs.utm.my fadzli77@yahoo.com irhamah@its.edu.id wanie.my@utem.edu.my Capacitated arc routing problem Waste collection Tabu search Regional Conference on Applied and Engineering Mathematics (RCAEM) 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang. In this paper, we describe a mesh network of capacitated arc routing problem (CARP) that represents the real case of truck operation in waste collection. In general, the layout of residential houses area in Malaysia is likely similar to a mesh network where several nodes are connected with arcs. In CARP model, a truck starts its operation by moving from a depot to the first customer (first node). Then the collection of household refusal begins when the truck moves along the alley (arcs) thus increases its capacity. A set of customers which located along the arcs is visited exactly once without exceeding the truck capacity. The objective in this study is to find the minimum routing cost using tabu search and reactive tabu search methods. 2010-11-24T08:29:48Z 2010-11-24T08:29:48Z 2010-06-02 Working Paper Vol.3(7), p.308-312 http://hdl.handle.net/123456789/10283 en Proceedings of the 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 Universiti Malaysia Perlis (UniMAP) Institut Matematik Kejuruteraan
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 Capacitated arc routing problem
Waste collection
Tabu search
Regional Conference on Applied and Engineering Mathematics (RCAEM)
spellingShingle Capacitated arc routing problem
Waste collection
Tabu search
Regional Conference on Applied and Engineering Mathematics (RCAEM)
Zuhaimy, Ismail
Mohammad Fadzli, Ramli
Irhamah, Nurhadi
Norhazwani, Md. Yunos
Solving mesh network of capacitated arc routing problem via reactive tabu search
description 1st Regional Conference on Applied and Engineering Mathematics (RCAEM-I) 2010 organized by Universiti Malaysia Perlis (UniMAP) and co-organized by Universiti Sains Malaysia (USM) & Universiti Kebangsaan Malaysia (UKM), 2nd - 3rd June 2010 at Eastern & Oriental Hotel, Penang.
author2 zuhaimy@math.fs.utm.my
author_facet zuhaimy@math.fs.utm.my
Zuhaimy, Ismail
Mohammad Fadzli, Ramli
Irhamah, Nurhadi
Norhazwani, Md. Yunos
format Working Paper
author Zuhaimy, Ismail
Mohammad Fadzli, Ramli
Irhamah, Nurhadi
Norhazwani, Md. Yunos
author_sort Zuhaimy, Ismail
title Solving mesh network of capacitated arc routing problem via reactive tabu search
title_short Solving mesh network of capacitated arc routing problem via reactive tabu search
title_full Solving mesh network of capacitated arc routing problem via reactive tabu search
title_fullStr Solving mesh network of capacitated arc routing problem via reactive tabu search
title_full_unstemmed Solving mesh network of capacitated arc routing problem via reactive tabu search
title_sort solving mesh network of capacitated arc routing problem via reactive tabu search
publisher Universiti Malaysia Perlis (UniMAP)
publishDate 2010
url http://dspace.unimap.edu.my/xmlui/handle/123456789/10283
_version_ 1643789801848045568
score 13.214268

Similar Items