Very Fast Non-Dominated Sorting
Journal Title: Decision Making in Manufacturing and Services - Year 2014, Vol 8, Issue 1
Abstract
New and very ecient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup of the best up to now Fast and Elitist Multi-objective Genetic Algorithm (NSGA-II) more than two orders of magnitudes. Formal proofs of time complexities of basic as well as improved versions of the procedure are presented. Provided experimental results fully conrm theoretical ndings.
Authors and Affiliations
Czesław Smutnicki, Jarosław Rudy, Dominik Żelazny
Keywords
Related Articles
- EP ID EP166611
- DOI 10.7494/dmms.2014.8.1.13
- Views 79
- Downloads 0
Batch Scheduling of Deteriorating Products
In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waitin...
Hyperbolicity of systems describing value functions in differential games which model duopoly problems
Based on the Bressan and Shen approach ([2] or [7]), we present the extension of the class of non-zero sum dierential games for which value functions are described by a weakly hyperbolic Hamilton-Jacobi system. The consi...
Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains
This paper discusses mixed integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and d...
Optimizing Modular Machining Line Design Problem with Mixed Activation Mode of Machining Units
A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints a...
Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward...