Search
Now showing items 31-40 of 54
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
Multi-Objective Harmony Search Algorithm for Layout Design in Theatre Hall Acoustics
(IEEE, 2016)
The aim of the research is to find a feasible set of theatre hall design alternatives for two objectives, which are the total cost and the reverberation time, subject to several constraints. We formulate the problem as a ...
An Ensemble of Differential Evolution Algorithms with Variable Neighborhood Search for Constrained Function Optimization
(IEEE, 2016)
In this paper, an ensemble of differential evolution algorithms based on a variable neighborhood search algorithm (EDE-VNS) is proposed so as to solve the constrained real parameter-optimization problems. The performance ...
Multi-Objective Optimization For Shading Devices in Buildings By Using Evolutionary Algorithms
(IEEE, 2016)
The reduction of energy consumption is a major challenge around the world. Architectural aspects have a significant place to minimize energy consumption to the maximum level. The use of large glazed facades causes overheating ...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
(PERGAMON-ELSEVIER SCIENCE LTD, 2015)
This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job insertion includes two phases: initializing schedules and rescheduling after each new job insertion. ...
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) ...
A Differential Evolution Algorithm with a Variable Neighborhood Search for Constrained Function Optimization
(SPRINGER-VERLAG BERLIN, 2015)
In this paper, a differential evolution algorithm based on a variable neighborhood search algorithm (DE_VNS) is proposed in order to solve the constrained real-parameter optimization problems. The performance of DE algorithm ...
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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
