## Search

Now showing items 41-60 of 162

#### 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 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 ...

#### 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 ...

#### 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 ...

#### 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 ...

#### 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 ...

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

(Computers and Operations Research, 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 ...

#### 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 ...