Heuristic method for the modified model of capacitated arc routing problems

Abstract

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