Hemant Kumar Singh

Hemant Kumar Singh

Auto-generated profile, based on publicly available information

Hemant Kumar Singh

University of New South Wales, Canberra, Australia

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 January 2011 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
HSHemant Kumar Singh
Hemant Kumar Singh
AIAmitay Isaacs
Amitay Isaacs
TRTapabrata Ray
Tapabrata Ray
Many-objective optimization refers to the optimization problems containing large number of objectives, typically more than four. Non-dominance is an inadequate strategy for convergence to the Pareto front for such problems, as almost all solutions in the population become non-dominated, resulting in loss of convergence pressure. However, for some problems, it may be possible to generate the Pareto front using only a few of the objectives, rendering the rest of the objectives redundant. Such problems may be reducible to a manageable number of relevant objectives, which can be optimized using conventional multiobjective evolutionary algorithms (MOEAs). For dimensionality reduction, most proposals in the paper rely on analysis of a representative set of solutions obtained by running a conventional MOEA for a large number of generations, which is computationally overbearing. A novel algorithm, Pareto corner search evolutionary algorithm (PCSEA), is introduced in this paper, which searches for the corners of the Pareto front instead of searching for the complete Pareto front. The solutions obtained using PCSEA are then used for dimensionality reduction to identify the relevant objectives. The potential of the proposed approach is demonstrated by studying its performance on a set of benchmark test problems and two engineering examples. While the preliminary results obtained using PCSEA are promising, there are a number of areas that need further investigation. This paper provides a number of useful insights into dimensionality reduction and, in particular, highlights some of the roadblocks that need to be cleared for future development of algorithms attempting to use few selected solutions for identifying relevant objectives.

12 February 2019 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
AHAhsanul Habib
Ahsanul Habib
HSHemant Kumar Singh
Hemant Kumar Singh
TCTinkle Chugh
Tinkle Chugh
TRTapabrata Ray
Tapabrata Ray
KMKaisa Miettinen
Kaisa Miettinen
Many-objective optimization problems (MaOP) contain four or more conflicting objectives to be optimized. A number of efficient decomposition-based evolutionary algorithms have been developed in the recent years to solve them. However, computationally expensive MaOPs have been scarcely investigated. Typically, surrogate-assisted methods have been used in the literature to tackle computationally expensive problems, but such studies have largely focused on problems with 1-3 objectives. In this study, we present an approach called HSMEA to solve computationally expensive MaOPs. The key features of the approach include (a) the use of multiple surrogates to effectively approximate a wide range of objective functions, (b) use of two sets of reference vectors for improved performance on irregular Pareto fronts, (c) effective use of archive solutions during offspring generation and (d) a local improvement scheme for generating high quality infill solutions. Furthermore, the approach includes constraint handling which is often overlooked in contemporary algorithms. The performance of the approach is benchmarked extensively on a set of unconstrained and constrained problems with regular and irregular Pareto fronts. A statistical comparison with the existing techniques highlights the efficacy and potential of the approach.

1 January 2009
Verified
Book Chapter
Closed access
PDF file
TRTapabrata Ray
Tapabrata Ray
HSHemant Kumar Singh
Hemant Kumar Singh
AIAmitay Isaacs
Amitay Isaacs
WSWarren Smith
Warren Smith

23 November 2018 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
HSHemant Kumar Singh
Hemant Kumar Singh
KBKalyan Shankar Bhattacharjee
Kalyan Shankar Bhattacharjee
TRTapabrata Ray
Tapabrata Ray

18 August 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ASAsafuddoula
Asafuddoula
HSHemant Kumar Singh
Hemant Kumar Singh
TRTapabrata Ray
Tapabrata Ray
Multiobjective optimization problems with more than three objectives are commonly referred to as many-objective optimization problems (MaOPs). Development of algorithms to solve MaOPs has garnered significant research attention in recent years. “Decomposition” is a commonly adopted approach toward this aim, wherein the problem is divided into a set of simpler subproblems guided by a set of reference vectors. The reference vectors are often predefined and distributed uniformly in the objective space. Use of such uniform distribution of reference vectors has shown commendable performance on problems with “regular” Pareto optimal front (POF), i.e., those that are nondegenerate, smooth, continuous, and easily mapped by a unit simplex of reference vectors. However, the performance deteriorates for problems with “irregular” POF (i.e., which deviate from above properties), since a number of reference vectors may not have a solution on the POF along them. While adaptive approaches have been suggested in the literature that attempt to delete/insert reference directions conforming to the geometry of the evolving front, their performance may in turn be compromised for problems with regular POFs. This paper presents a generalized version of previously proposed decomposition-based evolutionary algorithm with adaptive reference vectors, intended toward achieving competitive performance for both types of problems. The proposed approach starts off with a set of uniform reference vectors and collects information about feasibility and nondominance of solutions that associate with the reference vectors over a learning period. Subsequently, new reference directions are inserted/deleted, while the original directions may assume an active or inactive role during the course of evolution. Numerical experiments are conducted over a wide range of problems with regular and irregular POFs with up to 15 objectives to demonstrate the competence of the proposed approach with the state-of-the-art methods.

17 February 2017 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
MIMonjurul Islam
Monjurul Islam
HSHemant Kumar Singh
Hemant Kumar Singh
TRTapabrata Ray
Tapabrata Ray
Bilevel optimization refers to a hierarchical problem in which optimization needs to be performed at two nested levels, namely the upper level and the lower level. The aim is to identify the optimum of the upper level problem, subject to optimality of the corresponding lower level problem. Several problems from the domain of engineering, logistics, economics, and transportation have inherent nested structure which requires them to be modeled as bilevel optimization problems. Bilevel optimization usually requires inordinate amount of function evaluations since a lower level search needs to be conducted for evaluating each upper level solution. The evaluations are especially high when the problems are not suited for exact techniques and evolutionary techniques are employed instead. Reducing this computational effort has been one of the key pursuits in this domain recently. However, the use of surrogate modeling to achieve this goal has so far been scarcely studied. In this paper, we present a surrogate assisted optimization approach toward addressing this research gap. The approach uses surrogates of multiple types in order to provide flexibility of approximating different types of functions more accurately. The algorithm is further strengthened through the use of selective re-evaluation of promising solutions and periodic nested local search. The performance of the proposed algorithm is presented on twenty five standard benchmark problems. The results are compared with a number of other established evolutionary and hybrid algorithms to demonstrate the efficacy of the proposed approach in obtaining competitive results using relatively fewer function evaluations.