2019

Conférence

In International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems IEA AIE’19, china, 819- 826

Bi-Level Optimization Problems (BLOPs) belong to a class of challenging problems where one optimization problem acts as a constraint to another optimization level. These problems commonly appear in many real-life applications including: transportation, game-playing, chemical engineering, etc. Indeed, multi-objective BLOP is a natural extension of the single objective BLOP that bring more computational challenges related to the multi-objective hierarchical decision making. In this context, a well-known algorithm called NSGA-II was presented in the literature among the most cited Multi-Objective Evolutionary Algorithm (MOEA) in this research area. The most prominent features of NSGA-II are its simplicity, elitist approach and a non-parametric method for diversity. For this reason, in this work, we propose a bi-level version of NSGA-II, called Bi-NSGA-II, in an attempt to exploit NSGA-II features in tackling problems involving bi-level multiple conflicting criteria. The main motivation of this paper is to investigate the performance of the proposed variant on a bi-level production distribution problem in supply chain management formulated as a Multi-objective Bi-level MDVRP (M-Bi-MDVRP). The paper reveals three Bi-NSGA-II variants for solving the M-Bi-MDVRP basing on different variation operators (M-VMX, VMX, SBX and RBX). The experimental results showed the remarkable ability of our adopted algorithm for solving such NP-hard problem.

@inproceedings{abbassi2019investigation,
  title={An investigation of a bi-level non-dominated sorting algorithm for production-distribution planning system},
  author={Abbassi, Malek and Chaabani, Abir and Said, Lamjed Ben},
  booktitle={International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems},
  pages={819--826},
  year={2019},
  organization={Springer}
}