A location-routing problem in glass recycling

Rahim F., ŞERBETCİOĞLU A. C.

ANNALS OF OPERATIONS RESEARCH, vol.223, no.1, pp.329-353, 2014 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 223 Issue: 1
  • Publication Date: 2014
  • Doi Number: 10.1007/s10479-014-1621-7
  • Journal Name: ANNALS OF OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.329-353
  • Keywords: Location-routing, Maximal covering problem, Traveling salesman problem, Vehicle routing allocation problem, Glass recycling, Geographical information systems, VARIABLE NEIGHBORHOOD SEARCH, TRAVELING SALESMAN PROBLEMS, TABU SEARCH, ALGORITHM, NETWORKS, RETURNS, DESIGN, MODELS
  • Middle East Technical University Affiliated: Yes

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.