Search
Now showing items 1-8 of 8
Variable block insertion heuristic for the quadratic assignment problem
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...
Design of multi-product multi-period two-echelon supply chain network to minimize bullwhip effect through differential evolution
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
A supply chain network consists of facilities located in dispersed geographical locations. This network structure can be optimized to minimize total cost or total inventory by deciding the order quantities and distribution ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
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 ...
Variable Block Insertion Heuristic for the Quadratic Assignment Problem
(IEEE, 2017)
The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...
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 ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Design of multi-product multi-period two-echelon supply chain network to minimize bullwhip effect through differential evolution
(IEEE, 2017)
A supply chain network consists of facilities located in dispersed geographical locations. This network structure can be optimized to minimize total cost or total inventory by deciding the order quantities and distribution ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
