Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Multiobjective hub location problem
Download
index.pdf
Date
2009
Author
Barutçuoğlu, Aras
Metadata
Show full item record
Item Usage Stats
182
views
95
downloads
Cite This
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 approximates the entire efficient frontier well. In addition, we suggest an interactive procedure to find the solutions that are in the decision maker’s preferred region of the solution space. In this procedure, we progressively incorporate the preferences of the decision maker and direct the search towards the preferred regions. Based on some computational experiments, it is observed that the interactive procedure converges to the preferred regions.
Subject Keywords
Industrial engineering.
URI
http://etd.lib.metu.edu.tr/upload/3/12610817/index.pdf
https://hdl.handle.net/11511/18670
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...
A variable neighborhood search procedure for the combined location with partial coverage and selective traveling salesman problem
Rahim, Fatih; Sepil, Canan; Department of Industrial Engineering (2010)
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...
Multi-objective route selection
Tezcaner, Diclehan; Köksalan, Murat; Department of Industrial Engineering (2009)
In this thesis, we address the route selection problem for Unmanned Air Vehicles (UAV) under multiple objectives. We consider a general case for this problem where the UAV has to visit several targets and return to the base. For this case, there are multiple combinatorial problems to be considered. First, the paths to be followed between any pairs of targets should be determined. This part can be considered as a multi-objective shortest path problem. Additionally, we need to determine the order of the targe...
Managing production and lead time quotation with multiple demand classes
Sayın, Ece; Savaşaneril Tüfekci, Seçil; Department of Industrial Engineering (2010)
In this study, we investigate several facets of a due-date quotation problem and develop a model considering jointly due-date quotation, order acceptance and base-stock decisions in a hybrid make-to-stock (MTS) / make-to-order (MTO) and multi-class system with lead time sensitive Poisson demand and exponentially distributed service times. We seek to maximize profit considering lateness penalties and holding costs in the model. We consider three alternative due-date quotation policies each having different p...
Multiple criteria project selection problems
Çağlar, Musa; Karasakal, Esra; Department of Industrial Engineering (2009)
In this study, we propose two biobjective mathematical models based on PROMETHEE V method for project selection problems. We develop an interactive approach (ib-PROMETHEE V) including data mining techniques to solve the first proposed mathematical model. For the second model, we propose NSGA-II with constraint handling method. We also develop a Preference Based Interactive Multiobjective Genetic Algorithm (IMGA) to solve the second proposed mathematical model. We test the performance of NSGA-II with constra...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Barutçuoğlu, “Multiobjective hub location problem,” M.S. - Master of Science, Middle East Technical University, 2009.
