A variable neighborhood search procedure for the combined location with partial coverage and selective traveling salesman problem

Download

index.pdf

Date

2010

Author

Rahim, Fatih

Metadata

Show full item record

Item Usage Stats

217
views

91
downloads

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.

Subject Keywords

Industrial engineering.

URI

http://etd.lib.metu.edu.tr/upload/3/12611949/index.pdf
https://hdl.handle.net/11511/19675

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A lagrangean heuristic for the two-stage modular capacitated facility location problem Sevinç, Selim; Meral, Fatma Sedef; Department of Industrial Engineering (2008) In this study, a Lagrangean heuristic based on Lagrangean relaxation and subgradient optimization is proposed for the two-stage modular capacitated facility location problem. The objective is to minimize the cost of locating and operating plants and warehouses, plus the cost of transporting goods at both echelons to satisfy the demand of customers. The difference of our study from the two-stage capacitated facility location problem is the existence of multiple capacity levels as a candidate for each plant i...
Multiobjective hub location problem Barutçuoğlu, Aras; Köksalan, Murat; Department of Industrial Engineering (2009) In this study, we propose a two-phase solution approach for approximating the efficient frontier of a bicriteria hub location problem. We develop an evolutionary algorithm to locate the hubs on the network as the first phase. In the second phase, we develop a bounding procedure based on dominance relations and using the determined bounds, we solve the allocation subproblem for each located hub set. The two-phase approach is tested on the Australian Post data set and it is observed that our approach approxim...
The general lot sizing and scheduling problem with sequence dependent changeovers Koçlar, Ayşe; Süral, Haldun; Department of Industrial Engineering (2005) In this study, we consider the General Lot Sizing and Scheduling Problem in single level capacitated environments with sequence dependent item changeovers. Process industries may be regarded as suitable application areas of the problem. The focus on capacity utilization and intensively time consuming changeovers necessitate the integration of lot sizing and sequencing decisions in the production plan. We present a mathematical model which captures the essence of cases in the most generic and realistic setti...
Optimal pricing and production decisions in reusable container systems Atamer, Büşra; Bakal, İsmail Serdar; Department of Industrial Engineering (2010) In this study, we focus on pricing and production decisions in reusable container systems with stochastic demand. We consider a producer that sells a single product to the customers in reusable containers with two supply options: (i) brand-new containers, (ii) returned containers from customers. Customers purchasing the products may return the containers to the producer to receive a deposit price. The return quantity depends on both customer demand and the deposit price determined by the producer. Hence, th...
An integrated inventory control and vehicle routing problem Solyalı, Oğuz; Süral, Haldun; Department of Industrial Engineering (2005) In this study, we consider a logistics system, in which a single supplier delivers a product to multiple retailers over a finite time horizon. Supplier decides on the amount to order in each period and services retailers facing deterministic dynamic demand via a fleet of vehicles having limited capacity. Each retailer has specific minimum and maximum levels of inventory in an order-up-to level inventory policy setting. The problem is to simultaneously determine the quantity of product to order to the suppli...

Citation Formats

F. Rahim, “A variable neighborhood search procedure for the combined location with partial coverage and selective traveling salesman problem,” M.S. - Master of Science, Middle East Technical University, 2010.