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
Genetic Algorithm for Planar Capacitated Single Allocation Hub Location Problem
Date
2018-11-06
Author
İyigün, Cem
Pamukcu, Duygu
Metadata
Show full item record
Item Usage Stats
179
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/84777
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
Genetic algorithm for the optimization of a gas storage field converted from a depleted gas reservoir
Güyagüler, Barış; Gümrah, Fevzi; Department of Petroleum and Natural Gas Engineering (1998)
Genetic algorithm for the multiple-query optimization problem
Bayir, Murat Ali; Toroslu, İsmail Hakkı; Coşar, Ahmet (2007-01-01)
Producing answers to a set of queries with common tasks efficiently is known as the multiple-query optimization (MQO) problem. Each query can have several alternative evaluation plans, each with a different set of tasks. Therefore, the goal of MQO is to choose the right set of plans for queries which minimizes the total execution time by performing common tasks only once. Since MQO is an NP-hard problem, several, mostly heuristics based, solutions have been proposed for solving it. To the best of our knowle...
Genetic algorithm for personnel assignment problem with multiple objectives
Arslanoğlu, Yılmaz; Toroslu, İsmail Hakkı; Department of Computer Engineering (2006)
This thesis introduces a multi-objective variation of the personnel assignment problem, by including additional hierarchical and team constraints, which put restrictions on possible matchings of the bipartite graph. Besides maximization of summation of weights that are assigned to the edges of the graph, these additional constraints are also treated as objectives which are subject to minimization. In this work, different genetic algorithm approaches to multi-objective optimization are considered to solve th...
Genetic Algorithm Application to the Structural Properties of Si-Ge Mixed Clusters
Dugan, Nazim; Erkoç, Şakir (Informa UK Limited, 2009-01-01)
Optimum geometries of silicon-germanium (Si-Ge) clusters are found using a single parent genetic algorithm. 100 atom and 150 atom clusters are studied with some variety of compositions and initial geometries. Total interaction energies, distances of Si and Ge atoms to the cluster centers, and average bond lengths are calculated. Si-core Ge-shell geometry is found to be favorable compared to other geometries.
Genetic algorithm based aerodynamic shape optimization of wind turbine rotor blades using a 2-d panel method with a boundary layer solver
Polat, Özge; Tuncer, İsmail Hakkı; Sezer Uzol, Nilay; Department of Aerospace Engineering (2011)
This thesis presents an aerodynamic shape optimization methodology for rotor blades of horizontal axis wind turbines. Genetic Algorithm and Blade Element Momentum Theory are implemented in order to find maximum power production at a specific wind speed, rotor speed and rotor diameter. The potential flow solver, XFOIL, provides viscous aerodynamic data of the airfoils. Optimization variables are selected as the sectional chord length, the sectional twist and the blade profiles at root, mid and tip regions of...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. İyigün and D. Pamukcu, “Genetic Algorithm for Planar Capacitated Single Allocation Hub Location Problem,” 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/84777.