sourabh Joshi - Academia.edu (original) (raw)

Papers by sourabh Joshi

Research paper thumbnail of Ant Colony Optimization Meta-heuristic for Solving Real Travelling Salesman Problem

Emerging Research in Computing, Information, Communication and Applications, 2016

Ant colony optimisation is a population-based advanced approach for finding the solution of diffi... more Ant colony optimisation is a population-based advanced approach for finding the solution of difficult problems with the help of a bioinspired approach from the behaviour of natural ants. The ant colony algorithm is a propelled optimisation method which is utilised to take care of combinatorial optimisation problems. The significant features of this algorithm are the utilisation of a mixture of preinformation and postinformation for organizing great solutions. The ant colony algorithm is used in this paper for solving the travelling salesman problem of the real set of data and getting the optimal results on graphs. This algorithm is an meta-heuristic algorithm in which we used the 2-opt local search method for tour construction and roulette wheel selection method for selection of nodes while constructing the route. The results show that this algorithm can efficiently find the optimal path of the hundred cities with minimum time and cost.

Research paper thumbnail of Comparative Analysis of Two Different Heuristics for Model of VRP

2015 Second International Conference on Advances in Computing and Communication Engineering, 2015

Vehicle routing problem (VRP) is realistic optimization problem used to find the best feasible ro... more Vehicle routing problem (VRP) is realistic optimization problem used to find the best feasible route of a vehicle. VRP is mostly used for sorting the different routes of vehicles to provide efficient services to the customers. In this paper, we implement two different heuristics, nearest neighbor insertion and ant colony optimization for solving vehicle routing problem and their respective results are shown by using graphical implementation. While performing the experiment we analyzed both the heuristics and depict which heuristic solve the problem efficiently with respect to cost and time.

Research paper thumbnail of Comparative analysis of two different ant colony algorithm for model of TSP

2015 International Conference on Advances in Computer Engineering and Applications, 2015

Travelling Salesman Problem is well - known and extensively studied problem which plays an import... more Travelling Salesman Problem is well - known and extensively studied problem which plays an important role in combinatorial optimization and in context of ACO. Ant Colony Optimization is heuristic Algorithm which was initially applied on TSP and is an advance technique applied on various other optimization problems. In the research we study two different kinds of Ant Colony algorithms named as Ant System and the improved version of Ant system known as Max-Min Ant System performed in MATLAB to solve travelling Salesman Problem and their respective results are shown by using graphical implementation. In this paper both systems are analyzed by solving the same example of TSP and depict which system solve the problem efficiently with respect to cost and time.

Research paper thumbnail of Cuckoo search approach for virtual machine consolidation in cloud data centre

International Conference on Computing, Communication & Automation, 2015

The new optimization approach based on bio-inspired algorithms is the Cuckoo Search which is insp... more The new optimization approach based on bio-inspired algorithms is the Cuckoo Search which is inspired from the life style of Cuckoo bird. In this paper, we explain the cuckoo search algorithm which comes under the evolutionary algorithms for virtual machine consolidation that focuses on minimum power consumption and resource wastage in cloud data centers. As the VM consolidation problem is similar to bin packing problem and is NP-hard problem, so we explain this approach for solving the VM consolidation problem.

Research paper thumbnail of Food Sustainability Using Wireless Sensors Networks : Waspmote and Meshlium

In recent years much of the attention has been attracted by the Wireless Sensor Networks (WSNs) w... more In recent years much of the attention has been attracted by the Wireless Sensor Networks (WSNs) with immense applications that are used for collecting, sharing and storing the sensed data. They are increasingly being applied to wide variety of applications including habitat monitoring, agriculture, nuclear reactor control and security. The Wireless Sensor Networks used in this paper for use in food sustainability at each stage of the food cycle. Libelium’s Waspmote and Meshlium sensors are used for sensing and taking control decisions based on real time data of climatologically and other environmental properties to modify them. Keywords—GPS/GPRS, Libelium Waspmote and Meshlium Wirelss Sensor Networks, RFID, Waspmote Agriculture Board, ZigBee.

Research paper thumbnail of Single Incision Laparoscopic Surgery with Conventional Instruments

Revista Portuguesa De Cirurgia, 2010

