Search
Now showing items 21-30 of 155
An artificial bee colony algorithm for the economic lot scheduling problem
(International Journal of Production Research, 2014)
In this study, we present an artificial bee colony (ABC) algorithm for the economic lot scheduling problem modelled through the extended basic period (EBP) approach. We allow both power-of-two (PoT) and non-power-of-two ...
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
(IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CIPLS 2014: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, Proceedings, 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. ...
A discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns
(Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 2014)
In this study, we model the Economic Lot Scheduling problem with returns (ELSPR) under the basic period (BP) policy with power-of-two (PoT) multipliers, and solve it with a discrete artificial bee colony (DABC) algorithm. ...
A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company
(Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, 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 ...
A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...
A populated iterated greedy algorithm with inver-over operator for traveling salesman problem
(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 ...
Metaheuristic algorithms for the quadratic assignment problem
(Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, CIPLS 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction procedures. The algorithm starts ...
Lagrangian heuristic for scheduling a steelmaking-continuous casting process
(Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Scheduling, CISched 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)
One of the biggest bottlenecks in iron and steel production is the steelmaking-continuous casting (SCC) process, which consists of steel-making, refining and continuous casting. The production scheduling of SCC is a complex ...
Null control in linear antenna arrays with ensemble differential evolution
(Proceedings of the 2013 IEEE Symposium on Differential Evolution, SDE 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013, 2013)
This paper describes a synthesis method for null insertion in linear antenna array geometries by using newly proposed ensemble differential evolution (DE) algorithm. The given ensemble DE algorithm uses the advantages of ...
Ensemble of differential evolution algorithms for electromagnetic target recognition problem
(IET Radar, Sonar and Navigation, 2013)
In this study, an ensemble of differential evolution (DE) algorithms is presented to classify electromagnetic targets in resonance scattering region. The algorithm aims to synthesize a special incident signal for each ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
