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 100
- Downloads 0
An Attribute Based Similarity Function for VRP Decision Support
When solving problems in the real world using optimization tools, the model solved by the tools is often only an approximation of the underlying, real, problem. In these circumstances, a decision maker (DM) should consid...
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...
Stretching the Least Squares to Embed Loss Functions Tables
The method of least squares is extended to accommodate a class of loss functions specified in the form of function tables. Each function table is embedded into the standard quadratic loss function so that the nonlinear l...
Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs
We consider mixed-integer linear programming (MIP) models of production planning problems known as the small bucket lot-sizing and scheduling problems. We present an application of a class of valid inequalities to the ca...
Coordinating Contracts in SCM: A Review of Methods and Literature
Supply chain coordination through contracts has been a burgeoning area of re- search in recent years. In spite of rapid development of research, there are only a few structured analyses of assumptions, methods, and appli...