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 109
- Downloads 0
A Bi-Objective Portfolio Optimization with Conditional Value-at-Risk
This paper presents a bi-objective portfolio model with the expected return as a performance measure and the expected worst-case return as a risk measure. The problems are formulated as a bi-objective linear program. Num...
An Incremental Approach for Storage and Delivery Planning Problems
We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically f...
Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects
In the paper, we introduce some new scheduling model in which learning and aging effects are both considered simultaneously. In this model the actual processing time of the jobs depends only on its position in a schedule...
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor’s pe...
Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
Decision making with multiple criteria requires preferences elicited from the decision maker to determine a solution set. Models of preferences, that follow upon the concept of nondominated solutions introduced by Yu (19...