Shalini Arora - Academia.edu (original) (raw)

Papers by Shalini Arora

Research paper thumbnail of Extension of Fixed Charge Bulk Transportation Problem

In this paper a fixed charge bulk transportation problem is discussed in which only n out of n de... more In this paper a fixed charge bulk transportation problem is discussed in which only n out of n destinations (n < n) are to be served in bulk by the given m sources (m ≤ n). This is assumed that the transportation is done in parallel from all sources and each destination receive its demand from a single source but a source can serve to more than one destination. The purpose is to find the optimal grouping of source-destination pair which minimizes the total cost i.e the bulk cost and the fixed cost. In order to find optimal grouping, lexi-search approach has been used. A heuristic is proposed to find out the starting upper bound.

Research paper thumbnail of Trade-Offs in Bi-objective Transportation Problem corresponding to all Pivotal Times

The present paper explores one of the versions of bi-objective transportation problem with the co... more The present paper explores one of the versions of bi-objective transportation problem with the concept of pivotal time in a scenario when both the problems have more than one pivotal time and time pivotal for one problem may or may not be pivotal for the other. The concerned problem has been divided into two scenarios and an algorithm has been proposed to glean the efficient set of trade-off pairs of transportation and deterioration cost corresponding to each pivotal time starting from maximum pivotal time to minimum pivotal time. To reinforce the existence of the suggested procedure a Numerical illustration is also given.

Research paper thumbnail of On a Standard Time Transportation Problem

Research paper thumbnail of Bilevel transportation problem in neutrosophic environment

Computational and Applied Mathematics, 2022

In the current times of the predominance of COVID-19, almost all the countries are conducting ino... more In the current times of the predominance of COVID-19, almost all the countries are conducting inoculation drives. Given the market's inability to compute how much to manufacture, how to transport and the frequently changing demand, the cost of safely and timely transporting the vaccines from factory to syringe is currently indeterminate. In this paper, we formulate this situation using a bilevel transportation problem with neutrosophic numbers (BLTP-NN). The problem comes from a vaccine manufacturing company where the vaccine is produced and then transported to different distribution centres from where it is further transported to various health centres for the conduction of their vaccination drive. The authors have tried to perceive this situation from two perspectives by formulating two different problems. The first problem is a bilevel linear fractional transportation problem which aims at minimizing the transportation cost in proportion to per unit maximization of quantity transported. The second problem is a bilevel indefinite quadratic transportation problem which aims at minimizing the transportation cost and depreciation cost. In both problems, cost coefficients are neutrosophic numbers along with availabilities and demands in the constraint set. These formulated bilevel transportation problems in neutrosophic environment are solved using goal programming strategy to arrive at a satisfactory solution. The relevance of this work is to help the decision makers in budgeting their finances related to the transportation by strategic disbursement leading to a smooth administration of vaccination program.

Research paper thumbnail of ANG II promotes autophagy in podocytes

AJP: Cell Physiology, 2010

Podocytes are an integral and important constituent of the glomerular filtration barrier (GFB) an... more Podocytes are an integral and important constituent of the glomerular filtration barrier (GFB) and are exposed to a higher concentrations of ANG II in diseased states; consequently, podocytes may accumulate oxidized proteins and damaged mitochondria. In the present study, we evaluated the effect of ANG II on the podocyte autophagic process, which is likely to be triggered in order to degrade unwanted proteins and damaged organelles. To quantitate the occurrence of autophagy, electron microscopic studies were carried out on control and ANG II-treated conditionally immortalized mouse podocytes (CIMPs). ANG II-treated cells showed a fivefold greater number of autophagosomes/field compared with control cells. This proautophagic effect of ANG II was inhibited by pretreatment with 3-methyladenine, an inhibitor of autophagy. ANG II also enhanced podocyte expression of autophagic genes such as LC3-2 and beclin-1. Since oxidative stress is often associated with the induction of autophagy, we...

Research paper thumbnail of A priority based time minimization transportation problem

Yugoslav Journal of Operations Research

