Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization

Table 1

The notations of the algorithm.

𝑥𝑖	The 𝑖th particle’s position of the upper level problem.
𝑦𝑗	The 𝑗th particle’s position of the lower level problem.
𝑧𝑗	The 𝑗th particle’s position of BLMPP.
𝑁𝑢	The population size of the upper level problem.
𝑁𝑙	The sub-swarm size of the lower level problem.
𝑡	Current iteration number for the overall problem.
𝑇	The predefined max iteration number for 𝑡.
𝑡𝑢	Current iteration number for the upper level problem.
𝑡𝑙	Current iteration number for the lower level problem.
𝑇𝑢	The predefined max iteration number for 𝑡𝑢.
𝑇𝑙	The predefined max iteration number for 𝑡𝑙.
ND𝑢	Non-domination sorting rank of the upper level problem.
CD𝑢	Crowding distance value of the upper level problem.
ND𝑙	Non-domination sorting rank of the lower level problem.
CD𝑙	Crowding distance value of the lower level problem.
𝑃𝑡	The 𝑡th iteration population.
𝑄𝑡	The offspring of 𝑃𝑡.
𝑆𝑡	Intermediate population.