Ravi Saini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ravi Saini has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Ashish Mani
Amity University
4 shared publications - M. S. Prasad
Amity University
3 shared publications Siddhartha Bhattacharyya
VŠB Technical University of Ostrava
2 shared publications- Himanshu Gupta
Amity University
1 shared publication - Jan Platos
VŠB Technical University of Ostrava
1 shared publication M. S. Prasad
Amity Institute of Space Science and Technology, Amity University, Noida, Uttar Pradesh, India
1 shared publication
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 173-186
Maritime UCAV Path Planning: A Comparative Study of Classical and Quantum-Inspired Adaptive Differential Evolution
- 2 July 2026
- Published by Springer Nature
- p. 173-186
Maritime UCAV Path Planning: A Comparative Study of Classical and Quantum-Inspired Adaptive Differential Evolution
- 13 November 2025
- Published by Springer Nature
- p. 255-275
Maritime UCAV Path Planning: A Comparative Study of Classical and Quantum-Inspired Particle Swarm Optimization
- 13 November 2025
- Published by Springer Nature
- p. 255-275
Maritime UCAV Path Planning: A Comparative Study of Classical and Quantum-Inspired Particle Swarm Optimization
- Open Access
- 25 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 54223-54239
Evolutionary Algorithm for the Traveling Salesman Problem With Innovative Encoding on Hybrid Quantum-Classical Machines
Introduction The Traveling Salesman Problem (TSP) is a widely studied NP-complete optimization challenge with significant theoretical and practical implications Methods This study proposes a hybrid quantum-classical framework using a Quantum-Inspired Evolutionary Algorithm (QEA) with Sort Gray Binary Encoding to solve the TSP. The proposed method guarantees the generation of valid TSP tours by eliminating invalid solutions. It employs quantum superposition with intrinsic randomness to enhance computational efficiency and scalability. The framework was implemented on cloud-based NISQ platforms, including IBM Quantum and AWS Braket, demonstrating its practicality and effectiveness Results Experimental evaluations revealed that the proposed framework successfully solved TSP instances with up to 15 cities, achieving superior performance compared to classical methods and showcasing its ability to scale under NISQ constraints Discussion The results also highlight the potential of hybrid quantum-classical approaches to overcome hardware limitations in current quantum systems. This study establishes a robust hybrid methodology for solving combinatorial optimization problems. It also sets a benchmark for leveraging the capabilities of NISQ-era quantum devices in real-world applications, thereby providing a foundation for future research in hybrid quantum-classical optimization techniques.
- 25 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 54223-54239
Open AccessEvolutionary Algorithm for the Traveling Salesman Problem With Innovative Encoding on Hybrid Quantum-Classical Machines
Introduction The Traveling Salesman Problem (TSP) is a widely studied NP-complete optimization challenge with significant theoretical and practical implications Methods This study proposes a hybrid quantum-classical framework using a Quantum-Inspired Evolutionary Algorithm (QEA) with Sort Gray Binary Encoding to solve the TSP. The proposed method guarantees the generation of valid TSP tours by eliminating invalid solutions. It employs quantum superposition with intrinsic randomness to enhance computational efficiency and scalability. The framework was implemented on cloud-based NISQ platforms, including IBM Quantum and AWS Braket, demonstrating its practicality and effectiveness Results Experimental evaluations revealed that the proposed framework successfully solved TSP instances with up to 15 cities, achieving superior performance compared to classical methods and showcasing its ability to scale under NISQ constraints Discussion The results also highlight the potential of hybrid quantum-classical approaches to overcome hardware limitations in current quantum systems. This study establishes a robust hybrid methodology for solving combinatorial optimization problems. It also sets a benchmark for leveraging the capabilities of NISQ-era quantum devices in real-world applications, thereby providing a foundation for future research in hybrid quantum-classical optimization techniques.
- 30 March 2022
- Published by Springer Nature
- p. 147-165
Societal Gene Acceptance Index-Based Crossover in GA for Travelling Salesman Problem
- 30 March 2022
- Published by Springer Nature
- p. 147-165
Societal Gene Acceptance Index-Based Crossover in GA for Travelling Salesman Problem
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A security framework against ARP spoofing
Day by day peoples are going towards internet but they are not have much information about it they only do their work. Attackers take advantage of it by using some network holes. ARP spoofing is one of the holes in networking. ARP (Address resolution protocol) is stateless and unauthenticated protocol at layer 3 and attackers take it as a tool for attack in a LAN (local area network). ARP maintains a table that a packet can reach to its genuine host and the table is called ARP cache. ARP cache is usually used for mapping the Logical address to physical address. Logical address is called IP address and physical is known as MAC address. There are some tools easily available for Linux and Windows to perform these attacks. ARP spoofing allows an attacker to perform DoS (Denial of service) and MITM (man in the middle) attacks. In this paper we will discuss a way that can prevent ARP spoofing and also include other methods that are easily available on internet as software. In this paper we will see how we can keep ourselves secure from attacker that knows ARP spoofing. We will see a method that anyone can use and easy to use. There are lot of approaches to handle this problem we know that but which is good one and which is not so we will do some comparison on few approaches.
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A security framework against ARP spoofing
Day by day peoples are going towards internet but they are not have much information about it they only do their work. Attackers take advantage of it by using some network holes. ARP spoofing is one of the holes in networking. ARP (Address resolution protocol) is stateless and unauthenticated protocol at layer 3 and attackers take it as a tool for attack in a LAN (local area network). ARP maintains a table that a packet can reach to its genuine host and the table is called ARP cache. ARP cache is usually used for mapping the Logical address to physical address. Logical address is called IP address and physical is known as MAC address. There are some tools easily available for Linux and Windows to perform these attacks. ARP spoofing allows an attacker to perform DoS (Denial of service) and MITM (man in the middle) attacks. In this paper we will discuss a way that can prevent ARP spoofing and also include other methods that are easily available on internet as software. In this paper we will see how we can keep ourselves secure from attacker that knows ARP spoofing. We will see a method that anyone can use and easy to use. There are lot of approaches to handle this problem we know that but which is good one and which is not so we will do some comparison on few approaches.