This paper discusses a priority based time minimizing transporation problem in which destinations... more This paper discusses a priority based time minimizing transporation problem in which destinations are prioritized so that the material is supplied, based upon the priorities of the destinations. All the destinations, which are at priority, are served first in Stage-I while the demands of the secondary destinations are met in Stage-II. It is assumed that secondary transportation can not take place until the primary transportation is done. The purpose is to transport in such a manner that the sum of the transportation time of primary and secondary destinations is minimum. To achieve this, two approaches are proposed. In the first approach, primary destinations are served optimally by giving weights while in the second approach, lexicographic optimization is used. From the generated pairs, the minimum sum of times corressponding to Stage-I and Stage-II times is picked up as the optimal solution. It is also shown, through Computational Details, that the lexicographic optimization conver...

Research paper thumbnail of Study of Metal Contaminated Soil on Various part of Planet Earth

Exposure to toxic heavy metals is associated with many chronic diseases and can cause a wide vari... more Exposure to toxic heavy metals is associated with many chronic diseases and can cause a wide variety of health problems. Urban soils receive varying inputs of heavy metals from a variety of mobile or stationary sources such as vehicular traffic, industrial plants, power generation facilities, residential oil burning, waste incineration, construction and demolition activities and re-suspension of surrounding contaminated soils and makes a significant contribution to the pollution in the urban environment. Therefore, the study of urban soil is important for determining the origin, distribution, and level of heavy metal contamination in urban environments. Present paper deal with the review of the soil analysis and hazardous effects on human health. The study of environment is going on from centuries and the chemical composition of naturally occurring soil is keep on changing according to the climatic and atmospheric conditions of biosphere. This ratio is the deciding factor of fertility of soil and as the composition of soil keep on changing the fertility and quality of soil degrading simultaneously. Two main sources of metal concentration inherited from parent rock, during origin of earth and anthropogenic contamination [1]. It causes the change in heavy metal ratio in soil and plants during a period [2]. Although forests soil is less contaminated due to least human influence. The variation in the composition of heavy metal in soil have disasters effect on nature of mine soils and its risk assessment in their respective studies [3]. During extraction of heavy metal from mine the metal retained in soil so composition of soil changes [4]. Wide range of studies on Environmental Pollution are available according to climatic conditions, varies Urban to Rural Worldwide. The amount/concentration of iodine and carbonates in various samples of rocks and sea water varies according to the environmental condition, the distribution of iodine throughout earth crust including surface of soil water and percentage presence of mica in clay and shale [5]. There is a dense relation of environmental chemical composition of natural recourses and pollution in their separate studies [6]. The water in India is specified under BIS, Indian standard drinking water specifications, IS: 10500, [7]. The distribution of heavy metals in surface water of Ranipet industrial area in Tamil Nadu, India [8]. The influence of heavy metal on environment arises from sewage sludge of ferrosols [9]. The consequences of emission of heavy metal through various sources and their dominance of toxicity or traces of metal on soil and natural water in the different areas of Planet Earth [10,11]. Metals also have a vital advantage for our bodies or living organisms, these are utilized by various modes in any biological system as, Nickel (Ni): Ni is cubic crystal, silvery and a d-block metal (period 4 and group 10). It has atomic number 28, atomic mass 58.7, density 8.9 g/cm3, high melting and boiling point. It is an element that occurs in the environment only at very low levels and is essential in small doses. Chromium (Cr): Cr is a cubic crystal, steel gray, very hard and a d-block metal (period 4 and group 6). Chromium is required for carbohydrate and lipid metabolism and the utilization of amino acids. Chromium is used in metal alloys and pigments for paints, cement, paper, rubber, and other materials [12]. Zinc (Zn): Zn is a hexagonal crystal, bluish-white metal and a d-block metal (period 4 and group 12). It also has atomic number 30, atomic mass 65.4, density 7.15 g/cm 3. Then also from the use of liquid manure, composted materials, fertilizers, and pesticides in agriculture [13]. Copper (Cu): Cu is a cubic crystal, reddish and a d-block metal. (period 4 and group 11).Cu has atomic number 29, atomic mass 63.5, density 8.96 g/cm 3 ,High melting point 1357 K and boiling point 2840 K. It occurs in rocks, soil, water, air, plants, and animals. It is also an essential micronutrient required in the growth of both plants and animals. Cadmium (Cd): Cd enters the environment through the uncontrolled burning of coal and garbage and through the food chain directly or indirectly from plants or animals [3]. Lead (Pb): Pb is cubic crystal, silver blue-white, soft and a p-block metal (period 6 and group 14). According to lead is a naturally occurring and found as a mineral combined with other elements such as sulphur (PbS, PbSO 4) and oxygen (PbCO 3).

