A location-routing problem in glass recycling

In this study, a location-routing problem encountered in glass recycling is addressed. We formulate a combined maximal covering location problem in the presence of partial coverage and selective traveling salesman problem to determine the location of bottle banks and the route of a collecting vehicle that will daily visit a number of customers and the bottle banks. We propose a nested heuristic procedure to solve the problem. The outer loop of the heuristic is based on variable neighborhood search while the inner loop solves the traveling salesman problem on the locations defined. The performance of the heuristic procedure is demonstrated with computational experimentation on instances that are both randomly generated and are taken from the literature. An application of the procedure on a case study using a geographical information system is also reported.
Citation Formats
F. Rahim and A. C. Şerbetcioğlu, “A location-routing problem in glass recycling,” pp. 329–353, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/49256.