An Immune Algorithm for Least Cost Advanced Tolerance Design Problem

2006 ◽  
Vol 505-507 ◽  
pp. 511-516
Author(s):  
Ta Cheng Chen ◽  
Tung-Chou Hsu

This paper considers nonlinearly mixed integer tolerance allocation problems in which both tolerance and process selection are to be decided simultaneously so as to minimize the manufacturing cost. The tolerance allocation problem has been studied in the literature for decades, usually using mathematical programming or heuristic/metaheuristic optimization approaches. The difficulties encountered for both methodologies are the number of constraints and the difficulty of satisfying the constraints. A penalty-guided artificial immune algorithm is presented for solving such mixed integer tolerance allocation problems. Numerical examples indicate that the proposed artificial immune algorithms perform well for the tolerance allocation problem considered in this paper. In particular, as reported, solutions obtained by artificial immune algorithm are as well as or better than the previously best-known solutions.

2020 ◽  
pp. 002029402096213
Author(s):  
Xiao-long Chen ◽  
Jun-qing Li ◽  
Yu-yan Han ◽  
Hong-yan Sang

The flexible job shop problem (FJSP), as one branch of the job shop scheduling, has been studied during recent years. However, several realistic constraints including the transportation time between machines and energy consumptions are generally ignored. To fill this gap, this study investigated a FJSP considering energy consumption and transportation time constraints. A sequence-based mixed integer linear programming (MILP) model based on the problem is established, and the weighted sum of maximum completion time and energy consumption is optimized. Then, we present a combinational meta-heuristic algorithm based on a simulated annealing (SA) algorithm and an artificial immune algorithm (AIA) for this problem. In the proposed algorithm, the AIA with an information entropy strategy is utilized for global optimization. In addition, the SA algorithm is embedded to enhance the local search abilities. Eventually, the Taguchi method is used to evaluate various parameters. Computational comparison with the other meta-heuristic algorithms shows that the improved artificial immune algorithm (IAIA) is more efficient for solving FJSP with different problem scales.


Sign in / Sign up

Export Citation Format

Share Document