Optimization of the Disassembly Sequencing Problem on the Basis of Self-Adaptive Simplified Swarm Optimization

Author(s):  
Wei-Chang Yeh
2007 ◽  
pp. 251-267 ◽  
Author(s):  
Mukul Tripathi ◽  
Shubham Agrawal ◽  
M Tiwari

Author(s):  
R. Jeyarani ◽  
N. Nagaveni ◽  
R. Vasanth Ram

Cloud Computing provides dynamic leasing of server capabilities as a scalable, virtualized service to end users. The discussed work focuses on Infrastructure as a Service (IaaS) model where custom Virtual Machines (VM) are launched in appropriate servers available in a data-center. The context of the environment is a large scale, heterogeneous and dynamic resource pool. Nonlinear variation in the availability of processing elements, memory size, storage capacity, and bandwidth causes resource dynamics apart from the sporadic nature of workload. The major challenge is to map a set of VM instances onto a set of servers from a dynamic resource pool so the total incremental power drawn upon the mapping is minimal and does not compromise the performance objectives. This paper proposes a novel Self Adaptive Particle Swarm Optimization (SAPSO) algorithm to solve the intractable nature of the above challenge. The proposed approach promptly detects and efficiently tracks the changing optimum that represents target servers for VM placement. The experimental results of SAPSO was compared with Multi-Strategy Ensemble Particle Swarm Optimization (MEPSO) and the results show that SAPSO outperforms the latter for power aware adaptive VM provisioning in a large scale, heterogeneous and dynamic cloud environment.


Author(s):  
Ahmed ElSayed ◽  
Elif A. Kongar ◽  
Surendra M. Gupta

Electronic products enter the waste stream rapidly due to technological enhancements. Their parts and material recovery involve significant economic and environmental gain. To regain the value added to such products a certain level of disassembly may be required. Disassembly operations are often expensive and the complexity of determining the best disassembly sequence increases as the number of parts in a product grows. Therefore, it is necessary to develop methodologies for obtaining optimal or near optimal disassembly sequences to ensure efficient recovery process. To that end, this chapter introduces a Genetic Algorithm based methodology to develop disassembly sequencing for end-of-life products. A numerical example is presented to provide and demonstrate better understating and functionality of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document