The m-AINet is a modified version of the artificial immune network algorithm for single-objective and multimodal optimization (opt-AINet), with constraint-handling capability and improvements aiming to reduce the computational effort required by the original algorithm. In this paper we extend this algorithm for multiobjective problems by using the compromise programming approach to aggregate the objectives in the evaluation step. We adopt a compromise programming formulation that is theoretically able to map the whole Pareto front. The proposed multiobjective m-AINet is tested on the design of a loudspeaker with two objectives, showing promising results.
Campelo, F., Guimaraes, FG., & Igarashi, H. (2008). Multiobective optimization using compromise programming and an immune algorithm. IEEE Transactions on Magnetics, 44(6), 982-985. https://doi.org/10.1109/TMAG.2007.916354