Sequential Ordering Of Routes For Trucks For Efficient Garbage Collection: Case Study Of Sekondi –Takoradi Metropolitan Assembly (Stma)

Author(s)

Otchere Fianko Alexander , Jonathan Annan , M. Gyamfi , Professor Samuel Kwame Amponsah ,

Download Full PDF Pages: 22-30 | Views: 1240 | Downloads: 190 | DOI: 10.5281/zenodo.3412180

Volume 2 - September 2013 (09)

Abstract

This research paper presents a case study of a Vehicle Routing Problem (VRP). The objective is to minimize the total lengths taken by trucks of the Waste Management Department of Sekondi-Takoradi Metropolitan Assembly in transporting solid waste from the Metropolis to the Dump Site. The problem was formulated as an Integer Programming Model and the Ant Colony Meta-heuristic for the Travelling Salesman Problem was used to obtain the optimal solution. Data on distances between potential garbage picking points were obtained, and the Cartesian coordinates of the various garbage collection points were collected and used as a distance matrix table for each zone. The optimal solutions were obtained with the help of a Matlab implementation codes. The results revealed an outstanding performance of the Ant Colony Optimization Algorithm in terms of efficiency. The study revealed a reduction of the total cost by GH$56000.35 which represents 35% of the total cost.

Keywords

Garbage, Solid Waste Management, Ant Colony, Vehicle Routing Problem, Metaheuristics.

References

       i.        Abounacer, R., Bendrielch, G., Boukachour, J., Dkhissi, B. and Alaoui, A. E. (2009). Population Metaheuristic to solve the Professional Staff Transportation Problem. International Journal of Computer Science and Network Security (iicsns-06), 9(7):22-34.

ii.      Amponsah, S. K. and Salhi S. (2004). The investigation of a class of Capacitated Arc Routing Problems: the collection of Garbage in developing countries, International Journal of Waste Management 24, Pp711-721.

iii.    Bell, J. E. and McMullen, P. R. (2004). Ant Colony Optimization Techniques for the Vehicle Routing Problem. Advanced Engineering Informatics, 18:41-48.

iv.     Dorigo, M. (1992). Ant Colony Optimization for vehicle routing problem. PhD thesis, Politecnico di Milano, Milan, Italy.

 v.       Dorigo, M. and Gambardella, L. M. (April 1997). Ant Colony System: A cooperative learning  approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53–66.

vi.     Dorigo, M. and Di Caro, G. (1999). The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, McGraw-Hill, London, UK, pages 11–32.

vii.   Dorigo, M. and St¨utzle, T. (2002). The ant colony optimization metaheuristic: Algorithms, applications and advances. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 251–285. Kluwer Academic Publishers, Norwell, MA.

viii. Dorigo, M., Gamberdella, L. M. (1997). Ant colony for the Travelling Salesman Problem. Biosystems, 43(1):73-81.

ix.     Ghiduk, A. S. (2010). A new software Data-flow Jesting Approach via Ant Colony Algorithm. Universal Journal of Computer science and engineering Technology, 1(1)64-72.

x.       Jaillet, P. (1985). Probabilistic Travelling Salesman Problems. PhD thesis, MIT, Cambridge, MA.

xi.     Marius, M. S. (1987). Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraint. Operations Research, 35:254-265.

xii.   Martin, W., Otto, S. W. and Felten, E. W. (1991). Large-step Markov chains for the travelling Salesman problem. Complex Systems, 5(3):299–326.

xiii. McMullen, P. R. (2001). Ant colony Optimization Approach for addressing a JIT Sequencing Problem with Multiple Objectives. International Journal of Artificial Intelligence Engineering, 15:309-317.

xiv. Palmgren, M. (2001). Optimization Method for Log Truck Scheduling. Thesis No. 880, Linkoping’s University, Sweden.

Cite this Article: