• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Search 
  •   DSpace Home
  • Search
  •   DSpace Home
  • 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 21-30 of 52

  • 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 self-adaptive global best harmony search algorithm for continuous optimization problems 

Pan, Q.K.; Suganthan, P.N.; Tasgetiren, M.F.; Liang, J.J. (Applied Mathematics and Computation, 2010)
This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information ...
Thumbnail

A local-best harmony search algorithm with dynamic subpopulations 

Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (Engineering Optimization, 2010)
This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm ...
Thumbnail

An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem 

Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K. (Applied Mathematics and Computation, 2010)
In this paper, an ensemble of discrete differential evolution algorithms with parallel populations is presented. In a single populated discrete differential evolution (DDE) algorithm, the destruction and construction (DC) ...
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

Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion 

Gao, K.Z.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F.; Sadollah, A. (ELSEVIER SCIENCE BV, 2016)
This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...
Thumbnail

Multi-Objective Harmony Search Algorithm for Layout Design in Theatre Hall Acoustics 

Cubukcuoglu, C.; Kirimtat, A.; Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K. (IEEE, 2016)
The aim of the research is to find a feasible set of theatre hall design alternatives for two objectives, which are the total cost and the reverberation time, subject to several constraints. We formulate the problem as a ...
Thumbnail

An Ensemble of Differential Evolution Algorithms with Variable Neighborhood Search for Constrained Function Optimization 

Paldrak, M.; Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K. (IEEE, 2016)
In this paper, an ensemble of differential evolution algorithms based on a variable neighborhood search algorithm (EDE-VNS) is proposed so as to solve the constrained real parameter-optimization problems. The performance ...
Thumbnail

Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion 

Gao, K.Z.; Suganthan, P.N.; Tasgetiren, M.F.; Pan, Q.K.; Sun, Q.Q. (PERGAMON-ELSEVIER SCIENCE LTD, 2015)
This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job insertion includes two phases: initializing schedules and rescheduling after each new job insertion. ...
Thumbnail

An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time 

Gao, K.Z.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. (TAYLOR & FRANCIS LTD, 2015)
This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) ...
Thumbnail

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem 

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Buyukdagli, O. (PERGAMON-ELSEVIER SCIENCE LTD, 2013)
This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ...
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6





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 Language

My Account

LoginRegister

Discover

Author
Suganthan, P.N. (52)
Tasgetiren, M.F. (52)
Pan, Q.K. (50)Buyukdagli, O. (6)Gao, K.Z. (6)Liang, J.J. (6)Chen, A.H.L. (4)Kizilay, D. (4)Mallipeddi, R. (4)Chua, T.J. (3)... View MoreDate Issued2011 (14)2010 (12)2013 (8)2015 (6)2016 (6)2012 (4)2017 (2)Has File(s)No (52)

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