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