Research paper thumbnail of A variant of time minimizing assignment problem

European Journal of Operational Research, 1998

A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) person... more A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more than one job, he does them one after the other in any order. The aim of the present study is to find that feasible assignment which minimizes the total time for completing all the jobs. A lexi-search approach is proposed to find an optimal feasible assignment.

Research paper thumbnail of A Lexi-Search Algorithm for a Time Minimizing Assignment Problem

Research paper thumbnail of Efficient triads related to transportation problem with common pivotal time

International Journal of System Assurance Engineering and Management

Research paper thumbnail of Limitation and modification: On a cost pipeline trade-off in a transportation problem

Yugoslav Journal of Operations Research

Research paper thumbnail of Minimization of makespan in generalized assignment problem

OPSEARCH

A quantitative combinatorial search problem consisting of m sources supplying in bulk to n(> m) d... more A quantitative combinatorial search problem consisting of m sources supplying in bulk to n(> m) destinations is considered in this paper. Each destination receives its full quota of a homogeneous product from a single source but a source can supply to many destinations subject to its capacity restrictions. If tij, which without loss of generality can be assumed to be a positive integer, is the time of transportation for shipping the goods from the source i to the destination j, then the total time used by the i th source is sum of the transportation times to the destinations that are served by this source. The time of transportation, called makespan, for a feasible solution of this generalized assignment problem (also called bulk transportation problem) is the maximum total time used by a source. The objective is to find a feasible solution that minimizes the makespan. A lexicographic search algorithm is developed which avoids scanning through all the possible feasible solutions though the search is exhaustive enough to obtain an optimal feasible solution at an early stage of the search. A starting upper bound on the value of objective function computed heauristically is used as a supplementary aid in reducing the search. Some results are established which, though of computational nature, help to reduce both the memory requirements and computational time.

Research paper thumbnail of Extension of Fixed Charge Bulk Transportation Problem

In this paper a fixed charge bulk transportation problem is discussed in which only n out of n de... more In this paper a fixed charge bulk transportation problem is discussed in which only n out of n destinations (n < n) are to be served in bulk by the given m sources (m ≤ n). This is assumed that the transportation is done in parallel from all sources and each destination receive its demand from a single source but a source can serve to more than one destination. The purpose is to find the optimal grouping of source-destination pair which minimizes the total cost i.e the bulk cost and the fixed cost. In order to find optimal grouping, lexi-search approach has been used. A heuristic is proposed to find out the starting upper bound.

Research paper thumbnail of Trade-Offs in Bi-objective Transportation Problem corresponding to all Pivotal Times

The present paper explores one of the versions of bi-objective transportation problem with the co... more The present paper explores one of the versions of bi-objective transportation problem with the concept of pivotal time in a scenario when both the problems have more than one pivotal time and time pivotal for one problem may or may not be pivotal for the other. The concerned problem has been divided into two scenarios and an algorithm has been proposed to glean the efficient set of trade-off pairs of transportation and deterioration cost corresponding to each pivotal time starting from maximum pivotal time to minimum pivotal time. To reinforce the existence of the suggested procedure a Numerical illustration is also given.

Research paper thumbnail of On a Standard Time Transportation Problem

Research paper thumbnail of Bilevel transportation problem in neutrosophic environment

Computational and Applied Mathematics, 2022

