Search
Now showing items 1-10 of 27
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(Computers and Operations Research, 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 optimization for shading devices in buildings by using evolutionary algorithms
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 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 ...
An ensemble of differential evolution algorithms with variable neighborhood search for constrained function optimization
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 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 harmony search algorithm for layout design in theatre hall acoustics
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 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 ...
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
(Knowledge-Based Systems, 2016)
This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
(Computers and Industrial Engineering, 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
(International Journal of Production Research, 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
(Adaptation, Learning, and Optimization, 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
(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 ...
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 ...