This study considers single machine scheduling with the machine operating at varying speed levels for different jobs with release dates and sequence-dependent setup times, in order to examine the trade-off between makespan ...

1 The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and real-life applicability. Various exact and heuristic algorithms have been developed for the HFSP, ...

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

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

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

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

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

A discrete artificial bee colony (DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ...

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

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

This paper presents the results obtained by NSGA-II and jDEMO on a restaurant design optimization in the conceptual phase. A multi-objective problem is formulated by considering the minimization of investment and the ...

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

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

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

This paper focuses on the conceptual design and the development of a floating neighborhood by taking advantage of computational methods. An application to a concept design of a floating neighborhood in the region of Urla-A ...

This paper presents the results obtained by NSGA-II and DE on a restaurant layout optimization problem, trying to maximize total profit while minimizing investment. The problem entails the configuration of restaurant ...

This paper aims to examine the application of evolutionary algorithms to the form finding problem of high-rise buildings. In the light of mentioned purpose, this study concentrates on the conceptual phase of the design ...

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

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

This paper presents a variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately. The TSPTW has ...