Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal International Journal of Engineering, Science and Information Technology
Vellanki, Nagaraju
Unknown Affiliation
Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Electrical & Electronics Engineering Energy Engineering Industrial & Manufacturing Engineering Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Social Sciences Transportation

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
A Novel Hybrid Method for DAP: Differential Evolution with Variable Neighborhood Search Thakur, Mamta; Sushma, Talluri; Vellanki, Nagaraju; Shareef, R. M. Mastan; Anusha, Peruri Venkata; Swarna, B; Peter, Geno
International Journal of Engineering, Science and Information Technology Vol 5, No 3 (2025)
Publisher : Malikussaleh University, Aceh, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52088/ijesty.v5i3.1296

Abstract

This research investigates MOPFSP-SDST, an advanced and highly computational scheduling difficulty in real-world manufacturing systems. It examines how it correlates with multi-objective permutation flow shops. LS-MOVNS stands for "Learning and Swarm-based Multi-objective Variable neighbourhood Search." It is a better metaheuristic method that combines evolutionary swarm search and adaptive local search techniques to address this Problem. The two main improvements have been discussed: a partial neighbourhood assessment framework that reduces the computational expenses by analysing only a particular portion of the neighbourhood, and an adaptable neighbourhood series selection procedure that rapidly chooses the most beneficial neighbourhood order depending on past performance rates. These improvements aim to make searches more effective and productive by finding a better balance between exploration and exploitation. Particularly in medium to large problem sizes, experimental tests in benchmark instances show that LS-MOVNS frequently outperforms current modern algorithms in convergence and diversity. The results verify the long-term reliability, scalability, and practical applicability of LS-MOVNS for resolving challenging multi-objective scheduling issues.
Co-Authors Anusha, Peruri Venkata Peter, Geno Shareef, R. M. Mastan Sushma, Talluri Swarna, B Thakur, Mamta