General anesthesia was used in all patients and epidural analgesia was added in pelvic surgery. T... more General anesthesia was used in all patients and epidural analgesia was added in pelvic surgery. The Incision A standard 2 cm peri-umbilical skin incision was used in all patients, the incision being supra-umbilical for cholecystectomies and infra-umbilical for surgeries in the pelvis. Pneumoperitoneum In the initial few procedures the open technique was used to insert the 10 mm trocar into the superior or inferior umbilical tube as per the procedure. In the subsequent procedures Veress needle was used through the same incision, followed by trocar entry. METHODS. Patients undergoing laparoscopic surgery at our center were selected for participation in this study after

Research paper thumbnail of Robotic transthoracic esophagectomy in the prone position: Experience with 32 patients with esophageal cancer

The Journal of Thoracic and Cardiovascular Surgery, 2011

Research paper thumbnail of Robot-assisted low anterior resection in fifty-three consecutive patients: an Indian experience

Journal of Robotic Surgery, 2012

ABSTRACT From December 2005 to December 2009, we performed 150 laparoscopic colorectal procedures... more ABSTRACT From December 2005 to December 2009, we performed 150 laparoscopic colorectal procedures. Based on this experience, we started offering robot-assisted colorectal surgery from December 2009. This study is a prospective evaluation of consecutive patients in order to study the technical feasibility and oncological outcome of robot-assisted low anterior resection. This investigation was conducted at a single minimal access surgery institute. Between December 2009 and December 2011, 53 consecutive patients with rectal adenocarcinoma underwent a robot-assisted low anterior resection (LAR) or ultralow anterior resection (ULAR) with total mesorectal excision (TME), using the standard da Vinci ‘S’ model. Patient demographics, mean operative time, mean postoperative hospital stay, blood loss, days to first flatus, resumption of oral feeds, urinary incontinence, and sexual dysfunction were studied. Surgical and pathological outcomes such as quality of TME, free circumferential margins, and number of lymph nodes dissected were also evaluated. Robot docking and undocking times were noted. Of the 53 patients, 41 were men and 12 were women. Their mean age was 66.7 years (range 37–90 years). The ASA grades were distributed as follows: ASA I 15 (28.3 %), ASA II 25 (47.16 %), ASA III 12 (22.64 %), ASA IV 1 (1.88 %). The mean operative time was 180 min (150–230 min) and the mean blood loss was 101.6 ml (50–300 ml). The robot docking time was 10 min (15–25 min) and the undocking time was 5 min (3–10 min). The mean hospital stay was 8 days (7–15 days). None of the patients was converted to either laparoscopic or open procedure. The longitudinal and circumferential margins were negative in all patients. Histopathological reports of 45 patients showed complete TME while 8 patients showed nearly complete TME. No repositioning of the robot was needed for splenic flexure mobilization, thus decreasing the operative time. Along with TME, even the splenic flexure mobilization was achieved through the same robotic ports without undocking the robot. Robot-assisted LAR and ULAR is technically feasible, and a complete TME is possible.

Research paper thumbnail of Robotic rectovaginal fistula repair

Journal of Robotic Surgery, 2011

Minimally invasive surgery for diseases in the pelvic region is gaining popularity due to advance... more Minimally invasive surgery for diseases in the pelvic region is gaining popularity due to advances in technology and increased benefit to the patient. As indications for such surgeries increase, the known boundaries for minimal access are being extended by a few teams. We report a patient who underwent robotic-assisted transabdominal repair of a high rectovaginal fistula which developed following a vaginal hysterectomy. Vaginography revealed a communication between the vaginal vault and the upper rectum. After evaluation of the colon and the vagina, the patient was planned for a robotic-assisted rectovaginal fistula repair. The three-arm daVinci(®) surgical robot was used. A total of five ports were used to complete the entire procedure, which included adhesiolysis, re-creation of the vaginal vault, repair of the fistula and omental interposition. This is the first robotic-assisted rectovaginal fistula repair reported to date. Besides the advantages of minimally invasive surgery for the patient, the surgeon benefits from the ease of suturing deep in the pelvis afforded by the articulated robotic arms.

Research paper thumbnail of Preservation of Autonomic Nerves in Laparoscopic Total Radical Hysterectomy

Journal of Laparoendoscopic & Advanced Surgical Techniques, 2010

