Search
Now showing items 1-10 of 25
A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ...
A differential evolution algorithm for the extraction of complex natural resonance frequencies of electromagnetic targets
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
This paper presents a differential evolution algorithm in order to find unique resonance frequencies of an electromagnetic target in the resonance scattering region. These frequencies are estimated from the roots of Laplace ...
A dynamic berth allocation problem with priority considerations under stochastic nature
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model ...
A genetic algorithm for the economic lot scheduling problem under extended basic period approach and power-of-two policy
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
In this study, we propose a genetic algorithm (GA) for the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. The proposed GA employs a multi-chromosome solution ...
A discrete artificial bee colony algorithm for the economic lot scheduling problem
(2011 IEEE Congress of Evolutionary Computation, CEC 2011, 2011)
In this study we present a discrete artificial bee colony (DABC) algorithm to solve the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. In specific, our ...
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(Information Sciences, 2011)
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ...
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
(International Journal of Production Research, 2011)
In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable ...
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
(Computers and Industrial Engineering, 2011)
This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ...
A differential evolution algorithm for the economic lot scheduling problem
(IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution, 2011)
In this study we provide a Differential Evolution (DE) based heuristic to solve the Economic Lot Scheduling Problem (ELSP) under basic period approach. The problem is to find the best cyclic production schedule of n items ...
A differential evolution algorithm for the median cycle problem
(IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution, 2011)
This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