In the current times of the predominance of COVID-19, almost all the countries are conducting ino... more In the current times of the predominance of COVID-19, almost all the countries are conducting inoculation drives. Given the market's inability to compute how much to manufacture, how to transport and the frequently changing demand, the cost of safely and timely transporting the vaccines from factory to syringe is currently indeterminate. In this paper, we formulate this situation using a bilevel transportation problem with neutrosophic numbers (BLTP-NN). The problem comes from a vaccine manufacturing company where the vaccine is produced and then transported to different distribution centres from where it is further transported to various health centres for the conduction of their vaccination drive. The authors have tried to perceive this situation from two perspectives by formulating two different problems. The first problem is a bilevel linear fractional transportation problem which aims at minimizing the transportation cost in proportion to per unit maximization of quantity transported. The second problem is a bilevel indefinite quadratic transportation problem which aims at minimizing the transportation cost and depreciation cost. In both problems, cost coefficients are neutrosophic numbers along with availabilities and demands in the constraint set. These formulated bilevel transportation problems in neutrosophic environment are solved using goal programming strategy to arrive at a satisfactory solution. The relevance of this work is to help the decision makers in budgeting their finances related to the transportation by strategic disbursement leading to a smooth administration of vaccination program.

Research paper thumbnail of ANG II promotes autophagy in podocytes

AJP: Cell Physiology, 2010

Podocytes are an integral and important constituent of the glomerular filtration barrier (GFB) an... more Podocytes are an integral and important constituent of the glomerular filtration barrier (GFB) and are exposed to a higher concentrations of ANG II in diseased states; consequently, podocytes may accumulate oxidized proteins and damaged mitochondria. In the present study, we evaluated the effect of ANG II on the podocyte autophagic process, which is likely to be triggered in order to degrade unwanted proteins and damaged organelles. To quantitate the occurrence of autophagy, electron microscopic studies were carried out on control and ANG II-treated conditionally immortalized mouse podocytes (CIMPs). ANG II-treated cells showed a fivefold greater number of autophagosomes/field compared with control cells. This proautophagic effect of ANG II was inhibited by pretreatment with 3-methyladenine, an inhibitor of autophagy. ANG II also enhanced podocyte expression of autophagic genes such as LC3-2 and beclin-1. Since oxidative stress is often associated with the induction of autophagy, we...

Research paper thumbnail of A priority based time minimization transportation problem

Yugoslav Journal of Operations Research

This paper discusses a priority based time minimizing transporation problem in which destinations... more This paper discusses a priority based time minimizing transporation problem in which destinations are prioritized so that the material is supplied, based upon the priorities of the destinations. All the destinations, which are at priority, are served first in Stage-I while the demands of the secondary destinations are met in Stage-II. It is assumed that secondary transportation can not take place until the primary transportation is done. The purpose is to transport in such a manner that the sum of the transportation time of primary and secondary destinations is minimum. To achieve this, two approaches are proposed. In the first approach, primary destinations are served optimally by giving weights while in the second approach, lexicographic optimization is used. From the generated pairs, the minimum sum of times corressponding to Stage-I and Stage-II times is picked up as the optimal solution. It is also shown, through Computational Details, that the lexicographic optimization conver...

Research paper thumbnail of Study of Metal Contaminated Soil on Various part of Planet Earth