Objectives: The aim of this study was to evaluate the feasibility, complications, margin status, ... more Objectives: The aim of this study was to evaluate the feasibility, complications, margin status, and functional outcome (on urinary and sexual functions) of nerve-sparing radical hysterectomy (NSRH) performed laparoscopically. Methods: Patients with cervical carcinoma of stage Ia2 and Ib1 underwent laparoscopic NSRH along with pelvic lymphadenectomy. We performed the technique in simple comprehensible steps with anatomic delineation of the autonomic nerves and selective cutting of the uterine and cervical branches. Results: Laparoscopic NSRH was feasible in 85.7% of patients. Mean operative time was 160 minutes and all 7 patients had clear surgical margins. There were no complications and no blood transfusions were required. The median hospital stay was 3 days. The median return time for normal bladder function was 2 days and none of them required catheterization beyond 2 weeks. The mean residual urine volume was <50 mL. Urodynamic studies performed at 3 weeks after the operation showed no impairment of maximum flow rate (maximal flow rate: 20 AE 2 mL). The postoperative results of sexual dysfunction were inconclusive. Conclusion: Understanding this technique and the knowledge of laparoscopic anatomy of pelvic autonomic nerves is important in both benign and malignant pelvic surgeries. These preliminary results indicate that nerve sparing is easier done laparoscopically and its results are comparable to that of conventional laparoscopic radical hysterectomy in terms of lateral margin status and lymph node yield. Whether quality of life can be benefited by L-NRSH technique and its long-term oncological sequelae need further evaluation.

Research paper thumbnail of Roullete Wheel Selection Mechanism for Solving Travelling Salesman Problem in Ant Colony Optimization

Research paper thumbnail of Nearest Neighbor Insertion Algorithm for solving capacitated vehicle routing problem

2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), 2015

Nearest Insertion Algorithm is heuristic algorithm which has been proven a successful technique a... more Nearest Insertion Algorithm is heuristic algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Nearest Neighbor Insertion Algorithm is taken as one of the efficient computing method for vehicle routing problem. We study a possibility of finding the optimal solution of vehicle routing problem and offer a practical implementation of the method used for solving this problem. We have taken a scenario in which different college buses takes the students from different bus stops. The experiments and result graphics shows how we effectively complete the route and generates the optimal solution.

Research paper thumbnail of Ant Colony Optimization Meta-heuristic for Solving Real Travelling Salesman Problem

Emerging Research in Computing, Information, Communication and Applications, 2016

Ant colony optimisation is a population-based advanced approach for finding the solution of diffi... more Ant colony optimisation is a population-based advanced approach for finding the solution of difficult problems with the help of a bioinspired approach from the behaviour of natural ants. The ant colony algorithm is a propelled optimisation method which is utilised to take care of combinatorial optimisation problems. The significant features of this algorithm are the utilisation of a mixture of preinformation and postinformation for organizing great solutions. The ant colony algorithm is used in this paper for solving the travelling salesman problem of the real set of data and getting the optimal results on graphs. This algorithm is an meta-heuristic algorithm in which we used the 2-opt local search method for tour construction and roulette wheel selection method for selection of nodes while constructing the route. The results show that this algorithm can efficiently find the optimal path of the hundred cities with minimum time and cost.

Research paper thumbnail of Comparative Analysis of Two Different Heuristics for Model of VRP

2015 Second International Conference on Advances in Computing and Communication Engineering, 2015

Vehicle routing problem (VRP) is realistic optimization problem used to find the best feasible ro... more Vehicle routing problem (VRP) is realistic optimization problem used to find the best feasible route of a vehicle. VRP is mostly used for sorting the different routes of vehicles to provide efficient services to the customers. In this paper, we implement two different heuristics, nearest neighbor insertion and ant colony optimization for solving vehicle routing problem and their respective results are shown by using graphical implementation. While performing the experiment we analyzed both the heuristics and depict which heuristic solve the problem efficiently with respect to cost and time.

Research paper thumbnail of Comparative analysis of two different ant colony algorithm for model of TSP

2015 International Conference on Advances in Computer Engineering and Applications, 2015

