ABSTRACT
A GENETIC ALGORITHM FOR p-HUB CENTER PROBLEM WITH
STOCHASTIC SERVICE LEVEL CONSTRAINTS
Eraslan Demirci, Sü / kran
M.Sc., Department of Industrial Engineering
Supervisor: Asst. Prof. Dr. Sedef Meral
December 2010, 170 pages
The emphasis on minimizing the costs and travel times in a network of origins
and destinations has led the researchers to widely study the hub location
problems in the area of location theory in which locating the hub facilities and
designing the hub networks are the issues. The p-hub center problem
considering these issues is the subject of this study. p-hub center problem with
stochastic service level constraints and a limitation on the travel times between
the nodes and hubs is addressed, which is an uncapacitated, single allocation
problem with a complete hub network.
Both a mathematical model and a genetic algorithm are proposed for the
problem. We discuss the general framework of the genetic algorithm as well as
the problem-specific components of algorithm. The computational studies of
the proposed algorithm are realized on a number of problem instances from
Civil Aeronautics Board (CAB) data set and Turkish network data set. The
computational results indicate that the proposed genetic algorithm gives
satisfactory results when compared with the optimum solutions and solutions
obtained with other heuristic methods.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12612940/index.pdf |
| Date | 01 December 2010 |
| Creators | Eraslan Demirci, Sukran |
| Contributors | Meral, Sedef |
| 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.0014 seconds