DECOR: Differential Evolution using Clustering based Objective Reduction for Many-Objective Optimization

Authors: Monalisa Pal, Sriparna Saha and Sanghamitra Bandyopadhyay
Email: monalisap90@gmail.com, sriparna.saha@gmail.com and sanghami@isical.ac.in
Link to publication: https://doi.org/10.1016/j.ins.2017.09.051

Welcome to this webpage which presents a many-objective optimization approach viz. DECOR or Differential Evolution using Clustering based Objective Reduction. This proposed algorithm has been applied on DTLZ test problems (10 and 20 objectives) and the efficacy of the approach has been analysed using convergence metric, hypervolume indicator and parallel coordinates based visualization. The major characteristics of this approach are as follows: it is online (optimization and objective reduction run simultaneously while periodically switching between full and reduced objective set), it has the provision for removal of multiple objectives in a turn, it takes special care of singleton clusters which would otherwise terminate objective reduction prematurely, and it is integrated with IDEMO or Improved Differential Evolution for Many-objective Optimization which introduces novel elitist selection and ranking strategy to improve the convergence and diversity of the Pareto-front. This webpage contains a detailed description of the theoretical background of many-objective optimization in a downloadable PDF file, the MATLAB code used for this work as a downloadable ZIP folder, and the step-wise illustration of the execution of the code.


Theoretical background of many-objective optimization

A detailed description of a few major concepts is available as the supplementary material in the file named "Supplementary.pdf" for the overall understanding of this work. This material elaborates on the formal definition of a many-objective optimization problem, the concept of Pareto-optimality, the notion of non-conflicting objective set, the steps of Differential Evolution for Multi-objective Optimization (DEMO), the specifications of the DTLZ test problems and the performance metrics viz. Convergence Metric and Hypervolume Indicator.

Click here to download the supplementary material.

Specifications of the code

The experiment was conducted in a system having Intel Core i3 processor @ 2.3GHz with 4GB RAM and using MATLAB R2012b.

The MATLAB codes are available in a compressed folder named "DECOR.zip" which is downloadable from the link below. The compressed folder is to be extracted in which there are 14 .m files. Out of these .m files, the files named "aDECOR.m" and "fDECOR.m" are the ones to be executed and all the remaining ones are function definitions required for the entire execution. This program encodes DTLZ test problems in "evalfit.m" file which is to be modified if some other test problems or functions of a practical applications are to be used.

Click here to download the MATLAB codes.

Getting help: For all the .m files, a brief description of the code can be looked up using the "help" command of the MATLAB as shown in the illustration below. It is important to browse into the location (or folder) where all the associated files are kept, before executing the "help" statement. To execute the help statement, the corresponding filename is to be typed, preceeded by the word "help".


Steps to execute the associated program

The code can be executed as listed below. Against each step, a screenshot is provided for reference. The screenshots are taken during execution of the code in Windows 10.

  1. Open MATLAB. (Here, MATLAB R2012b has been used.)
  2. Use the drop-down arrow (highlighted by green box) to browse to the location (highlighted by red box) where the ZIP folder has been extracted. Ensure there are 14 files in the location from the "Current Folder" pane, including the files named "aDECOR.m" and "fDECOR.m" (highlighted by purple box) which are the files to be executed for the respective algorithms.
  3. One of the ways to execute the file (for example, fDECOR.m) is to open the file in an Editor window (by double-clicking "fDECOR.m" under "Current Folder" pane) and use the "Run" button of the Editor window (highlighted by red box). Alternatively, one can type the filename i.e. fDECOR in the "Command Window" when the prompt (>>) appears in order to execute the program.
  4. Enter the information asked in the "Command Window" (highlighted by red box). Note that all the previously entered commands can be seen from the "Command History" pane (highlighted by purple box).
  5. After all the user-inputs are provided, the DECOR algorithm starts to search for the Pareto-optimal front by performing online objective reduction.
  6. At the end of the program execution, two graphs appear in separate windows called "Figure 1" and "Figure 2". "Figure 1" shows the true Pareto-front for the DTLZ test problem under consideration. "Figure 2" shows the estimated Pareto-front for the DTLZ test problem under consideration, as estimated by DECOR. Beside the plots, the optimization results (i.e. hypervolume, convergence, number of points in the estimated Pareto-front and the number of objectives in the reduced set) appear in the "Command Window".
1 / 6
Step 1 of 6
2 / 6
Step 2 of 6
3 / 6
Step 3 of 6
4 / 6
Step 4 of 6
5 / 6
Step 5 of 6
6 / 6
Step 6 of 6


Links to Other Projects


web counter

Visitor Counter

                

Author: Monalisa Pal

Email: monalisap90@gmail.com