R. Saravanan
R. Saravanan has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
P. Asokan
10 shared publicationsG. Prabhaharan
7 shared publications- Chinnasamy Balamurugan
Department of Mechanical Engineering, College of Engineering Guindy, Anna University, Chennai 600025, Tamil Nadu, India
5 shared publications - Sundaresan Ramabalan
Department of Mechanical Engineering, E.G.S. Pillay Engineering College, Nagapattinam, India
5 shared publications M. R. Thansekhar
K.L.N. College of Engineering
4 shared publications- Baskar Neelakandan
Saranathan College of Engineering, India
3 shared publications
Latest Publications
- 1 April 2018
- Published by American Scientific Publishers in Journal of Computational and Theoretical Nanoscience
- Vol. 15 (4) , 1170-1175
Multi Objective Optimization of Internal Gear Pair Using Evolutionary Algorithm, NSGA II
Optimization of gear transmission problem is very complex in nature, since it involves several inter related variables. Conventional methods of optimization, when applied to optimization of gear transmission problem, are not able to give global optimal solution and often trapped in local optimal points. To get best performance of a gear set, a gear designer has to compromise among many design variables, which are discrete, continuous and integer in nature. Evolutionary techniques like Genetic Algorithm (GA) come to the rescue of the gear designer in these aspects, to achieve an optimal solution, because GAs help to locate the global optimal points. A Gear design require the designer to compromise many design variables; i.e., continuous, discrete and integer variables, in order to determine best performance of gear set. In this research paper an attempt has been made to optimize the design of internal gear pair, considering multiple conflicting objectives, by taking number of teeth of pinion (Z 1), module (m) and the ratio of face width to module (ψ) as design variables. The objective functions considered for optimization are to minimize weight of the internal gear pair, to maximize the efficiency of transmission and to minimize the center distance. Several important kinematic and technical constraints were considered, within which the gear pair is made to work. An existing production gear pair design is taken as reference and optimization is carried out using an evolutionary algorithm, NSGA II. The results show that improved design can be obtained by optimization process using NSGA II.
- 1 April 2018
- Published by American Scientific Publishers in Journal of Computational and Theoretical Nanoscience
- Vol. 15 (4) , 1170-1175
Multi Objective Optimization of Internal Gear Pair Using Evolutionary Algorithm, NSGA II
Optimization of gear transmission problem is very complex in nature, since it involves several inter related variables. Conventional methods of optimization, when applied to optimization of gear transmission problem, are not able to give global optimal solution and often trapped in local optimal points. To get best performance of a gear set, a gear designer has to compromise among many design variables, which are discrete, continuous and integer in nature. Evolutionary techniques like Genetic Algorithm (GA) come to the rescue of the gear designer in these aspects, to achieve an optimal solution, because GAs help to locate the global optimal points. A Gear design require the designer to compromise many design variables; i.e., continuous, discrete and integer variables, in order to determine best performance of gear set. In this research paper an attempt has been made to optimize the design of internal gear pair, considering multiple conflicting objectives, by taking number of teeth of pinion (Z 1), module (m) and the ratio of face width to module (ψ) as design variables. The objective functions considered for optimization are to minimize weight of the internal gear pair, to maximize the efficiency of transmission and to minimize the center distance. Several important kinematic and technical constraints were considered, within which the gear pair is made to work. An existing production gear pair design is taken as reference and optimization is carried out using an evolutionary algorithm, NSGA II. The results show that improved design can be obtained by optimization process using NSGA II.
- 2 June 2015
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
- Vol. 231 (7) , 1248-1263
Multi-objective vehicle routing problem with time windows: Improving customer satisfaction by considering gap time
The vehicle routing problem with time windows is a combinatorial optimisation problem in distribution logistics. It has been infrequently measured as a multi-objective optimisation problem for the benefit of customers. For the purposes of this research, the measurement of multi-objective vehicle routing problem with time windows will be in terms of a minimisation of the total distance travelled by all vehicles, the total number of vehicles used (management beneficial objectives) and the total gap between ready time and issuing time (customer beneficial objective). It is possible to satisfy customers by issuing the goods as close as possible to the customer ready time. This is because possibilities for going out of stock during the above said time gap (by chance of improper inventory maintenance) are reduced with a minimised total time gap, which in turn increases the sales orders for the manufacturing management. An improved genetic algorithm, called the fitness aggregated genetic algorithm, has been implemented to resolve the problem. The proposed algorithm incorporates a fitness aggregation approach and dedicated operators, such as selection based on aggregate fitness value and best cost route crossover, to resolve the multi-objective problem. The algorithm was validated on Solomon’s bi-objective benchmark models for the minimisation of the total distance travelled and total number of vehicles used, and the results formed by proposed algorithm are competitive to best known results. After validating the proposed algorithm on bi-objective models, the third objective – namely, the total time gap between ready time and issuing time – is included in the bi-objective model. The results show that the suggested algorithm creates improved customer-satisfied routes without drastically affecting the total distance travelled and total number of vehicles used.
- 2 June 2015
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
- Vol. 231 (7) , 1248-1263
Multi-objective vehicle routing problem with time windows: Improving customer satisfaction by considering gap time
The vehicle routing problem with time windows is a combinatorial optimisation problem in distribution logistics. It has been infrequently measured as a multi-objective optimisation problem for the benefit of customers. For the purposes of this research, the measurement of multi-objective vehicle routing problem with time windows will be in terms of a minimisation of the total distance travelled by all vehicles, the total number of vehicles used (management beneficial objectives) and the total gap between ready time and issuing time (customer beneficial objective). It is possible to satisfy customers by issuing the goods as close as possible to the customer ready time. This is because possibilities for going out of stock during the above said time gap (by chance of improper inventory maintenance) are reduced with a minimised total time gap, which in turn increases the sales orders for the manufacturing management. An improved genetic algorithm, called the fitness aggregated genetic algorithm, has been implemented to resolve the problem. The proposed algorithm incorporates a fitness aggregation approach and dedicated operators, such as selection based on aggregate fitness value and best cost route crossover, to resolve the multi-objective problem. The algorithm was validated on Solomon’s bi-objective benchmark models for the minimisation of the total distance travelled and total number of vehicles used, and the results formed by proposed algorithm are competitive to best known results. After validating the proposed algorithm on bi-objective models, the third objective – namely, the total time gap between ready time and issuing time – is included in the bi-objective model. The results show that the suggested algorithm creates improved customer-satisfied routes without drastically affecting the total distance travelled and total number of vehicles used.
- Open Access
- 5 February 2015
- Published by Hindawi Limited in Journal of Applied Mathematics
- Vol. 2015, 1-12
Multiobjective Optimization Method Based on Adaptive Parameter Harmony Search Algorithm
The present trend in industries is to improve the techniques currently used in design and manufacture of products in order to meet the challenges of the competitive market. The crucial task nowadays is to find the optimal design and machining parameters so as to minimize the production costs. Design optimization involves more numbers of design variables with multiple and conflicting objectives, subjected to complex nonlinear constraints. The complexity of optimal design of machine elements creates the requirement for increasingly effective algorithms. Solving a nonlinear multiobjective optimization problem requires significant computing effort. From the literature it is evident that metaheuristic algorithms are performing better in dealing with multiobjective optimization. In this paper, we extend the recently developed parameter adaptive harmony search algorithm to solve multiobjective design optimization problems using the weighted sum approach. To determine the best weightage set for this analysis, a performance index based on least average error is used to determine the index of each weightage set. The proposed approach is applied to solve a biobjective design optimization of disc brake problem and a newly formulated biobjective design optimization of helical spring problem. The results reveal that the proposed approach is performing better than other algorithms.
- 5 February 2015
- Published by Hindawi Limited in Journal of Applied Mathematics
- Vol. 2015, 1-12
Open AccessMultiobjective Optimization Method Based on Adaptive Parameter Harmony Search Algorithm
The present trend in industries is to improve the techniques currently used in design and manufacture of products in order to meet the challenges of the competitive market. The crucial task nowadays is to find the optimal design and machining parameters so as to minimize the production costs. Design optimization involves more numbers of design variables with multiple and conflicting objectives, subjected to complex nonlinear constraints. The complexity of optimal design of machine elements creates the requirement for increasingly effective algorithms. Solving a nonlinear multiobjective optimization problem requires significant computing effort. From the literature it is evident that metaheuristic algorithms are performing better in dealing with multiobjective optimization. In this paper, we extend the recently developed parameter adaptive harmony search algorithm to solve multiobjective design optimization problems using the weighted sum approach. To determine the best weightage set for this analysis, a performance index based on least average error is used to determine the index of each weightage set. The proposed approach is applied to solve a biobjective design optimization of disc brake problem and a newly formulated biobjective design optimization of helical spring problem. The results reveal that the proposed approach is performing better than other algorithms.
- Open Access
- 30 December 2014
- Published by Elsevier in Procedia Engineering
- Vol. 97, 2176-2185
Solving Multi-objective Vehicle Routing Problem with Time Windows by FAGA
- 30 December 2014
- Published by Elsevier in Procedia Engineering
- Vol. 97, 2176-2185
Open AccessSolving Multi-objective Vehicle Routing Problem with Time Windows by FAGA
- 30 September 2014
- Published by Praise Worthy Prize in International Review of Mechanical Engineering (IREME)
- Vol. 8 (5) , 977
The Influence of Reverse Logistics on Reclaiming – A Case of Recycling Used Truck Tires
When using recovered raw materials to manufacture recycled products, the key to quality is securing reliable quantities of clean, homogenous materials. Naturally the implementation of such recycling system requires an appropriate reverse logistics network. The search for new ways to recycle rubber waste including used tires focusing quality is the aim of many studies worldwide. The recycling of used tire and make use of that into new tires has been slow to develop; because of technological and economic limitations resulting from differences in chemistry and fabrication methods used to produce the tires. This paper focus on producing reclaimed rubber from used tires with consistent quality characteristics. A case study was conducted in a used truck tires recycling plant employed single screw extruder reclaimator process. Traditional feed of recovered materials using existing reverse logistics networks and organized feed of recovered materials with a proposed network involved in the used truck tires has been analyzed in the paper focusing the quality characteristics of reclaimed rubber made out of used tires though experimental research work. The influence of organized buffing powder feed on various quality characteristics of the devulcanized material were studied and presented by using MATLAB. It has been observed that the devulcanization process in reclaimator process depends on the temperature and residence time acting on buffing powder in which the organized feeding of recovered material plays a vital role. Obtained products possess consistent quality comparable to that of reclaim rubber available on the market. Copyright © 2014 Praise Worthy Prize - All rights reserved.
- 30 September 2014
- Published by Praise Worthy Prize in International Review of Mechanical Engineering (IREME)
- Vol. 8 (5) , 977
The Influence of Reverse Logistics on Reclaiming – A Case of Recycling Used Truck Tires
When using recovered raw materials to manufacture recycled products, the key to quality is securing reliable quantities of clean, homogenous materials. Naturally the implementation of such recycling system requires an appropriate reverse logistics network. The search for new ways to recycle rubber waste including used tires focusing quality is the aim of many studies worldwide. The recycling of used tire and make use of that into new tires has been slow to develop; because of technological and economic limitations resulting from differences in chemistry and fabrication methods used to produce the tires. This paper focus on producing reclaimed rubber from used tires with consistent quality characteristics. A case study was conducted in a used truck tires recycling plant employed single screw extruder reclaimator process. Traditional feed of recovered materials using existing reverse logistics networks and organized feed of recovered materials with a proposed network involved in the used truck tires has been analyzed in the paper focusing the quality characteristics of reclaimed rubber made out of used tires though experimental research work. The influence of organized buffing powder feed on various quality characteristics of the devulcanized material were studied and presented by using MATLAB. It has been observed that the devulcanization process in reclaimator process depends on the temperature and residence time acting on buffing powder in which the organized feeding of recovered material plays a vital role. Obtained products possess consistent quality comparable to that of reclaim rubber available on the market. Copyright © 2014 Praise Worthy Prize - All rights reserved.
- 16 July 2014
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 984-985, 1261-1268
A New Multi Objective Genetic Algorithm: Fitness Aggregated Genetic Algorithm (FAGA) for Vehicle Routing Problem
This paper presents multi objective vehicle routing problem in which the total distance travelled by the vehicles and total number of vehicles used are minimized. In general, fitness assignment procedure, as one of the important operators, influences the effectiveness of multi objective genetic algorithms. In this paper genetic algorithm with different fitness assignment approach and specialized crossover called Fitness Aggregated Genetic Algorithm (FAGA) is introduced for solving the problem. The suggested algorithm is investigated on large number of popular benchmarks for vehicle routing problem. It is observed from the results that the suggested new algorithm is very effective and the solutions are competitive with the best known results.
- 16 July 2014
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 984-985, 1261-1268
A New Multi Objective Genetic Algorithm: Fitness Aggregated Genetic Algorithm (FAGA) for Vehicle Routing Problem
This paper presents multi objective vehicle routing problem in which the total distance travelled by the vehicles and total number of vehicles used are minimized. In general, fitness assignment procedure, as one of the important operators, influences the effectiveness of multi objective genetic algorithms. In this paper genetic algorithm with different fitness assignment approach and specialized crossover called Fitness Aggregated Genetic Algorithm (FAGA) is introduced for solving the problem. The suggested algorithm is investigated on large number of popular benchmarks for vehicle routing problem. It is observed from the results that the suggested new algorithm is very effective and the solutions are competitive with the best known results.
- 16 July 2014
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 984-985, 419-424
Multi Objective Design Optimization of Two Bar Truss Using NSGA II and TOPSIS
Arriving optimal solutions is one of the important tasks in engineering design. Many real-world design optimization problems involve multiple conflicting objectives. The design variables are of continuous or discrete in nature. In general, for solving Multi Objective Optimization methods weight method is preferred. In this method, all the objective functions are converted into a single objective function by assigning suitable weights to each objective functions. The main drawback lies in the selection of proper weights. Recently, evolutionary algorithms are used to find the nondominated optimal solutions called as Pareto optimal front in a single run. In recent years, Non-dominated Sorting Genetic Algorithm II (NSGA-II) finds increasing applications in solving multi objective problems comprising of conflicting objectives because of low computational requirements, elitism and parameter-less sharing approach. In this work, we propose a methodology which integrates NSGA-II and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for solving a two bar truss problem. NSGA-II searches for the Pareto set where two bar truss is evaluated in terms of minimizing the weight of the truss and minimizing the total displacement of the joint under the given load. Subsequently, TOPSIS selects the best compromise solution.
- 16 July 2014
- Published by Trans Tech Publications, Ltd. in Advanced Materials Research
- Vol. 984-985, 419-424
Multi Objective Design Optimization of Two Bar Truss Using NSGA II and TOPSIS
Arriving optimal solutions is one of the important tasks in engineering design. Many real-world design optimization problems involve multiple conflicting objectives. The design variables are of continuous or discrete in nature. In general, for solving Multi Objective Optimization methods weight method is preferred. In this method, all the objective functions are converted into a single objective function by assigning suitable weights to each objective functions. The main drawback lies in the selection of proper weights. Recently, evolutionary algorithms are used to find the nondominated optimal solutions called as Pareto optimal front in a single run. In recent years, Non-dominated Sorting Genetic Algorithm II (NSGA-II) finds increasing applications in solving multi objective problems comprising of conflicting objectives because of low computational requirements, elitism and parameter-less sharing approach. In this work, we propose a methodology which integrates NSGA-II and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) for solving a two bar truss problem. NSGA-II searches for the Pareto set where two bar truss is evaluated in terms of minimizing the weight of the truss and minimizing the total displacement of the joint under the given load. Subsequently, TOPSIS selects the best compromise solution.