Universiti Teknologi Malaysia Institutional Repository

Reactive tabu search approach for scheduling solid waste collection problems

Ismail, Zuhaimy and Md. Yunos, Norhazwani (2010) Reactive tabu search approach for scheduling solid waste collection problems. Australian Journal of Basic and Applied Sciences, 4 (10). 5171 -5177. ISSN 1991-8178

Full text not available from this repository.


The Capacitated Arc Routing Problem (CARP) is an arc routing problem which involves determining a fleet of homogeneous size vehicles and designing the routes that minimizes the total cost. CARP with customers located along the edges of the network is an NP-hard problem and one such problem is in the designing of household vehicle collection tours with each vehicles is limited in its capacity. This study proposed to develop new solution approach known as Reactive Tabu Search (RTS) heuristic method to solve the CARP. The RTS solution algorithm adopts a dynamic tabu list rather than static tabu list as in the classical Tabu Search (TS). The newly developed algorithm had generated a good solution for solving solid waste collection problems for the city of Johor Bahru, Malaysia. It produced a much better results compared to the classical TS approach.

Item Type:Article
Uncontrolled Keywords:reactive tabu search, tabu search, CARP and solid waste management
Subjects:Q Science > QA Mathematics
ID Code:26637
Deposited By: Yanti Mohd Shah
Deposited On:18 Jul 2012 11:43
Last Modified:30 Nov 2018 15:06

Repository Staff Only: item control page