Exposure to toxic heavy metals is associated with many chronic diseases and can cause a wide vari... more Exposure to toxic heavy metals is associated with many chronic diseases and can cause a wide variety of health problems. Urban soils receive varying inputs of heavy metals from a variety of mobile or stationary sources such as vehicular traffic, industrial plants, power generation facilities, residential oil burning, waste incineration, construction and demolition activities and re-suspension of surrounding contaminated soils and makes a significant contribution to the pollution in the urban environment. Therefore, the study of urban soil is important for determining the origin, distribution, and level of heavy metal contamination in urban environments. Present paper deal with the review of the soil analysis and hazardous effects on human health. The study of environment is going on from centuries and the chemical composition of naturally occurring soil is keep on changing according to the climatic and atmospheric conditions of biosphere. This ratio is the deciding factor of fertility of soil and as the composition of soil keep on changing the fertility and quality of soil degrading simultaneously. Two main sources of metal concentration inherited from parent rock, during origin of earth and anthropogenic contamination [1]. It causes the change in heavy metal ratio in soil and plants during a period [2]. Although forests soil is less contaminated due to least human influence. The variation in the composition of heavy metal in soil have disasters effect on nature of mine soils and its risk assessment in their respective studies [3]. During extraction of heavy metal from mine the metal retained in soil so composition of soil changes [4]. Wide range of studies on Environmental Pollution are available according to climatic conditions, varies Urban to Rural Worldwide. The amount/concentration of iodine and carbonates in various samples of rocks and sea water varies according to the environmental condition, the distribution of iodine throughout earth crust including surface of soil water and percentage presence of mica in clay and shale [5]. There is a dense relation of environmental chemical composition of natural recourses and pollution in their separate studies [6]. The water in India is specified under BIS, Indian standard drinking water specifications, IS: 10500, [7]. The distribution of heavy metals in surface water of Ranipet industrial area in Tamil Nadu, India [8]. The influence of heavy metal on environment arises from sewage sludge of ferrosols [9]. The consequences of emission of heavy metal through various sources and their dominance of toxicity or traces of metal on soil and natural water in the different areas of Planet Earth [10,11]. Metals also have a vital advantage for our bodies or living organisms, these are utilized by various modes in any biological system as, Nickel (Ni): Ni is cubic crystal, silvery and a d-block metal (period 4 and group 10). It has atomic number 28, atomic mass 58.7, density 8.9 g/cm3, high melting and boiling point. It is an element that occurs in the environment only at very low levels and is essential in small doses. Chromium (Cr): Cr is a cubic crystal, steel gray, very hard and a d-block metal (period 4 and group 6). Chromium is required for carbohydrate and lipid metabolism and the utilization of amino acids. Chromium is used in metal alloys and pigments for paints, cement, paper, rubber, and other materials [12]. Zinc (Zn): Zn is a hexagonal crystal, bluish-white metal and a d-block metal (period 4 and group 12). It also has atomic number 30, atomic mass 65.4, density 7.15 g/cm 3. Then also from the use of liquid manure, composted materials, fertilizers, and pesticides in agriculture [13]. Copper (Cu): Cu is a cubic crystal, reddish and a d-block metal. (period 4 and group 11).Cu has atomic number 29, atomic mass 63.5, density 8.96 g/cm 3 ,High melting point 1357 K and boiling point 2840 K. It occurs in rocks, soil, water, air, plants, and animals. It is also an essential micronutrient required in the growth of both plants and animals. Cadmium (Cd): Cd enters the environment through the uncontrolled burning of coal and garbage and through the food chain directly or indirectly from plants or animals [3]. Lead (Pb): Pb is cubic crystal, silver blue-white, soft and a p-block metal (period 6 and group 14). According to lead is a naturally occurring and found as a mineral combined with other elements such as sulphur (PbS, PbSO 4) and oxygen (PbCO 3).

Research paper thumbnail of A variant of time minimizing assignment problem

European Journal of Operational Research, 1998

A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) person... more A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more than one job, he does them one after the other in any order. The aim of the present study is to find that feasible assignment which minimizes the total time for completing all the jobs. A lexi-search approach is proposed to find an optimal feasible assignment.

Research paper thumbnail of A Lexi-Search Algorithm for a Time Minimizing Assignment Problem

Research paper thumbnail of Efficient triads related to transportation problem with common pivotal time

International Journal of System Assurance Engineering and Management

Research paper thumbnail of Limitation and modification: On a cost pipeline trade-off in a transportation problem

Yugoslav Journal of Operations Research

Research paper thumbnail of Minimization of makespan in generalized assignment problem

OPSEARCH

A quantitative combinatorial search problem consisting of m sources supplying in bulk to n(> m) d... more A quantitative combinatorial search problem consisting of m sources supplying in bulk to n(> m) destinations is considered in this paper. Each destination receives its full quota of a homogeneous product from a single source but a source can supply to many destinations subject to its capacity restrictions. If tij, which without loss of generality can be assumed to be a positive integer, is the time of transportation for shipping the goods from the source i to the destination j, then the total time used by the i th source is sum of the transportation times to the destinations that are served by this source. The time of transportation, called makespan, for a feasible solution of this generalized assignment problem (also called bulk transportation problem) is the maximum total time used by a source. The objective is to find a feasible solution that minimizes the makespan. A lexicographic search algorithm is developed which avoids scanning through all the possible feasible solutions though the search is exhaustive enough to obtain an optimal feasible solution at an early stage of the search. A starting upper bound on the value of objective function computed heauristically is used as a supplementary aid in reducing the search. Some results are established which, though of computational nature, help to reduce both the memory requirements and computational time.