A classification approach based on the outranking model for multiple criteria ABC analysis

• We consider the non-compensation among criteria in the multiple criteria ABC analysis.
• The clustering analysis is incorporated into the ABC classification process.
• A simulated annealing algorithm is developed to search for the optimal classification.

The multiple criteria ABC analysis is widely used in inventory management, and it can help organizations to assign inventory items into different classes with respect to several evaluation criteria. Many approaches have been proposed in the literature for addressing such a problem. However, most of these approaches are fully compensatory in multiple criteria aggregation. This means that an item scoring badly on one or more key criteria could be placed in good classes because these bad performances could be compensated by other criteria. Thus, it is necessary to consider the non-compensation in the multiple criteria ABC analysis. To the best of our knowledge, the ABC classification problem with non-compensation among criteria has not been studied sufficiently. We thus propose a new classification approach based on the outranking model to cope with such a problem in this paper. However, the relational nature of the outranking model makes the search for the optimal classification solution a complex combinatorial optimization problem. It is very time-consuming to solve such a problem using mathematical programming techniques when the inventory size is large. Therefore, we combine the clustering analysis and the simulated annealing algorithm to search for the optimal classification. The clustering analysis groups similar inventory items together and builds up the hierarchy of clusters of items. The simulated annealing algorithm searches for the optimal classification on different levels of the hierarchy. The proposed approach is illustrated by a practical example from a Chinese manufacturer. Furthermore, we validate the performance of the approach through experimental investigation on a large set of artificially generated data at the end of the paper.