Dipti Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dipti Singh has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Kusum Deep
Indian Institute of Technology Roorkee
6 shared publications - Nidhi Singh
Electrical Engineering Department, Gautam Buddha University, Greater Noida, India
4 shared publications - Ajay Satija
Inderprastha Engineering College
3 shared publications - Neha Chand
Gautam Buddha University
3 shared publications - Seema Agrawal
S.S.V. College
3 shared publications - Babita Singh
Electrical Engineering Department, Gautam Buddha University, Greater Noida, India
2 shared publications
Latest Publications
- Open Access
- 20 August 2026
- Published by Elsevier in Kuwait Journal of Science
- Vol. 53 (4)
A new crossover based genetic algorithm approach to multi period multi echelon location inventory routing problems with demand uncertainty and risk factors
- 20 August 2026
- Published by Elsevier in Kuwait Journal of Science
- Vol. 53 (4)
Open AccessA new crossover based genetic algorithm approach to multi period multi echelon location inventory routing problems with demand uncertainty and risk factors
- Open Access
- 13 February 2026
- Published by Revista Brasileira de Biometria in Brazilian Journal of Biometrics
- Vol. 44 (1)
C-SOMGOAM: A Self-Organizing Migrating Grasshopper Mutation Algorithm for solving constrained optimization
This paper introduces C-SOMGOAM, a self-organizing migrating grasshopper optimization algorithm designed for constrained optimization (CO). The algorithm integrates features from the Grasshopper Optimization Algorithm (GOA), the Self-Organizing Migrating Algorithm (SOMA), and a non-uniform mutation operator. A key contribution of this work is the incorporation of a penalty-free constraint-handling mechanism into GOA to effectively address CO problems. Unlike some traditional methods, the proposed GOA variant explicitly operates on a population of solutions. Starting with a randomly selected population, the algorithm iteratively modifies these solutions to improve the approximation of the global optimum. C-SOMGOAM is not only simple to implement but also capable of generating feasible and high-quality solutions. To assess its performance, the algorithm is evaluated on ten constrained benchmark problems and three engineering design problems from the literature. The effectiveness of C-SOMGOAM is demonstrated through comprehensive result analysis and comparative evaluation against existing variants.
- 13 February 2026
- Published by Revista Brasileira de Biometria in Brazilian Journal of Biometrics
- Vol. 44 (1)
Open AccessC-SOMGOAM: A Self-Organizing Migrating Grasshopper Mutation Algorithm for solving constrained optimization
This paper introduces C-SOMGOAM, a self-organizing migrating grasshopper optimization algorithm designed for constrained optimization (CO). The algorithm integrates features from the Grasshopper Optimization Algorithm (GOA), the Self-Organizing Migrating Algorithm (SOMA), and a non-uniform mutation operator. A key contribution of this work is the incorporation of a penalty-free constraint-handling mechanism into GOA to effectively address CO problems. Unlike some traditional methods, the proposed GOA variant explicitly operates on a population of solutions. Starting with a randomly selected population, the algorithm iteratively modifies these solutions to improve the approximation of the global optimum. C-SOMGOAM is not only simple to implement but also capable of generating feasible and high-quality solutions. To assess its performance, the algorithm is evaluated on ten constrained benchmark problems and three engineering design problems from the literature. The effectiveness of C-SOMGOAM is demonstrated through comprehensive result analysis and comparative evaluation against existing variants.
- 21 January 2026
- Published by Springer Nature
- p. 239-256
A Hybrid Quadratic Self-Organizing Migrating Grasshopper Algorithm for Continuous Optimization
- 21 January 2026
- Published by Springer Nature
- p. 239-256
A Hybrid Quadratic Self-Organizing Migrating Grasshopper Algorithm for Continuous Optimization
- 26 November 2025
- Published by Springer Nature in Silicon
- Vol. 17 (18) , 4653-4673
Modelling and Optimization of Silica Extraction from Perlite Using RSM, ANN, and NSGA-II Techniques
- 26 November 2025
- Published by Springer Nature in Silicon
- Vol. 17 (18) , 4653-4673
Modelling and Optimization of Silica Extraction from Perlite Using RSM, ANN, and NSGA-II Techniques
- 1 July 2024
- Published by Springer Nature
- p. 543-555
Model Order Reduction of Linear Continuous and Discrete Systems Using Grey Wolf Optimization
- 1 July 2024
- Published by Springer Nature
- p. 543-555
Model Order Reduction of Linear Continuous and Discrete Systems Using Grey Wolf Optimization
- 1 July 2024
- Published by Springer Nature
- p. 237-249
GA Based Order Abatement Technique for Linear Dynamic Systems
- 1 July 2024
- Published by Springer Nature
- p. 237-249
GA Based Order Abatement Technique for Linear Dynamic Systems
- Open Access
- 8 February 2024
- Published by Springer Nature in Research Square
A SOMA-inspired Hybrid Variant of Grasshopper Optimization Algorithm for Global Optimization
The Grasshopper Optimization Algorithm (GOA) is a relatively recent population-based stochastic search algorithm extensively used for solving various nonlinear global optimization problems arising in science and engineering. Like other evolutionary algorithms, this algorithm also has some limitations like poor balance between exploration and exploitation, requires large population size, and premature convergence. To address these limitations and to improve the efficiency of GOA, two hybridized variants of GOA have been proposed in this paper. In these variants, GOA is combined with the feature of another population-based algorithm which is the Self-Organizing Migrating Algorithm (SOMA). First GOA is combined with the exploitation feature of SOMA and a hybrid variant of SOMGOA is proposed. Later to balance exploitation, SOMGOA is merged with tournament selection to maintain the good quality solution of previous and current generations and SOMGOA-t is presented. The effectiveness of both the variants is analysed based on results and comparative analysis is made against the results of GOA and SOMA. A total of twenty-one standard benchmark functions with different intrinsic difficulties and four unconstrained optimization problems (gear train design, frequency modulation sound parameter identification problem, Gas transmission compressor design problem, and Optimal capacity of gas production facility) have been used for testing. The analysis of experimental results involved two statistical tests: the Wilcoxon rank-sum test and the Friedman statistical test. Furthermore, the statistical findings consistently affirm the superiority of the SOMGOA-t when compared to the alternative algorithms (GOA and SOMA). However, the present study is limited to solving unconstrained nonlinear optimization problems.
- 8 February 2024
- Published by Springer Nature in Research Square
Open AccessA SOMA-inspired Hybrid Variant of Grasshopper Optimization Algorithm for Global Optimization
The Grasshopper Optimization Algorithm (GOA) is a relatively recent population-based stochastic search algorithm extensively used for solving various nonlinear global optimization problems arising in science and engineering. Like other evolutionary algorithms, this algorithm also has some limitations like poor balance between exploration and exploitation, requires large population size, and premature convergence. To address these limitations and to improve the efficiency of GOA, two hybridized variants of GOA have been proposed in this paper. In these variants, GOA is combined with the feature of another population-based algorithm which is the Self-Organizing Migrating Algorithm (SOMA). First GOA is combined with the exploitation feature of SOMA and a hybrid variant of SOMGOA is proposed. Later to balance exploitation, SOMGOA is merged with tournament selection to maintain the good quality solution of previous and current generations and SOMGOA-t is presented. The effectiveness of both the variants is analysed based on results and comparative analysis is made against the results of GOA and SOMA. A total of twenty-one standard benchmark functions with different intrinsic difficulties and four unconstrained optimization problems (gear train design, frequency modulation sound parameter identification problem, Gas transmission compressor design problem, and Optimal capacity of gas production facility) have been used for testing. The analysis of experimental results involved two statistical tests: the Wilcoxon rank-sum test and the Friedman statistical test. Furthermore, the statistical findings consistently affirm the superiority of the SOMGOA-t when compared to the alternative algorithms (GOA and SOMA). However, the present study is limited to solving unconstrained nonlinear optimization problems.
- Open Access
- 31 January 2024
- Published by Springer Nature in Research Square
GA based Order Abatement Technique for Linear Dynamic Systems for Continues Time System and Discrete Time System
In this paper a hybrid technique of order abatement is introduced for Higher Order Linear Dynamic Systems (HOLDSs) for continuous and discrete time system. The denominator dynamics of the original HOLDSs is abated with continued fraction method, yet the abated numerator is extracted using the Genetic Algorithm. The abated system is attained by combining the benefits of the above two methods. The motive of the suggested technique is to conserve the characteristics of the HOLDSs system in abated system by minimizing the Integral Square Error(ISE). The proposed technique assures the conservation of steady-state stability along with the transient stability of the original HOLDS. A comprehensive comparison study is conducted using two HOLDS cases of continuous time system and two cases of discrete time system from the literature. The ISEs, Time-response and Frequency- response are calculated and plotted with the help of Simulink/MATLAB and compared with the other reduction techniques from the literature. The results demonstrate that the suggested technique provides less ISE than alternative approaches and the time and frequency responses closely resemble the response of the original system.
- 31 January 2024
- Published by Springer Nature in Research Square
Open AccessGA based Order Abatement Technique for Linear Dynamic Systems for Continues Time System and Discrete Time System
In this paper a hybrid technique of order abatement is introduced for Higher Order Linear Dynamic Systems (HOLDSs) for continuous and discrete time system. The denominator dynamics of the original HOLDSs is abated with continued fraction method, yet the abated numerator is extracted using the Genetic Algorithm. The abated system is attained by combining the benefits of the above two methods. The motive of the suggested technique is to conserve the characteristics of the HOLDSs system in abated system by minimizing the Integral Square Error(ISE). The proposed technique assures the conservation of steady-state stability along with the transient stability of the original HOLDS. A comprehensive comparison study is conducted using two HOLDS cases of continuous time system and two cases of discrete time system from the literature. The ISEs, Time-response and Frequency- response are calculated and plotted with the help of Simulink/MATLAB and compared with the other reduction techniques from the literature. The results demonstrate that the suggested technique provides less ISE than alternative approaches and the time and frequency responses closely resemble the response of the original system.