• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Search 
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Search
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 11-20 of 21

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

A populated iterated greedy algorithm with inver-over operator for traveling salesman problem 

Tasgetiren, M.F.; Buyukdagli, O.; Kizilay, D.; Karabulut, K. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction ...
Thumbnail

A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion 

Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Gao, K.Z. (MDPI AG, 2016)
In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum ...
Thumbnail

An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion 

Kizilay, D.; Tasgetiren, M.F.; Pan, Q.K.; Wang, L. (IEEE, 2014)
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ...
Thumbnail

A Discrete Artificial Bee Colony Algorithm for the Assignment and Parallel Machine Scheduling Problem in DYO Paint Company 

Kizilay, D.; Tasgetiren, M.F.; Bulut, O.; Bodur, B. (IEEE, 2014)
This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the ...
Thumbnail

Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion 

Tasgetiren, M.F.; Kizilay, D.; Pan, Q.K.; Suganthan, P.N. (PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
Thumbnail

A variable block insertion heuristic for permutation flowshops with makespan criterion 

Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Velez-Gallego, M.C. (IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Thumbnail

A Populated Local Search with Differential Evolution for Blocking Flowshop Scheduling Problem 

Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Suer, G. (IEEE, 2015)
This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search ...
Thumbnail

A Differential Evolution Algorithm with Variable Neighborhood Search for Multidimensional Knapsack Problem 

Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Suer, G. (IEEE, 2015)
This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ...
Thumbnail

A Differential Evolution Algorithm with a Variable Neighborhood Search for Constrained Function Optimization 

Tasgetiren, M.F.; Suganthan, P.N.; Ozcan, S.; Kizilay, D. (SPRINGER-VERLAG BERLIN, 2015)
In this paper, a differential evolution algorithm based on a variable neighborhood search algorithm (DE_VNS) is proposed in order to solve the constrained real-parameter optimization problems. The performance of DE algorithm ...
Thumbnail

A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion 

Kizilay, D.; Tasgetiren, M.F.; Pan, Q.K.; Gao, L. (Algorithms, 2019)
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...
  • 1
  • 2
  • 3





Creative Commons License
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 




| Politika | Rehber | İletişim |

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy LanguageThis CommunityBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy Language

My Account

LoginRegister

Discover

Author
Kizilay, D. (21)
Tasgetiren, M.F. (21)
Pan, Q.K. (15)Suer, G. (4)Suganthan, P.N. (4)Buyukdagli, O. (2)Gao, K.Z. (2)Gao, L. (2)Karabulut, K. (2)Ozcan, S. (2)... View MoreDate Issued2015 (6)2014 (4)2017 (4)2013 (2)2016 (2)2019 (2)2018 (1)Has File(s)No (21)

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV