International Journal of Mathematics Trends and Technology
Volume 29 | Number 2 | Year 2016 | Article Id. IJMTT-V29P514 | DOI : https://doi.org/10.14445/22315373/IJMTT-V29P514
Time in the twenty-first century plays an integral part in every sphere of our daily activities; this key factor in life is not an exception to solid waste management operators, whose operational cost account for about 80% of their total cost. In this paper, adopted the classical Vehicle Routing Problem with Time Window and enhanced it with two additional factors, such as the vehicle breaking distance/time which is absent in VRPTW and individual customer service time which is assumed to be constant in VRPTW. The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval, all routes start and end at the depot, and the total demands of all customers on one particular route must not exceed the capacity of the vehicle. Our enhanced VRPTW was applied to a real world problem in Tafo Pankrono and compared with the existing collection time by the waste management company in the area (Zoom Lion Company Limited). Our enhanced model saw a drastic reduction of 39% collection time as compared with the existing collection time.
[1] A. M. Benjamin„„Metaheuristics for the waste collection vehicle routing problem with time windows”, Ph.D. Thesis, Department of Mathematical Sciences, Brunel University (2011).
[2] K. Buhrkal, A. Larsen and S. Ropke „„The waste collection vehicle routing problem with time windows in a city logistics context”, Procedia-Social and Behavioral Sciences,39,241–254 (2012)
[3] B. Crevier, J. F. Cordeau and G. Laporte „„The multi-depot vehicle routing problem with inter- depot routes”, European Journal of Operational Research,176 (2) 756– 773 (2007)
[4] M. Desrochers, J.K. Lenstra, M.W.P. Savelsbergh and F. Soumis “Vehicle Routing with Time Windows: Optimization and Approximation”, in Vehicle Routing: Methods and Studies (1988)
[5] B. Golden and A. Assad 65–84, Elsevier Science Publishers, (1988) Amsterdam.
[6] W. Cook and J.L. Rich “A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problems with Time Windows”, Technical Report TR99-04 (1999) Department of Computational and Applied Mathematics, Rice University,
[7] Houston, J. F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon and F. Soumis “The VRP with Time Windows”, in The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, P. Toth and D. Vigo (eds), 157−194 (2001) SIAM, Philadelphia.
[8] B. L. Golden and A.A. Assad “Perspectives on Vehicle Routing: Exciting New Developments”, Operations Research 34, 803−809 (1986)
[9] J. Larsen „„Parallelization of the Vehicle Routing Problem with Time Windows”, Ph.D. thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark (1999)
[10] V. Hemmelmayr, K. F. Doerner, R. F. Hartl and S. Rath „„A heuristic solution method for node routing based solid waste collection problems”, Journal of Heuristics,19 (2) 129–156 (2013)
[11] B. I. Kim, S. Kim and S. Sahoo „„Waste collection vehicle routing problem with time windows”, Computers& Operations Research, 33 (12) 3624–3642 (2006)
[12] C. D. Tarantilis, E. E. Zachariadis and C. T. Kiranoudis „„A hybrid guided local search for the vehicle- routing problem with intermediate replenishment facilities”. NFORMS Journal on Computing, 20 (1)154–168 (2008)
D. Otoo, S. K. Amponsah, J. D. Ankamah, "Enhanced Vehicle Routing Problem with Time Windows a Real Case of Solid Waste Collection in Tafo Pankrono, Kumasi, Ghana," International Journal of Mathematics Trends and Technology (IJMTT), vol. 29, no. 2, pp. 87-95, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V29P514
PDF 
Abstract 
Keywords 
References 
Citation