Travelling Salesman Problem is well - known and extensively studied problem which plays an import... more Travelling Salesman Problem is well - known and extensively studied problem which plays an important role in combinatorial optimization and in context of ACO. Ant Colony Optimization is heuristic Algorithm which was initially applied on TSP and is an advance technique applied on various other optimization problems. In the research we study two different kinds of Ant Colony algorithms named as Ant System and the improved version of Ant system known as Max-Min Ant System performed in MATLAB to solve travelling Salesman Problem and their respective results are shown by using graphical implementation. In this paper both systems are analyzed by solving the same example of TSP and depict which system solve the problem efficiently with respect to cost and time.

Research paper thumbnail of Cuckoo search approach for virtual machine consolidation in cloud data centre

International Conference on Computing, Communication & Automation, 2015

The new optimization approach based on bio-inspired algorithms is the Cuckoo Search which is insp... more The new optimization approach based on bio-inspired algorithms is the Cuckoo Search which is inspired from the life style of Cuckoo bird. In this paper, we explain the cuckoo search algorithm which comes under the evolutionary algorithms for virtual machine consolidation that focuses on minimum power consumption and resource wastage in cloud data centers. As the VM consolidation problem is similar to bin packing problem and is NP-hard problem, so we explain this approach for solving the VM consolidation problem.

Research paper thumbnail of Food Sustainability Using Wireless Sensors Networks : Waspmote and Meshlium

In recent years much of the attention has been attracted by the Wireless Sensor Networks (WSNs) w... more In recent years much of the attention has been attracted by the Wireless Sensor Networks (WSNs) with immense applications that are used for collecting, sharing and storing the sensed data. They are increasingly being applied to wide variety of applications including habitat monitoring, agriculture, nuclear reactor control and security. The Wireless Sensor Networks used in this paper for use in food sustainability at each stage of the food cycle. Libelium’s Waspmote and Meshlium sensors are used for sensing and taking control decisions based on real time data of climatologically and other environmental properties to modify them. Keywords—GPS/GPRS, Libelium Waspmote and Meshlium Wirelss Sensor Networks, RFID, Waspmote Agriculture Board, ZigBee.

Research paper thumbnail of Single Incision Laparoscopic Surgery with Conventional Instruments

Revista Portuguesa De Cirurgia, 2010

General anesthesia was used in all patients and epidural analgesia was added in pelvic surgery. T... more General anesthesia was used in all patients and epidural analgesia was added in pelvic surgery. The Incision A standard 2 cm peri-umbilical skin incision was used in all patients, the incision being supra-umbilical for cholecystectomies and infra-umbilical for surgeries in the pelvis. Pneumoperitoneum In the initial few procedures the open technique was used to insert the 10 mm trocar into the superior or inferior umbilical tube as per the procedure. In the subsequent procedures Veress needle was used through the same incision, followed by trocar entry. METHODS. Patients undergoing laparoscopic surgery at our center were selected for participation in this study after

Research paper thumbnail of Robotic transthoracic esophagectomy in the prone position: Experience with 32 patients with esophageal cancer

The Journal of Thoracic and Cardiovascular Surgery, 2011

Research paper thumbnail of Robot-assisted low anterior resection in fifty-three consecutive patients: an Indian experience

Journal of Robotic Surgery, 2012

ABSTRACT From December 2005 to December 2009, we performed 150 laparoscopic colorectal procedures... more ABSTRACT From December 2005 to December 2009, we performed 150 laparoscopic colorectal procedures. Based on this experience, we started offering robot-assisted colorectal surgery from December 2009. This study is a prospective evaluation of consecutive patients in order to study the technical feasibility and oncological outcome of robot-assisted low anterior resection. This investigation was conducted at a single minimal access surgery institute. Between December 2009 and December 2011, 53 consecutive patients with rectal adenocarcinoma underwent a robot-assisted low anterior resection (LAR) or ultralow anterior resection (ULAR) with total mesorectal excision (TME), using the standard da Vinci ‘S’ model. Patient demographics, mean operative time, mean postoperative hospital stay, blood loss, days to first flatus, resumption of oral feeds, urinary incontinence, and sexual dysfunction were studied. Surgical and pathological outcomes such as quality of TME, free circumferential margins, and number of lymph nodes dissected were also evaluated. Robot docking and undocking times were noted. Of the 53 patients, 41 were men and 12 were women. Their mean age was 66.7 years (range 37–90 years). The ASA grades were distributed as follows: ASA I 15 (28.3 %), ASA II 25 (47.16 %), ASA III 12 (22.64 %), ASA IV 1 (1.88 %). The mean operative time was 180 min (150–230 min) and the mean blood loss was 101.6 ml (50–300 ml). The robot docking time was 10 min (15–25 min) and the undocking time was 5 min (3–10 min). The mean hospital stay was 8 days (7–15 days). None of the patients was converted to either laparoscopic or open procedure. The longitudinal and circumferential margins were negative in all patients. Histopathological reports of 45 patients showed complete TME while 8 patients showed nearly complete TME. No repositioning of the robot was needed for splenic flexure mobilization, thus decreasing the operative time. Along with TME, even the splenic flexure mobilization was achieved through the same robotic ports without undocking the robot. Robot-assisted LAR and ULAR is technically feasible, and a complete TME is possible.

