A5050040950- Optimization and Mathematical Programming
- Supply Chain and Inventory Management
- Advanced Manufacturing and Logistics Optimization
- Scheduling and Optimization Algorithms
- Experimental Learning in Engineering
- Innovative Teaching Methods
- Vehicle Routing Optimization Methods
- COVID-19 and Mental Health
- Optimization and Packing Problems
- Cybercrime and Law Enforcement Studies
- Emotional Intelligence and Performance
- Mindfulness and Compassion Interventions
- Evolutionary Algorithms and Applications
- Evaluation of Teaching Practices
- Online and Blended Learning
- Genetics, Bioinformatics, and Biomedical Research
- Advanced Multi-Objective Optimization Algorithms
- Spam and Phishing Detection
- Metaheuristic Optimization Algorithms Research
- Communication in Education and Healthcare
- Economic theories and models
- Facility Location and Emergency Management
- Wildlife Ecology and Conservation
- Genetic diversity and population structure
- Smart Parking Systems Research
Indian Institute of Technology Kanpur
2010-2023
Bhabha Atomic Research Center Hospital
2023
Indian Institute of Management Mumbai
2023
Ahmedabad University
2023
Chhatrapati Shahu Ji Maharaj University
2023
Mangalayatan University
2023
University of California, Merced
2022
State Forest Research Institute
2021
University of California, Irvine
2020-2021
Tropical Forest Research Institute
2021
Significance Small and isolated populations have low genetic variation due to founding bottlenecks drift. Few empirical studies demonstrate visible phenotypic change associated with drift using data in endangered species. We used genomic analyses of a captive tiger pedigree identify the basis for rare trait, pseudomelanism, tigers. Genome sequencing extensive genotyping noninvasive samples across range revealed unique spatial presence this allele Similipal Tiger Reserve, India. Population...
The Classroom Observation Protocol for Undergraduate STEM (COPUS) provides descriptive feedback to instructors by capturing student and instructor behaviors occurring in the classroom. Due increasing prevalence of COPUS data collection, it is important recognize how researchers determine whether groups courses or have unique classroom characteristics. One approach uses cluster analysis, highlighted a recently developed tool, Analyzer, that enables characterization into one seven clusters...
Abstract Background The University of California system has a novel tenure-track education-focused faculty position called Lecturer with Security Employment (working titles: Teaching Professor or Teaching). We focus on the potential difference in implementation active-learning strategies by type, including faculty, research-focused and non-tenure-track lecturers. In addition, we consider other instructor characteristics (faculty rank, years teaching, gender) classroom (campus, discipline,...
Ransomware is a malware which spreading largely around the world and imposing serious threats to information assets victimizes internet users by hijacking encrypting their files, then demanding payment get back access files. Seeking system vulnerabilities, ransomware tries seize control over victim's files system, until victim agrees attacker's demands. In this paper, we have extended work focusing on Indicator of Compromises (IOCs) for using Cuckoo Sandbox. These IOCs are used set base...
Lower bound (LB) of weak formulation single stage capacitated warehouse location problem (SSCWLP) has low strength when compared to that the strong formulation. Hence, overall computational time solve SSCWLP is very high. Strong take lesser branch-and-bound (B&B) nodes but at cost higher for linear programming (LP) relaxation each node. Thus a trade-off required, leading hybrid formulation, containing better characteristics and formulations. Most promising constraints are utilised reduce...
Two-level, multi-item, multi-period-capacitated dynamic lot-sizing problem with inclusions of backorders and setup times, TL_CLSP_BS, a well-known NP-hard problem, is solved using novel procedure. Lagrangian relaxation the material balance constraint reduces TL_CLSP_BS to single-constraint continuous knapsack problem. Reduced bounded variable linear programs (BVLPs). We obtain promising bounds, which provides better start branch-and-bound Limited empirical investigations are carried out on...
In this work, we attempt an NP-hard problem called multi item, period two level capacitated lot sizing with considerations of backorders and setup times. To be close to reality, the demand is considered dynamic. With use Lagrangian relaxation, reduced a continuous knapsack which then solved using bounded variable linear programs. Though optimality, solution further improved by branch bound method in order obtain closer optimal. As procedure makes most basic algebraic computations, it...
In this work we introduce an innovative procedure to solve the capacitated lot sizing problem with backorders and setup times, called CLSP_BS. The formulates CLSP_BS as a mixed integer programming (MIP) problem, reduces it structure of bounded variable linear program; then calculates some ratios coefficients determine approximate solution problem. This initial is further improved using intelligent enumeration procedure. Adopting procedure, NP hard MIP differently easily, by mere calculation...
Biogeography-based optimization (BBO) is a nature-inspired metaheuristic, motivated by the migration of species between habitats. It has been shown to provide good performance on several tasks. However, BBO does not capture effects age structures individuals. In past, concept incorporated other nature- inspired algorithms, leading general improvement in their capability. To reap similar benefits, novel variant called age-structured (ASBBO) proposed, that introduces individuals process. based...
It is shown that when backorders, setup times and dynamic demand are included in capacitated lot sizing problem, the resulting classical formulation one of transportation formulations problem (referred to as CLSP_BS) equivalent. And it both “weak” (as opposed “strong” formulation). The other version a strong CLSP_BS. Extensive computational studies presented for medium large sized problems. In case medium-sized problems, produces better LP bounds, takes lesser number branch-and-bound (B&B)...
Consider the standard multi-item, multi-period, capacitated lot sizing problem with setup, inventory and backorders (MIMPCLSPWSIB).To this we add issue of setup carry over.This is explained as follows.If an item i scheduled last in period (t-1), first 't', do not incur time cost 't'.We only 't-1'.This results MIMPCLSPWSCIB.We give here two formulations discuss merits each formulation paper.
This research endeavors to explore the impact of yoga on exam stress among higher secondary level students in Meerut District, with overarching goal contributing a more peaceful tomorrow. The study holds significance its dual focus: identifying various training schedules suitable for school and evaluating levels experienced by students. design encompasses total 20 girls boys from schools establishing controlled environment in-depth analysis. Among these participants, 10 have been...
We investigate different formulations of the multi item, period capacitated lot sizing problem with inclusions backorders, setup times and costs into it. The is closer to realistic situations abbreviated as CLSP_BS in this work. Apart from classical formulation, we give two variants transportation formulation CLSP_BS. Objective values these three are exactly equivalent each other, but they rank terms computational times. When compare bounds obtained by LP relaxation formulations, it observed...
Capacitated lot sizing problem (CLSP) finds its applications in manufacturing, production as-well-as process industries. Typical size of the real life problems is much larger compared to sizes that can be handled by commercial solvers, as CLSP an NP-hard problem. Researchers have attempted different variants last few decades and provided many classical, exact, heuristic metaheuristic solution approaches. In this paper, we attempt solve multi item capacitated dynamic with backorders setup...
Capacitated lot sizing problem (CLSP) finds its applications in manufacturing, production as-well-as process industries. Typical size of the real life problems is much larger compared to sizes that can be handled by commercial solvers, as CLSP an NP-hard problem. Researchers have attempted different variants last few decades and provided many classical, exact, heuristic metaheuristic solution approaches. In this paper, we attempt solve multi item capacitated dynamic with backorders setup...