Saravanan Kuppusamy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Saravanan Kuppusamy has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Michael J. Magazine
4 shared publicationsUday Rao
3 shared publications- Iddrisu Awudu
Department of Management, School of Business, Quinnipiac Univeristy, Hamden, CT 06518, USA
2 shared publications Alan R. McKendall
1 shared publication- Emre Tokgoz
Computer Security Department, Pasternack School of Engineering Technology, State University of New York, Farmingdale, NY 11735, USA
1 shared publication - Gokce Baysal Turkolmez
Science Policy Research Unit, University of Sussex Business School, Brighton, UK
1 shared publication
Latest Publications
- Open Access
- 29 July 2024
- Published by Springer Nature in Information Systems Frontiers
- p. 1-19
Machine Learning Algorithms for Pricing End-of-Life Remanufactured Laptops
Due to the growing volume of e-waste in the world and its environmental impact, it is important to understand how to extend the useful life of electronic items. In this paper, we examine the remanufacturing process of end-of-life laptops for third-party remanufacturers and consider their pricing problem, which involves issues like a lack of reliable datasets, fluctuating costs of new components, and difficulties in benchmarking laptop prices, to name a few. We develop a unique approach that uses machine learning algorithms to help price remanufactured laptops. Our methodology involves a variety of techniques, which include an additive model, CART analysis, Random Forest, and Polynomial Regression. We consider depreciation and discount factors to account for the varying ages and conditions of laptops when estimating remanufactured laptop prices. Finally, we also compare our estimated prices to traditional prices. In summary, we leverage data-driven decision-making and develop a robust methodology for pricing remanufactured laptops to extend their lifespan.
- 29 July 2024
- Published by Springer Nature in Information Systems Frontiers
- p. 1-19
Open AccessMachine Learning Algorithms for Pricing End-of-Life Remanufactured Laptops
Due to the growing volume of e-waste in the world and its environmental impact, it is important to understand how to extend the useful life of electronic items. In this paper, we examine the remanufacturing process of end-of-life laptops for third-party remanufacturers and consider their pricing problem, which involves issues like a lack of reliable datasets, fluctuating costs of new components, and difficulties in benchmarking laptop prices, to name a few. We develop a unique approach that uses machine learning algorithms to help price remanufactured laptops. Our methodology involves a variety of techniques, which include an additive model, CART analysis, Random Forest, and Polynomial Regression. We consider depreciation and discount factors to account for the varying ages and conditions of laptops when estimating remanufactured laptop prices. Finally, we also compare our estimated prices to traditional prices. In summary, we leverage data-driven decision-making and develop a robust methodology for pricing remanufactured laptops to extend their lifespan.
- 1 December 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 295 (2) , 534-546
Buyer selection and service pricing in an electric fleet supply chain
- 1 December 2021
- Published by Elsevier in European Journal of Operational Research
- Vol. 295 (2) , 534-546
Buyer selection and service pricing in an electric fleet supply chain
- Open Access
- 29 September 2020
- Published by Hindawi Limited in Journal of Advanced Transportation
- Vol. 2020, 1-17
Advancing Transportation Routing Decisions Using Riemannian Manifold Surfaces
We consider several real-world driving factors such as the time spent at traffic signs (e.g., yield signs and stop signs), speed limits, and the topology of the surface to develop realistic and accurate routing solutions. Though these factors increase the complexity of modeling, they provide the flexibility to evaluate the routing solutions from different perspectives: cost, distance, and time, to name a few. First, we develop a set of algorithms based on the Riemannian manifold surface (RMS) to factor in the Earths curvature to calculate distances. Second, we present a multiobjective, nonlinear, mixed-integer model (MINLP) that minimizes the distance traveled, time traveled, traveling costs, and time spent on traffic signs to design and evaluate the routes where the waiting times associated with traffic lights, stop signs, and yield signs are stochastic. Finally, we apply MINLP and RMS-based algorithms to a set of real-life and short- and long-distance transportation problems and analyze the results from computational experiments and discrete event simulations. We show that our approaches are on par with the state-of-the-art application, Google Maps, and yield realistic routing solutions that generate significant cost savings.
- 29 September 2020
- Published by Hindawi Limited in Journal of Advanced Transportation
- Vol. 2020, 1-17
Open AccessAdvancing Transportation Routing Decisions Using Riemannian Manifold Surfaces
We consider several real-world driving factors such as the time spent at traffic signs (e.g., yield signs and stop signs), speed limits, and the topology of the surface to develop realistic and accurate routing solutions. Though these factors increase the complexity of modeling, they provide the flexibility to evaluate the routing solutions from different perspectives: cost, distance, and time, to name a few. First, we develop a set of algorithms based on the Riemannian manifold surface (RMS) to factor in the Earths curvature to calculate distances. Second, we present a multiobjective, nonlinear, mixed-integer model (MINLP) that minimizes the distance traveled, time traveled, traveling costs, and time spent on traffic signs to design and evaluate the routes where the waiting times associated with traffic lights, stop signs, and yield signs are stochastic. Finally, we apply MINLP and RMS-based algorithms to a set of real-life and short- and long-distance transportation problems and analyze the results from computational experiments and discrete event simulations. We show that our approaches are on par with the state-of-the-art application, Google Maps, and yield realistic routing solutions that generate significant cost savings.
- Open Access
- 1 January 2019
- Published by Taylor & Francis in Cogent Economics & Finance
- Vol. 7 (1)
Recruitment strategies in a university institution: a theoretical cost minimization approach
We study faculty recruitment issues in a university. We develop a cost minimization model that considers the decision-making process for the university administration by proposing a new approach of selecting tenure and non-tenure track faculty who are expected to achieve the institutional research and teaching goals. We explain the existence of tenure from an economic perspective. We propose a faculty tenure-granting process for a variety of institutions ranging from pure-teaching, teaching emphasis, research emphasis and pure-research institutions. We find that a teaching-emphasis or a pure-teaching institution (a research-emphasis or a pure-research institution) can increase the emphasis on research (teaching) without increasing costs. This paper makes important contributions to the university recruitment strategy by providing a set of guidelines on how to manage teaching and research incentives. The paper also contributes to the ongoing debate about tenure by providing a newer perspective and to the general theory of strategic university management.
- 1 January 2019
- Published by Taylor & Francis in Cogent Economics & Finance
- Vol. 7 (1)
Open AccessRecruitment strategies in a university institution: a theoretical cost minimization approach
We study faculty recruitment issues in a university. We develop a cost minimization model that considers the decision-making process for the university administration by proposing a new approach of selecting tenure and non-tenure track faculty who are expected to achieve the institutional research and teaching goals. We explain the existence of tenure from an economic perspective. We propose a faculty tenure-granting process for a variety of institutions ranging from pure-teaching, teaching emphasis, research emphasis and pure-research institutions. We find that a teaching-emphasis or a pure-teaching institution (a research-emphasis or a pure-research institution) can increase the emphasis on research (teaching) without increasing costs. This paper makes important contributions to the university recruitment strategy by providing a set of guidelines on how to manage teaching and research incentives. The paper also contributes to the ongoing debate about tenure by providing a newer perspective and to the general theory of strategic university management.
- 1 October 2017
- Published by Elsevier in European Journal of Operational Research
- Vol. 262 (1) , 151-162
The demand weighted vehicle routing problem
- 1 October 2017
- Published by Elsevier in European Journal of Operational Research
- Vol. 262 (1) , 151-162
The demand weighted vehicle routing problem
- 1 October 2017
- Published by Elsevier in European Journal of Operational Research
- Vol. 262 (1) , 123-135
Electric vehicle adoption decisions in a fleet environment
- 1 October 2017
- Published by Elsevier in European Journal of Operational Research
- Vol. 262 (1) , 123-135
Electric vehicle adoption decisions in a fleet environment
- 1 August 2006
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (8) , 2431-2444
Simulated annealing heuristics for the dynamic facility layout problem
- 1 August 2006
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (8) , 2431-2444
Simulated annealing heuristics for the dynamic facility layout problem