This Python code is for the EPBII/EIPBII infill criteria published in the following article:
N. Namura, K. Shimoyama, and S. Obayashi, "Expected Improvement of Penalty-based Boundary 
Intersection for Expensive Multiobjective Optimization," IEEE Transactions on Evolutionary 
Computation, vol. 21, no. 6, pp. 898-913, 2017.
Please cite the article if you use the code.

This code was developed with Python 3.6.5.
The original code used in the article had been implemented with Fortran.
This Python code is a converted version of it, and some results may differ from the article.

This code except below is released under the MIT License, see LICENSE.txt.
The code in "EA_in_DEAP" is released under the GNU LESSER GENERAL PUBLIC LICENSE, see EA_in_DEAP/LICENSE.txt.

Contact: nobuo.namura.gp@gmail.com