In this study, a metaheuristic procedure, particularly a variable neighborhood search procedure, is proposed to solve the combined location and selective traveling salesman problem in glass recycling. The collection of used glass is done by a collecting vehicle that visits a number of predefined collection centers, like restaurants and hospitals that are going to be referred to as compulsory points. Meanwhile, it is desired to locate a predetermined number of bottle banks to
residential areas. The aim is to determine the location of these bottle banks and the route of the collecting vehicle so that all compulsory points and all bottle banks are visited and the maximum profit is obtained. Population zones are defined in residential areas and it is assumed that the people in a particular population zone will recycle their used glass to the closest bottle bank that fully or partially covers their zone. A Variable Neighborhood Search algorithm and its variant have been utilized for the solution of the problem. Computational
experiments have been made on small and medium scale test problems, randomly generated and adapted from the literature.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/3/12611949/index.pdf |
| Date | 01 May 2010 |
| Creators | Rahim, Fatih |
| Contributors | Sepil, Canan |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0015 seconds