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
A novel model selection algorithm for time series
Date
2017-04-30
Author
Akça, Elif
Yozgatlıgil, Ceylan
Metadata
Show full item record
Item Usage Stats
63
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/84584
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
A Novel Grouping Genetic Algorithm for the One-Dimensional Bin Packing Problem on GPU
Ozcan, Sukru Ozer; Dokeroglu, Tansel; Coşar, Ahmet; Yazıcı, Adnan (SPRINGER INT PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND; 2016-10-28)
One-dimensional Bin Packing Problem (1D-BPP) is a challenging NP-Hard combinatorial problem which is used to pack finite number of items into minimum number of bins. Large problem instances of the 1D-BPP cannot be solved exactly due to the intractable nature of the problem. In this study, we propose an efficient Grouping Genetic Algorithm (GGA) by harnessing the power of the Graphics Processing Unit (GPU) using CUDA. The time consuming crossover and mutation processes of the GGA are executed on the GPU by i...
A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem
Dokeroglu, Tansel; Coşar, Ahmet (2016-06-01)
Hyper-heuristics introduce novel approaches for solving challenging combinatorial optimization problems by operating over a set of low level (meta)-heuristics. This is achieved by an evolutionary selection mechanism that controls and combines the strengths of the low level (meta) -heuristics. In this study, we propose a high-performance MultiStart Hyper-heuristic algorithm (MSH-QAP) on the grid for the solution of the Quadratic Assignment Problem (QAP). MSH-QAP algorithm makes use of state-of:the-art (meta)...
A Novel Map Merging Methodology for Multi-Robot Systems
Topal, Sebahattin; Erkmen, İsmet; Erkmen, Aydan Müşerref (2010-10-22)
In this paper, we consider the problem of occupancy grid map merging which is an important issue especially for multi-robot exploration task in search and rescue environments. We present scale invariant feature transform based methodology for combining individual partial map of robot units acquired from different parts of the mission environment. Proposed approach is designed not only for structured work areas, but also it is designed for unstructured and complex environment such as wide collapsed buildings...
A Novel Numerical Method for Evaluation of Hypersingular Integrals in Electromagnetics
Selcuk, Gokhun; Demir, Oguz; Koç, Seyit Sencer (2015-11-28)
In this study we develop a numerical method for evaluation of hypersingular surface integrals, which arise in the solution of electric field integral equation (EFIE) via Nystrom method. Due to the divergent contribution of an infinitesimal area around the singular point, hypersingular integrals are told to be numerically intractable and analytical methods are employed for evaluation of these integrals. In this study we interpret hypersingular integrals as the second order derivative of weakly singular integ...
A genetic algorithm for the location-routing problem with time windows
Özgönenç, Hande; Meral, Fatma Sedef; Department of Industrial Engineering (2006)
The emphasis on minimizing the logistics costs to decrease overall system costs has led the researchers to consider the interdependencies between the decisions of locating facilities and planning the routes from those facilities. The location-routing problems considering this issue are the subject of this thesis study. A two-level hierarchical distribution system is considered in which goods are delivered from the sources (plants) to the facilities (depots) and then from the facilities to the customers. The...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Akça and C. Yozgatlıgil, “A novel model selection algorithm for time series,” 2017, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/84584.