Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload ...

Determining the contribution of an agent to a system-level objective function (credit assignment) is a key area of research in cooperative multiagent systems. Multi-objective optimization is a growing area of research, though mostly focused on single agent settings. Many real-world problems are multiagent and multi-objective, (e.g., air traffic management, scheduling observations across multipl...

We compare the efficiency of the NSGA-II algorithm for the brachytherapy dose optimization problem with and without supporting solutions. A local search method enhances the efficiency of the algorithm. In comparison to a fast simulated annealing algorithm the supported hybrid NSGA-II algorithm provides much faster many non-dominated solutions. An archiving of all non-dominated solutions is usef...

The design of an urban water distribution system (WDS) is a challenging problem involving multiple objectives. The goal of robust multi-objective optimization for WDS design is to find the set of solutions which embodies an acceptable trade-off between system cost and reliability, so that the ideal solution may be selected for a given budget. In addition to satisfying consumer needs, a system m...

Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...

Among numerous multi-objective optimization algorithms, the Elitist non-dominated sorting genetic algorithm (NSGA-II) is one of the most popular methods due to its simplicity, effectiveness and minimum involvement of the user. This article develops a multi-objective variation of the Nelder-Mead simplex method and combines it with NSGA-II in order to improve the quality and spread of the solutio...