Open Access. Powered by Scholars. Published by Universities.®

Science and Technology Studies Commons

Open Access. Powered by Scholars. Published by Universities.®

Era2015

Nagesh Shukla

Articles 1 - 2 of 2

Full-Text Articles in Science and Technology Studies

Key Characteristics-Based Sensor Distribution In Multi-Station Assembly Processes, Nagesh Shukla, Darek Ceglarek, Manoj K. Tiwari Apr 2015

Key Characteristics-Based Sensor Distribution In Multi-Station Assembly Processes, Nagesh Shukla, Darek Ceglarek, Manoj K. Tiwari

Nagesh Shukla

This paper presents a novel approach for optimal key characteristics-based sensor distribution in a multi-station assembly process, for the purpose of diagnosing variation sources responsible for product quality defects in a timely manner. Current approaches for sensor distribution are based on the assumption that measurement points can be allocated at arbitrary locations on the part or subassembly. This not only presents challenges in the implementation of these approaches but additionally does not allow required product assurance and quality control standards to be integrated with them, due to lack of explicit relations between measured features and geometric dimensioning and tolerancing (GD ...


Algorithm Portfolios For Logistics Optimization Considering Stochastic Demands And Mobility Allowance, N Shukla, A K. Choudhary, P Prakash, K J. Fernandes, M K. Tiwari Apr 2015

Algorithm Portfolios For Logistics Optimization Considering Stochastic Demands And Mobility Allowance, N Shukla, A K. Choudhary, P Prakash, K J. Fernandes, M K. Tiwari

Nagesh Shukla

The vehicle routing problem with stochastic demand (VRPSD) is a well known NP-hard problem. The uncharacteristic behaviour associated with the problem enhances the computational efforts required to obtain a feasible and near-optimal solution. This paper proposes an algorithm portfolio methodology based on evolutionary algorithms, which takes into account the stochastic nature of customer demand to solve this computationally complex problem. These problems are well known to have computationally complex objective functions, which make their solutions hard to find, particularly when problem instances of large dimensions are considered. Of particular importance in such situations is the timeliness of the solution. For ...