Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Applegate, D., Bixby R. E., Chvatal, V., & Cook, W. (2006). Concorde TSP solver. http://www.tsp.gatech.edu/concorde/.
Applegate, D., Cook, W., & Rohe, A. (2003). Chained Lin–Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15(1), 82–92.
Aras, N., & Aksen, D. (2008). Locating collection centers for distance and incentive-dependent returns. International Journal of Production Economics, 11, 316–333.
Aras, N., Aksen, D., & Tekin, T. (2010). Location and selective routing problem with pricing for the collection of used products. In 40th International Conference on Computers and Industrial Engineering (CIE), IEEE (pp. 1–6).
Barros, A. I., Dekker, R., & Scholten, V. (1998). A two-level network for recycling sand: A case study. European Journal of Operational Research, 110(2), 199–214.
Beasley, J. E., & Nascimento, E. M. (1996). The vehicle routing-allocation problem: A unifying framework. TOP, 4(1), 65–86.
Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR), 35(3), 268–308.
Church, R., & Velle, C. R. (1974). The maximal covering location problem. Papers in Regional Science, 32(1), 101–118.
Current, J. R., & Schilling, D. A. (1989). The covering salesman problem. Transportation Science, 23(3), 208–212.
Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188–205.
Gendreau, M., Laporte, G., & Semet, F. (1998). A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32(4), 263–273.
Hansen, P., & Mladenović, N. (1997). Variable neighborhood search for the p-median. Location Science, 5(4), 207–226.
Hansen, P., & Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449–467.
Jayaraman, V., Patterson, R. A., & Rolland, E. (2003). The design of reverse distribution networks: Models and solution procedures. European Journal of Operational Research, 150(1), 128–149.
Karasakal, O., & Karasakal, E. K. (2004). A maximal covering location model in the presence of partial coverage. Computers & Operations Research, 31(9), 1515–1526.
Labbé, M., Laporte, G., Rodríguez-Martín, I., & Salazar-Gonzáles, J. J. (2005). Locating median cycles in networks. European Journal of Operational Research, 160, 457–470.
Louwers, D., Kip, B. J., Peters, E., Souren, F., & Flapper, S. D. P. (1999). A facility location allocation model for reusing carpet materials. Computers & Industrial Engineering, 36(4), 855–869.
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326–329.
Min, H., Jeung Ko, H., & Seong Ko, C. (2006). A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns. Omega, 34(1), 56–69.
Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100.
Mladenović, N., Labbé, M., & Hansen, P. (2003). Solving the p-center problem with Tabu search and variable neighborhood search. Networks, 42(1), 48–64.
Moreno Pérez, J. A., Moreno-Vega, J. M., & Rodríguez Martín, I. (2003). Variable neighborhood tabu search and its application to the median cycle problem. European Journal of Operational Research, 151, 365–378.
Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649–672.
Realff, M. J., Ammons, J. C., & Newton, D. J. (2004). Robust reverse production system design for carpet recycling. IIE Transactions, 36(8), 767–776.
Reinelt, G. (1991). TSPLIB—A traveling salesman problem library. ORSA Journal on Computing, 3(4), 376–384.
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (1977). An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3), 563–581.
Schilling, D. A., Jayaraman, V., & Barkhi, R. (1993). A review of covering problems in facility location. Location Science, 1, 25–55.
Watson-Gandy, C. D. T., & Dohrn, P. J. (1973). Depot location with van salesmen—A practical approach. Omega, 1(3), 321–329.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rahim, F., Sepil, C. A location-routing problem in glass recycling. Ann Oper Res 223, 329–353 (2014). https://doi.org/10.1007/s10479-014-1621-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-014-1621-7