Search
Now showing items 51-60 of 162
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(Applied Mathematical Modelling, 2013)
In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ...
A discrete artificial bee colony algorithm for the traveling salesman problem with time windows
(2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)
This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult ...
A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy
(2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)
In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In ...
A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...
Solving fuzzy job-shop scheduling problem by a hybrid PSO algorithm
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...
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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