Research paper thumbnail of Robotic rectovaginal fistula repair

Journal of Robotic Surgery, 2011

Minimally invasive surgery for diseases in the pelvic region is gaining popularity due to advance... more Minimally invasive surgery for diseases in the pelvic region is gaining popularity due to advances in technology and increased benefit to the patient. As indications for such surgeries increase, the known boundaries for minimal access are being extended by a few teams. We report a patient who underwent robotic-assisted transabdominal repair of a high rectovaginal fistula which developed following a vaginal hysterectomy. Vaginography revealed a communication between the vaginal vault and the upper rectum. After evaluation of the colon and the vagina, the patient was planned for a robotic-assisted rectovaginal fistula repair. The three-arm daVinci(®) surgical robot was used. A total of five ports were used to complete the entire procedure, which included adhesiolysis, re-creation of the vaginal vault, repair of the fistula and omental interposition. This is the first robotic-assisted rectovaginal fistula repair reported to date. Besides the advantages of minimally invasive surgery for the patient, the surgeon benefits from the ease of suturing deep in the pelvis afforded by the articulated robotic arms.

Research paper thumbnail of Preservation of Autonomic Nerves in Laparoscopic Total Radical Hysterectomy

Journal of Laparoendoscopic & Advanced Surgical Techniques, 2010

Objectives: The aim of this study was to evaluate the feasibility, complications, margin status, ... more Objectives: The aim of this study was to evaluate the feasibility, complications, margin status, and functional outcome (on urinary and sexual functions) of nerve-sparing radical hysterectomy (NSRH) performed laparoscopically. Methods: Patients with cervical carcinoma of stage Ia2 and Ib1 underwent laparoscopic NSRH along with pelvic lymphadenectomy. We performed the technique in simple comprehensible steps with anatomic delineation of the autonomic nerves and selective cutting of the uterine and cervical branches. Results: Laparoscopic NSRH was feasible in 85.7% of patients. Mean operative time was 160 minutes and all 7 patients had clear surgical margins. There were no complications and no blood transfusions were required. The median hospital stay was 3 days. The median return time for normal bladder function was 2 days and none of them required catheterization beyond 2 weeks. The mean residual urine volume was <50 mL. Urodynamic studies performed at 3 weeks after the operation showed no impairment of maximum flow rate (maximal flow rate: 20 AE 2 mL). The postoperative results of sexual dysfunction were inconclusive. Conclusion: Understanding this technique and the knowledge of laparoscopic anatomy of pelvic autonomic nerves is important in both benign and malignant pelvic surgeries. These preliminary results indicate that nerve sparing is easier done laparoscopically and its results are comparable to that of conventional laparoscopic radical hysterectomy in terms of lateral margin status and lymph node yield. Whether quality of life can be benefited by L-NRSH technique and its long-term oncological sequelae need further evaluation.

Research paper thumbnail of Roullete Wheel Selection Mechanism for Solving Travelling Salesman Problem in Ant Colony Optimization

Research paper thumbnail of Nearest Neighbor Insertion Algorithm for solving capacitated vehicle routing problem

2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), 2015

Nearest Insertion Algorithm is heuristic algorithm which has been proven a successful technique a... more Nearest Insertion Algorithm is heuristic algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Nearest Neighbor Insertion Algorithm is taken as one of the efficient computing method for vehicle routing problem. We study a possibility of finding the optimal solution of vehicle routing problem and offer a practical implementation of the method used for solving this problem. We have taken a scenario in which different college buses takes the students from different bus stops. The experiments and result graphics shows how we effectively complete the route and generates the optimal solution.