Ara
Toplam kayıt 47, listelenen: 21-30
A Multi-Objective Self-Adaptive Differential Evolution Algorithm for Conceptual High-Rise Building Design
(IEEE, 2016)
This paper presents a multi-objective self-adaptive differential evolution algorithm to solve the form-finding problem of high-rise building design in the conceptual phase. The aim of the research is to reach suitable ...
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
(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) ...
Lagrangian heuristic for scheduling a steelmaking-continuous casting process
(IEEE, 2013)
One of the biggest bottlenecks in iron and steel production is the steelmaking-continuous casting (SCC) process, which consists of steel-making, re ning and continuous casting. The production scheduling of SCC is a complex ...
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
(SPRINGER-VERLAG BERLIN, 2012)
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 Populated Local Search with Differential Evolution for Blocking Flowshop Scheduling Problem
(IEEE, 2015)
This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion. Iterated greedy and iterated local search ...
A Differential Evolution Algorithm with Variable Neighborhood Search for Multidimensional Knapsack Problem
(IEEE, 2015)
This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ...
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
(ELSEVIER SCIENCE INC, 2014)
This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ...
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
(SPRINGER-VERLAG BERLIN, 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 ...
Metaheuristic Algorithms for the Quadratic Assignment Problem
(IEEE, 2013)
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, hich are destruction and construction procedures. The algorithm starts ...
A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops
(SPRINGER-VERLAG BERLIN, 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 ...